./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_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 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 10:15:42,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 10:15:42,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 10:15:42,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 10:15:42,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 10:15:42,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 10:15:42,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 10:15:42,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 10:15:42,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 10:15:42,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 10:15:42,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 10:15:42,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 10:15:42,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 10:15:42,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 10:15:42,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 10:15:42,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 10:15:42,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 10:15:42,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 10:15:42,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 10:15:42,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 10:15:42,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 10:15:42,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 10:15:42,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 10:15:42,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 10:15:42,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 10:15:42,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 10:15:42,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 10:15:42,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 10:15:42,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 10:15:42,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 10:15:42,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 10:15:42,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 10:15:42,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 10:15:42,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 10:15:42,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 10:15:42,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 10:15:42,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 10:15:42,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 10:15:42,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 10:15:42,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 10:15:42,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 10:15:42,375 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 10:15:42,405 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 10:15:42,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 10:15:42,406 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 10:15:42,406 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 10:15:42,407 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 10:15:42,407 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 10:15:42,407 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 10:15:42,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 10:15:42,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 10:15:42,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 10:15:42,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 10:15:42,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 10:15:42,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 10:15:42,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 10:15:42,409 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 10:15:42,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 10:15:42,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 10:15:42,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 10:15:42,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 10:15:42,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:15:42,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 10:15:42,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 10:15:42,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 10:15:42,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 10:15:42,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 10:15:42,411 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 10:15:42,411 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 10:15:42,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 10:15:42,411 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 10:15:42,411 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 -> 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 [2021-11-06 10:15:42,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 10:15:42,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 10:15:42,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 10:15:42,614 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 10:15:42,615 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 10:15:42,615 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2021-11-06 10:15:42,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e0a4588/2f3b8e8676bd4de09c4f13d8a5020ceb/FLAGf94d96c48 [2021-11-06 10:15:43,214 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 10:15:43,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2021-11-06 10:15:43,246 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e0a4588/2f3b8e8676bd4de09c4f13d8a5020ceb/FLAGf94d96c48 [2021-11-06 10:15:43,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e0a4588/2f3b8e8676bd4de09c4f13d8a5020ceb [2021-11-06 10:15:43,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 10:15:43,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 10:15:43,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 10:15:43,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 10:15:43,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 10:15:43,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:43" (1/1) ... [2021-11-06 10:15:43,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2d9cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:43, skipping insertion in model container [2021-11-06 10:15:43,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:43" (1/1) ... [2021-11-06 10:15:43,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 10:15:43,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 10:15:44,009 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2021-11-06 10:15:44,015 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2021-11-06 10:15:44,029 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:15:44,033 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:15:44,586 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:44,587 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:44,587 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:44,587 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:44,588 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:44,605 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:44,606 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:44,609 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:44,609 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:44,820 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:15:44,821 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:15:44,822 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:15:44,822 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:15:44,823 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:15:44,824 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:15:44,824 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:15:44,824 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:15:44,825 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:15:44,825 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:15:44,896 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:15:44,944 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:44,945 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:44,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:15:45,015 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 10:15:45,027 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2021-11-06 10:15:45,027 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2021-11-06 10:15:45,028 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:15:45,029 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:15:45,046 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:45,047 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:45,048 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:45,049 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:45,050 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:45,055 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:45,058 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:45,059 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:45,059 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:45,075 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:15:45,075 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:15:45,076 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:15:45,076 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:15:45,076 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:15:45,077 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:15:45,077 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:15:45,077 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:15:45,078 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:15:45,078 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:15:45,092 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:15:45,140 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:45,144 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:45,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:15:45,323 INFO L208 MainTranslator]: Completed translation [2021-11-06 10:15:45,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45 WrapperNode [2021-11-06 10:15:45,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 10:15:45,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 10:15:45,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 10:15:45,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 10:15:45,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2021-11-06 10:15:45,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2021-11-06 10:15:45,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 10:15:45,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 10:15:45,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 10:15:45,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 10:15:45,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2021-11-06 10:15:45,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2021-11-06 10:15:45,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2021-11-06 10:15:45,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2021-11-06 10:15:45,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2021-11-06 10:15:45,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2021-11-06 10:15:45,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2021-11-06 10:15:45,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 10:15:45,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 10:15:45,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 10:15:45,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 10:15:45,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (1/1) ... [2021-11-06 10:15:45,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:15:45,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:15:45,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 10:15:45,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 10:15:45,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 10:15:45,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 10:15:45,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 10:15:45,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 10:15:45,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 10:15:45,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 10:15:45,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 10:15:45,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 10:15:45,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 10:15:45,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 10:15:45,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 10:15:52,265 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 10:15:52,266 INFO L299 CfgBuilder]: Removed 38 assume(true) statements. [2021-11-06 10:15:52,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:52 BoogieIcfgContainer [2021-11-06 10:15:52,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 10:15:52,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 10:15:52,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 10:15:52,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 10:15:52,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:15:43" (1/3) ... [2021-11-06 10:15:52,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b99ead3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:52, skipping insertion in model container [2021-11-06 10:15:52,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:45" (2/3) ... [2021-11-06 10:15:52,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b99ead3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:52, skipping insertion in model container [2021-11-06 10:15:52,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:52" (3/3) ... [2021-11-06 10:15:52,273 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_empty_array_harness.i [2021-11-06 10:15:52,276 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 10:15:52,276 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-11-06 10:15:52,302 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 10:15:52,305 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 10:15:52,306 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-06 10:15:52,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 77 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:52,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-06 10:15:52,323 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:52,324 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:52,324 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:15:52,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:52,330 INFO L85 PathProgramCache]: Analyzing trace with hash 810375617, now seen corresponding path program 1 times [2021-11-06 10:15:52,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:52,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745661876] [2021-11-06 10:15:52,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:52,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:52,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:52,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745661876] [2021-11-06 10:15:52,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745661876] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:52,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:52,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 10:15:52,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844318636] [2021-11-06 10:15:52,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 10:15:52,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:52,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 10:15:52,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 10:15:52,835 INFO L87 Difference]: Start difference. First operand has 78 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 77 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:52,853 INFO L93 Difference]: Finished difference Result 153 states and 204 transitions. [2021-11-06 10:15:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 10:15:52,854 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-06 10:15:52,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:52,859 INFO L225 Difference]: With dead ends: 153 [2021-11-06 10:15:52,859 INFO L226 Difference]: Without dead ends: 71 [2021-11-06 10:15:52,861 INFO L786 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 [2021-11-06 10:15:52,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-06 10:15:52,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-06 10:15:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.328125) internal successors, (85), 70 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2021-11-06 10:15:52,886 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 14 [2021-11-06 10:15:52,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:52,886 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2021-11-06 10:15:52,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2021-11-06 10:15:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-06 10:15:52,888 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:52,890 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:52,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 10:15:52,890 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:15:52,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:52,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1068541055, now seen corresponding path program 1 times [2021-11-06 10:15:52,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:52,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599508550] [2021-11-06 10:15:52,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:52,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:53,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:53,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599508550] [2021-11-06 10:15:53,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599508550] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:53,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:53,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:15:53,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280262019] [2021-11-06 10:15:53,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:15:53,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:53,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:15:53,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:15:53,158 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:53,245 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2021-11-06 10:15:53,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:15:53,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-06 10:15:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:53,246 INFO L225 Difference]: With dead ends: 120 [2021-11-06 10:15:53,246 INFO L226 Difference]: Without dead ends: 71 [2021-11-06 10:15:53,247 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:15:53,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-06 10:15:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-06 10:15:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.3125) internal successors, (84), 70 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2021-11-06 10:15:53,250 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 14 [2021-11-06 10:15:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:53,250 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2021-11-06 10:15:53,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2021-11-06 10:15:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-06 10:15:53,251 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:53,251 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:53,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 10:15:53,251 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:15:53,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:53,252 INFO L85 PathProgramCache]: Analyzing trace with hash -715146382, now seen corresponding path program 1 times [2021-11-06 10:15:53,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:53,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768909493] [2021-11-06 10:15:53,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:53,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:53,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:53,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768909493] [2021-11-06 10:15:53,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768909493] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:53,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:53,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:15:53,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028698833] [2021-11-06 10:15:53,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:15:53,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:53,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:15:53,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:15:53,452 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:53,616 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2021-11-06 10:15:53,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:15:53,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-06 10:15:53,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:53,617 INFO L225 Difference]: With dead ends: 173 [2021-11-06 10:15:53,617 INFO L226 Difference]: Without dead ends: 115 [2021-11-06 10:15:53,618 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:15:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-06 10:15:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 75. [2021-11-06 10:15:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 74 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2021-11-06 10:15:53,622 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 20 [2021-11-06 10:15:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:53,622 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2021-11-06 10:15:53,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2021-11-06 10:15:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-06 10:15:53,623 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:53,623 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:53,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 10:15:53,623 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:15:53,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:53,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1524493008, now seen corresponding path program 1 times [2021-11-06 10:15:53,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:53,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412161013] [2021-11-06 10:15:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:53,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:53,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:53,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412161013] [2021-11-06 10:15:53,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412161013] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:53,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:53,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:15:53,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856046350] [2021-11-06 10:15:53,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:15:53,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:53,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:15:53,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:15:53,800 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:53,956 INFO L93 Difference]: Finished difference Result 147 states and 174 transitions. [2021-11-06 10:15:53,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:15:53,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-06 10:15:53,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:53,957 INFO L225 Difference]: With dead ends: 147 [2021-11-06 10:15:53,958 INFO L226 Difference]: Without dead ends: 95 [2021-11-06 10:15:53,958 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:15:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-06 10:15:53,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 79. [2021-11-06 10:15:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 78 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2021-11-06 10:15:53,963 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 20 [2021-11-06 10:15:53,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:53,964 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2021-11-06 10:15:53,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2021-11-06 10:15:53,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-06 10:15:53,964 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:53,965 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:53,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 10:15:53,965 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:15:53,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:53,965 INFO L85 PathProgramCache]: Analyzing trace with hash -322119372, now seen corresponding path program 1 times [2021-11-06 10:15:53,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:53,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216574257] [2021-11-06 10:15:53,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:53,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:54,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:54,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216574257] [2021-11-06 10:15:54,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216574257] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:54,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:54,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:15:54,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447312805] [2021-11-06 10:15:54,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:15:54,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:54,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:15:54,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:15:54,452 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:54,893 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2021-11-06 10:15:54,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:15:54,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-06 10:15:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:54,895 INFO L225 Difference]: With dead ends: 139 [2021-11-06 10:15:54,895 INFO L226 Difference]: Without dead ends: 135 [2021-11-06 10:15:54,895 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:15:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-11-06 10:15:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 87. [2021-11-06 10:15:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 80 states have (on average 1.25) internal successors, (100), 86 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2021-11-06 10:15:54,898 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 20 [2021-11-06 10:15:54,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:54,898 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2021-11-06 10:15:54,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:54,899 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2021-11-06 10:15:54,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-06 10:15:54,899 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:54,899 INFO L513 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] [2021-11-06 10:15:54,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 10:15:54,899 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:15:54,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:54,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2144800216, now seen corresponding path program 1 times [2021-11-06 10:15:54,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:54,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925004704] [2021-11-06 10:15:54,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:54,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:55,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:55,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925004704] [2021-11-06 10:15:55,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925004704] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:55,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:55,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:15:55,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993349874] [2021-11-06 10:15:55,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:15:55,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:55,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:15:55,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:15:55,270 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:57,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:57,671 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2021-11-06 10:15:57,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:15:57,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-06 10:15:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:57,672 INFO L225 Difference]: With dead ends: 153 [2021-11-06 10:15:57,672 INFO L226 Difference]: Without dead ends: 94 [2021-11-06 10:15:57,673 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:15:57,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-06 10:15:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2021-11-06 10:15:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 88 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2021-11-06 10:15:57,676 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 24 [2021-11-06 10:15:57,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:57,676 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2021-11-06 10:15:57,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:57,677 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2021-11-06 10:15:57,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-06 10:15:57,677 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:57,677 INFO L513 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] [2021-11-06 10:15:57,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 10:15:57,678 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:15:57,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:57,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1464741846, now seen corresponding path program 1 times [2021-11-06 10:15:57,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:57,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766055813] [2021-11-06 10:15:57,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:57,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:58,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:58,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766055813] [2021-11-06 10:15:58,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766055813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:58,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:58,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:15:58,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233984881] [2021-11-06 10:15:58,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:15:58,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:58,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:15:58,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:15:58,025 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:02,633 INFO L93 Difference]: Finished difference Result 206 states and 231 transitions. [2021-11-06 10:16:02,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:16:02,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-06 10:16:02,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:02,634 INFO L225 Difference]: With dead ends: 206 [2021-11-06 10:16:02,634 INFO L226 Difference]: Without dead ends: 143 [2021-11-06 10:16:02,635 INFO L786 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 [2021-11-06 10:16:02,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-06 10:16:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 95. [2021-11-06 10:16:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 94 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2021-11-06 10:16:02,642 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 24 [2021-11-06 10:16:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:02,643 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2021-11-06 10:16:02,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2021-11-06 10:16:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-06 10:16:02,643 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:02,644 INFO L513 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] [2021-11-06 10:16:02,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 10:16:02,644 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:02,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash -711790034, now seen corresponding path program 1 times [2021-11-06 10:16:02,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:02,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591396039] [2021-11-06 10:16:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:02,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:06,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:06,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591396039] [2021-11-06 10:16:06,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591396039] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:06,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:06,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:16:06,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563097516] [2021-11-06 10:16:06,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:16:06,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:06,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:16:06,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:16:06,430 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:09,472 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2021-11-06 10:16:09,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 10:16:09,473 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-06 10:16:09,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:09,473 INFO L225 Difference]: With dead ends: 209 [2021-11-06 10:16:09,473 INFO L226 Difference]: Without dead ends: 130 [2021-11-06 10:16:09,474 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-11-06 10:16:09,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-06 10:16:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 98. [2021-11-06 10:16:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 97 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:09,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2021-11-06 10:16:09,478 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 24 [2021-11-06 10:16:09,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:09,478 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2021-11-06 10:16:09,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2021-11-06 10:16:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-06 10:16:09,479 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:09,480 INFO L513 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] [2021-11-06 10:16:09,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 10:16:09,480 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:09,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1994829360, now seen corresponding path program 1 times [2021-11-06 10:16:09,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:09,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687340763] [2021-11-06 10:16:09,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:09,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:11,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:11,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687340763] [2021-11-06 10:16:11,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687340763] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:11,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:11,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:16:11,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115035539] [2021-11-06 10:16:11,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:16:11,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:11,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:16:11,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:16:11,285 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:13,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:13,971 INFO L93 Difference]: Finished difference Result 185 states and 208 transitions. [2021-11-06 10:16:13,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:16:13,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-06 10:16:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:13,973 INFO L225 Difference]: With dead ends: 185 [2021-11-06 10:16:13,973 INFO L226 Difference]: Without dead ends: 116 [2021-11-06 10:16:13,973 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:16:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-06 10:16:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2021-11-06 10:16:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.2087912087912087) internal successors, (110), 97 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2021-11-06 10:16:13,977 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 24 [2021-11-06 10:16:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:13,977 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2021-11-06 10:16:13,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2021-11-06 10:16:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-06 10:16:13,978 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:13,978 INFO L513 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] [2021-11-06 10:16:13,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 10:16:13,978 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:13,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:13,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2041972498, now seen corresponding path program 1 times [2021-11-06 10:16:13,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:13,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902782926] [2021-11-06 10:16:13,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:13,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:14,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:14,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902782926] [2021-11-06 10:16:14,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902782926] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:14,216 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:14,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:16:14,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442371356] [2021-11-06 10:16:14,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:16:14,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:14,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:16:14,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:16:14,217 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:16,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:16,620 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2021-11-06 10:16:16,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:16:16,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-06 10:16:16,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:16,621 INFO L225 Difference]: With dead ends: 164 [2021-11-06 10:16:16,621 INFO L226 Difference]: Without dead ends: 93 [2021-11-06 10:16:16,621 INFO L786 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 [2021-11-06 10:16:16,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-06 10:16:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-11-06 10:16:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2021-11-06 10:16:16,624 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 24 [2021-11-06 10:16:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:16,624 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2021-11-06 10:16:16,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2021-11-06 10:16:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-06 10:16:16,625 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:16,625 INFO L513 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] [2021-11-06 10:16:16,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 10:16:16,625 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:16,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:16,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1548380899, now seen corresponding path program 1 times [2021-11-06 10:16:16,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:16,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444902902] [2021-11-06 10:16:16,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:16,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:17,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:17,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444902902] [2021-11-06 10:16:17,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444902902] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:17,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:17,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:16:17,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179653004] [2021-11-06 10:16:17,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:16:17,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:17,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:16:17,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:16:17,036 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:17,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:17,893 INFO L93 Difference]: Finished difference Result 165 states and 180 transitions. [2021-11-06 10:16:17,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-06 10:16:17,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-06 10:16:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:17,894 INFO L225 Difference]: With dead ends: 165 [2021-11-06 10:16:17,894 INFO L226 Difference]: Without dead ends: 161 [2021-11-06 10:16:17,895 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:16:17,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-06 10:16:17,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 97. [2021-11-06 10:16:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.1777777777777778) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:17,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2021-11-06 10:16:17,898 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 26 [2021-11-06 10:16:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:17,898 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2021-11-06 10:16:17,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2021-11-06 10:16:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-06 10:16:17,899 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:17,899 INFO L513 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] [2021-11-06 10:16:17,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 10:16:17,900 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:17,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:17,900 INFO L85 PathProgramCache]: Analyzing trace with hash 739034273, now seen corresponding path program 1 times [2021-11-06 10:16:17,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:17,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670662205] [2021-11-06 10:16:17,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:17,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:18,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:18,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670662205] [2021-11-06 10:16:18,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670662205] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:18,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:18,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:16:18,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985081537] [2021-11-06 10:16:18,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:16:18,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:18,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:16:18,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:16:18,162 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:20,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:20,431 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2021-11-06 10:16:20,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:16:20,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-06 10:16:20,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:20,433 INFO L225 Difference]: With dead ends: 158 [2021-11-06 10:16:20,433 INFO L226 Difference]: Without dead ends: 93 [2021-11-06 10:16:20,433 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:16:20,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-06 10:16:20,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2021-11-06 10:16:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 88 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:20,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2021-11-06 10:16:20,436 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 26 [2021-11-06 10:16:20,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:20,436 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2021-11-06 10:16:20,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2021-11-06 10:16:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-06 10:16:20,437 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:20,437 INFO L513 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] [2021-11-06 10:16:20,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 10:16:20,437 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:20,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:20,437 INFO L85 PathProgramCache]: Analyzing trace with hash -365390039, now seen corresponding path program 1 times [2021-11-06 10:16:20,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:20,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047905969] [2021-11-06 10:16:20,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:20,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:20,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:20,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047905969] [2021-11-06 10:16:20,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047905969] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:20,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:20,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:16:20,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58342998] [2021-11-06 10:16:20,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:16:20,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:20,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:16:20,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:16:20,607 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:20,688 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2021-11-06 10:16:20,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:16:20,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-06 10:16:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:20,689 INFO L225 Difference]: With dead ends: 118 [2021-11-06 10:16:20,689 INFO L226 Difference]: Without dead ends: 89 [2021-11-06 10:16:20,689 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:16:20,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-06 10:16:20,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-11-06 10:16:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2021-11-06 10:16:20,691 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 26 [2021-11-06 10:16:20,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:20,692 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2021-11-06 10:16:20,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:20,692 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2021-11-06 10:16:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-06 10:16:20,692 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:20,692 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:20,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 10:16:20,692 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1400671456, now seen corresponding path program 1 times [2021-11-06 10:16:20,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:20,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379549238] [2021-11-06 10:16:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:20,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:21,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:21,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379549238] [2021-11-06 10:16:21,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379549238] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:21,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:21,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:16:21,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789497331] [2021-11-06 10:16:21,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:16:21,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:21,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:16:21,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:16:21,039 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:27,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:27,755 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2021-11-06 10:16:27,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:16:27,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-06 10:16:27,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:27,756 INFO L225 Difference]: With dead ends: 89 [2021-11-06 10:16:27,756 INFO L226 Difference]: Without dead ends: 87 [2021-11-06 10:16:27,756 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:16:27,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-11-06 10:16:27,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-11-06 10:16:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.146341463414634) internal successors, (94), 86 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2021-11-06 10:16:27,758 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 34 [2021-11-06 10:16:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:27,758 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2021-11-06 10:16:27,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2021-11-06 10:16:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 10:16:27,759 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:27,759 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:27,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 10:16:27,759 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:27,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:27,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1720376510, now seen corresponding path program 1 times [2021-11-06 10:16:27,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:27,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60454359] [2021-11-06 10:16:27,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:27,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:29,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:29,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60454359] [2021-11-06 10:16:29,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60454359] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:29,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:29,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:16:29,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873950144] [2021-11-06 10:16:29,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:16:29,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:29,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:16:29,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:16:29,419 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:34,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:34,097 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2021-11-06 10:16:34,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:16:34,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-06 10:16:34,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:34,098 INFO L225 Difference]: With dead ends: 87 [2021-11-06 10:16:34,098 INFO L226 Difference]: Without dead ends: 85 [2021-11-06 10:16:34,098 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:16:34,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-06 10:16:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-11-06 10:16:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 84 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2021-11-06 10:16:34,100 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 36 [2021-11-06 10:16:34,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:34,101 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2021-11-06 10:16:34,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2021-11-06 10:16:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 10:16:34,101 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:34,101 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:34,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 10:16:34,101 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:34,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:34,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1549467370, now seen corresponding path program 1 times [2021-11-06 10:16:34,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:34,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016742497] [2021-11-06 10:16:34,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:34,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:34,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:34,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016742497] [2021-11-06 10:16:34,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016742497] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:34,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:34,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:16:34,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917956628] [2021-11-06 10:16:34,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:16:34,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:34,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:16:34,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:16:34,557 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:37,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:37,311 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2021-11-06 10:16:37,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:16:37,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-06 10:16:37,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:37,312 INFO L225 Difference]: With dead ends: 125 [2021-11-06 10:16:37,312 INFO L226 Difference]: Without dead ends: 98 [2021-11-06 10:16:37,313 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:16:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-06 10:16:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2021-11-06 10:16:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 86 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2021-11-06 10:16:37,315 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 36 [2021-11-06 10:16:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:37,315 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2021-11-06 10:16:37,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2021-11-06 10:16:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 10:16:37,315 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:37,316 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:37,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 10:16:37,316 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:37,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:37,316 INFO L85 PathProgramCache]: Analyzing trace with hash -869409000, now seen corresponding path program 1 times [2021-11-06 10:16:37,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:37,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667944867] [2021-11-06 10:16:37,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:37,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:39,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:39,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667944867] [2021-11-06 10:16:39,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667944867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:39,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:39,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:16:39,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691863817] [2021-11-06 10:16:39,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:16:39,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:39,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:16:39,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:16:39,161 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:42,156 INFO L93 Difference]: Finished difference Result 198 states and 212 transitions. [2021-11-06 10:16:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:16:42,157 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-06 10:16:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:42,158 INFO L225 Difference]: With dead ends: 198 [2021-11-06 10:16:42,158 INFO L226 Difference]: Without dead ends: 158 [2021-11-06 10:16:42,160 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:16:42,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-11-06 10:16:42,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 109. [2021-11-06 10:16:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 105 states have (on average 1.1238095238095238) internal successors, (118), 108 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2021-11-06 10:16:42,164 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 36 [2021-11-06 10:16:42,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:42,164 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2021-11-06 10:16:42,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2021-11-06 10:16:42,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 10:16:42,165 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:42,165 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:42,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 10:16:42,165 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:42,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:42,165 INFO L85 PathProgramCache]: Analyzing trace with hash -611243562, now seen corresponding path program 1 times [2021-11-06 10:16:42,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:42,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191906768] [2021-11-06 10:16:42,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:42,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:42,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:42,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191906768] [2021-11-06 10:16:42,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191906768] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:42,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:42,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:16:42,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476376343] [2021-11-06 10:16:42,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:16:42,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:42,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:16:42,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:16:42,569 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:45,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:45,239 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2021-11-06 10:16:45,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:16:45,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-06 10:16:45,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:45,241 INFO L225 Difference]: With dead ends: 162 [2021-11-06 10:16:45,241 INFO L226 Difference]: Without dead ends: 120 [2021-11-06 10:16:45,241 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:16:45,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-11-06 10:16:45,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 107. [2021-11-06 10:16:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 103 states have (on average 1.1067961165048543) internal successors, (114), 106 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2021-11-06 10:16:45,244 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 36 [2021-11-06 10:16:45,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:45,244 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2021-11-06 10:16:45,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:45,245 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2021-11-06 10:16:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-06 10:16:45,245 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:45,245 INFO L513 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] [2021-11-06 10:16:45,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 10:16:45,245 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:45,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:45,246 INFO L85 PathProgramCache]: Analyzing trace with hash 280712196, now seen corresponding path program 1 times [2021-11-06 10:16:45,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:45,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818044646] [2021-11-06 10:16:45,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:45,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:45,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:45,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818044646] [2021-11-06 10:16:45,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818044646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:45,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:45,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:16:45,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108985198] [2021-11-06 10:16:45,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:16:45,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:45,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:16:45,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:16:45,612 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:50,137 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2021-11-06 10:16:50,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:16:50,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-06 10:16:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:50,138 INFO L225 Difference]: With dead ends: 107 [2021-11-06 10:16:50,138 INFO L226 Difference]: Without dead ends: 105 [2021-11-06 10:16:50,138 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:16:50,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-06 10:16:50,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-11-06 10:16:50,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 102 states have (on average 1.0980392156862746) internal successors, (112), 104 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2021-11-06 10:16:50,141 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 38 [2021-11-06 10:16:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:50,141 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2021-11-06 10:16:50,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2021-11-06 10:16:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-06 10:16:50,142 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:50,142 INFO L513 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] [2021-11-06 10:16:50,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 10:16:50,142 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:50,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:50,142 INFO L85 PathProgramCache]: Analyzing trace with hash -408934709, now seen corresponding path program 1 times [2021-11-06 10:16:50,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:50,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800580066] [2021-11-06 10:16:50,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:50,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:50,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:50,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800580066] [2021-11-06 10:16:50,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800580066] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:50,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:50,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:16:50,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544982935] [2021-11-06 10:16:50,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:16:50,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:50,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:16:50,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:16:50,491 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:57,226 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2021-11-06 10:16:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:16:57,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-06 10:16:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:57,227 INFO L225 Difference]: With dead ends: 134 [2021-11-06 10:16:57,227 INFO L226 Difference]: Without dead ends: 108 [2021-11-06 10:16:57,227 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:16:57,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-06 10:16:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2021-11-06 10:16:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 101 states have (on average 1.0891089108910892) internal successors, (110), 103 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2021-11-06 10:16:57,230 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 38 [2021-11-06 10:16:57,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:57,230 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2021-11-06 10:16:57,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:57,230 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2021-11-06 10:16:57,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 10:16:57,231 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:57,231 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:57,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 10:16:57,231 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:57,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:57,231 INFO L85 PathProgramCache]: Analyzing trace with hash 399724621, now seen corresponding path program 1 times [2021-11-06 10:16:57,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:57,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875022448] [2021-11-06 10:16:57,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:57,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:57,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:57,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875022448] [2021-11-06 10:16:57,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875022448] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:57,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:57,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:16:57,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492574641] [2021-11-06 10:16:57,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:16:57,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:57,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:16:57,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:16:57,569 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:17:02,138 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2021-11-06 10:17:02,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:17:02,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-06 10:17:02,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:17:02,139 INFO L225 Difference]: With dead ends: 136 [2021-11-06 10:17:02,139 INFO L226 Difference]: Without dead ends: 75 [2021-11-06 10:17:02,139 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:17:02,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-06 10:17:02,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-11-06 10:17:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-11-06 10:17:02,142 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 41 [2021-11-06 10:17:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:17:02,142 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-11-06 10:17:02,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-11-06 10:17:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 10:17:02,142 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:17:02,142 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:17:02,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 10:17:02,143 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:17:02,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:17:02,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1444386363, now seen corresponding path program 1 times [2021-11-06 10:17:02,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:17:02,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131774984] [2021-11-06 10:17:02,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:17:02,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:17:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:17:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:17:04,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:17:04,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131774984] [2021-11-06 10:17:04,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131774984] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:17:04,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:17:04,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:17:04,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858335998] [2021-11-06 10:17:04,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:17:04,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:17:04,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:17:04,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:17:04,203 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:09,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:17:09,257 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2021-11-06 10:17:09,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 10:17:09,257 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-06 10:17:09,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:17:09,258 INFO L225 Difference]: With dead ends: 102 [2021-11-06 10:17:09,258 INFO L226 Difference]: Without dead ends: 61 [2021-11-06 10:17:09,258 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:17:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-06 10:17:09,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-11-06 10:17:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 60 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 60 transitions. [2021-11-06 10:17:09,260 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 60 transitions. Word has length 42 [2021-11-06 10:17:09,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:17:09,260 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 60 transitions. [2021-11-06 10:17:09,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 60 transitions. [2021-11-06 10:17:09,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 10:17:09,261 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:17:09,261 INFO L513 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] [2021-11-06 10:17:09,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 10:17:09,261 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:17:09,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:17:09,261 INFO L85 PathProgramCache]: Analyzing trace with hash 832606961, now seen corresponding path program 1 times [2021-11-06 10:17:09,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:17:09,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029445173] [2021-11-06 10:17:09,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:17:09,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:17:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:17:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:17:11,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:17:11,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029445173] [2021-11-06 10:17:11,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029445173] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:17:11,164 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:17:11,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:17:11,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341801640] [2021-11-06 10:17:11,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:17:11,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:17:11,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:17:11,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:17:11,165 INFO L87 Difference]: Start difference. First operand 61 states and 60 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:17:15,950 INFO L93 Difference]: Finished difference Result 61 states and 60 transitions. [2021-11-06 10:17:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:17:15,951 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-06 10:17:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:17:15,951 INFO L225 Difference]: With dead ends: 61 [2021-11-06 10:17:15,951 INFO L226 Difference]: Without dead ends: 59 [2021-11-06 10:17:15,952 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:17:15,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-11-06 10:17:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-11-06 10:17:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.0) internal successors, (58), 58 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 58 transitions. [2021-11-06 10:17:15,958 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 58 transitions. Word has length 53 [2021-11-06 10:17:15,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:17:15,958 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 58 transitions. [2021-11-06 10:17:15,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:15,958 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 58 transitions. [2021-11-06 10:17:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 10:17:15,959 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:17:15,959 INFO L513 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] [2021-11-06 10:17:15,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 10:17:15,959 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:17:15,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:17:15,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2072414125, now seen corresponding path program 1 times [2021-11-06 10:17:15,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:17:15,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047305446] [2021-11-06 10:17:15,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:17:15,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:17:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:17:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:17:18,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:17:18,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047305446] [2021-11-06 10:17:18,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047305446] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:17:18,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:17:18,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:17:18,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917241164] [2021-11-06 10:17:18,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:17:18,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:17:18,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:17:18,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:17:18,700 INFO L87 Difference]: Start difference. First operand 59 states and 58 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:17:23,511 INFO L93 Difference]: Finished difference Result 59 states and 58 transitions. [2021-11-06 10:17:23,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:17:23,511 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-06 10:17:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:17:23,512 INFO L225 Difference]: With dead ends: 59 [2021-11-06 10:17:23,512 INFO L226 Difference]: Without dead ends: 0 [2021-11-06 10:17:23,512 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:17:23,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-06 10:17:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-06 10:17:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-06 10:17:23,512 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2021-11-06 10:17:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:17:23,512 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-06 10:17:23,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-06 10:17:23,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-06 10:17:23,514 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:17:23,515 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:17:23,515 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:17:23,515 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:17:23,515 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:17:23,515 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:17:23,515 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:17:23,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 10:17:23,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-06 10:17:23,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:17:23,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:17:23,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:17:23,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:17:23,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:17:23,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:17:26,247 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,247 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-06 10:17:26,247 INFO L857 garLoopResultBuilder]: For program point L8972(lines 8972 8974) no Hoare annotation was computed. [2021-11-06 10:17:26,247 INFO L857 garLoopResultBuilder]: For program point L8972-2(lines 8972 8974) no Hoare annotation was computed. [2021-11-06 10:17:26,248 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,248 INFO L853 garLoopResultBuilder]: At program point L8231(lines 8218 8232) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 0)) (.cse1 (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967))) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.buffer.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.allocator.offset| 0)) (.cse4 (<= ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity (+ 36028797018963967 (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity 18446744073709551616))))) (.cse5 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 ULTIMATE.start_bounded_malloc_~size)) (.cse6 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity|)) (.cse7 (= ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.len| 0)) (.cse10 (= (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.allocator.base| 0))) (or (and (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.base) .cse0 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.buffer.base|) .cse1 .cse2 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity|) 18446744073709551616)))) .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.offset 0) .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.offset 0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.buffer.base| 0) .cse11))) [2021-11-06 10:17:26,248 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-06 10:17:26,248 INFO L857 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-06 10:17:26,248 INFO L857 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-06 10:17:26,249 INFO L857 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-06 10:17:26,249 INFO L857 garLoopResultBuilder]: For program point L8959(lines 8959 8975) no Hoare annotation was computed. [2021-11-06 10:17:26,249 INFO L857 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-06 10:17:26,249 INFO L857 garLoopResultBuilder]: For program point L222-5(lines 7101 7111) no Hoare annotation was computed. [2021-11-06 10:17:26,249 INFO L857 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-11-06 10:17:26,249 INFO L860 garLoopResultBuilder]: At program point L8976(line 8976) the Hoare annotation is: true [2021-11-06 10:17:26,249 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-06 10:17:26,249 INFO L857 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,249 INFO L857 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,249 INFO L857 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,249 INFO L857 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,249 INFO L857 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,249 INFO L857 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,249 INFO L857 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,249 INFO L857 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point L7377-14(line 7377) no Hoare annotation was computed. [2021-11-06 10:17:26,250 INFO L857 garLoopResultBuilder]: For program point L7377-13(lines 7377 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,251 INFO L853 garLoopResultBuilder]: At program point L7377-12(lines 7375 7381) the Hoare annotation is: (let ((.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.base|)) (.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.offset| 24)) (.cse20 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.base|)) (.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.offset| 0)) (.cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.base| 0))) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse4 (<= ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity (+ 36028797018963967 (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity 18446744073709551616))))) (.cse5 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 ULTIMATE.start_bounded_malloc_~size)) (.cse6 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.base|)) (.cse7 (= (select .cse20 .cse19) 0)) (.cse8 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.base|) (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2.offset| 16)))) (.cse9 (= ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base| 0))) (.cse11 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse12 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse13 (= 0 (select .cse20 .cse18))) (.cse14 (= (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0)) (.cse15 (select .cse17 .cse19)) (.cse16 (= (select .cse17 .cse18) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= .cse15 0) .cse16) (and (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.base) .cse0 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse1 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (<= ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity (+ 36028797018963967 (* 18446744073709551616 (div (+ ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity (- 1)) 18446744073709551616)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.offset 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base .cse15) .cse16 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.offset 0))))) [2021-11-06 10:17:26,251 INFO L857 garLoopResultBuilder]: For program point L7377-19(lines 7377 7378) no Hoare annotation was computed. [2021-11-06 10:17:26,251 INFO L857 garLoopResultBuilder]: For program point L7377-17(lines 7377 7378) no Hoare annotation was computed. [2021-11-06 10:17:26,251 INFO L857 garLoopResultBuilder]: For program point L7377-16(line 7377) no Hoare annotation was computed. [2021-11-06 10:17:26,251 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,251 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-06 10:17:26,252 INFO L857 garLoopResultBuilder]: For program point L7377-22(lines 7377 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,252 INFO L857 garLoopResultBuilder]: For program point L7377-20(lines 7377 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,252 INFO L853 garLoopResultBuilder]: At program point L7377-25(lines 7375 7381) the Hoare annotation is: (let ((.cse19 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse21 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 24)) (.cse23 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base|)) (.cse20 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base|)) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 8)) (.cse22 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.buffer.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.allocator.offset| 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 (select .cse22 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 16)))) (.cse5 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 ULTIMATE.start_bounded_malloc_~size)) (.cse6 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity|)) (.cse7 (= ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base| 0))) (.cse9 (= (select .cse20 .cse24) 0)) (.cse10 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse1 (select .cse23 .cse24)) (.cse11 (= (select .cse23 .cse21) 0)) (.cse12 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.len| 0)) (.cse14 (= (select .cse19 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.allocator.base| 0)) (.cse16 (= (select .cse22 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset|) 0)) (.cse17 (= (select .cse20 .cse21) 0))) (or (and .cse0 (= .cse1 0) .cse2 .cse3 .cse4 (<= ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity (+ 36028797018963967 (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity 18446744073709551616)))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.buffer.base| 0) .cse15 .cse16 .cse17) (and (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.base) .cse0 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.buffer.base|) .cse2 (let ((.cse18 (select .cse19 (+ 16 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)))) (<= .cse18 (+ (* 18446744073709551616 (div (+ (- 1) .cse18) 18446744073709551616)) 36028797018963967))) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity|) 18446744073709551616)))) .cse3 .cse4 .cse5 .cse6 (= ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.offset 0) .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base .cse1) .cse11 .cse12 .cse13 .cse14 (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.offset 0) .cse15 .cse16 .cse17)))) [2021-11-06 10:17:26,252 INFO L857 garLoopResultBuilder]: For program point L7377-24(lines 7377 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,252 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-06 10:17:26,252 INFO L857 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-06 10:17:26,253 INFO L857 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-06 10:17:26,253 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,253 INFO L857 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-06 10:17:26,253 INFO L857 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-06 10:17:26,253 INFO L857 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-06 10:17:26,253 INFO L857 garLoopResultBuilder]: For program point L8222(lines 8222 8223) no Hoare annotation was computed. [2021-11-06 10:17:26,253 INFO L857 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-11-06 10:17:26,254 INFO L857 garLoopResultBuilder]: For program point L8222-2(lines 8222 8223) no Hoare annotation was computed. [2021-11-06 10:17:26,254 INFO L857 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,254 INFO L857 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,254 INFO L857 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,254 INFO L857 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,254 INFO L857 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,254 INFO L857 garLoopResultBuilder]: For program point L7380-9(line 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,254 INFO L857 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,255 INFO L857 garLoopResultBuilder]: For program point L7380-13(line 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,255 INFO L857 garLoopResultBuilder]: For program point L7380-12(line 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,255 INFO L857 garLoopResultBuilder]: For program point L7380-11(line 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,255 INFO L857 garLoopResultBuilder]: For program point L7380-17(line 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,255 INFO L857 garLoopResultBuilder]: For program point L7380-15(line 7380) no Hoare annotation was computed. [2021-11-06 10:17:26,255 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,255 INFO L853 garLoopResultBuilder]: At program point L6886(lines 6882 6887) the Hoare annotation is: (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967)) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 ULTIMATE.start_bounded_malloc_~size)) [2021-11-06 10:17:26,256 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-06 10:17:26,256 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 10:17:26,256 INFO L853 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 8)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base|)) (.cse1 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base|)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base|)) (.cse6 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 24))) (and (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.base) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (<= (div ULTIMATE.start___VERIFIER_assert_~cond 256) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.buffer.base|) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.buffer.offset| 0) (let ((.cse0 (select .cse1 (+ 16 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967))) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity|) 18446744073709551616)))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.allocator.offset| 0) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 (select .cse2 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset| 16))) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 ULTIMATE.start_bounded_malloc_~size) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.capacity|) (= ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.offset 0) (= ULTIMATE.start_assert_bytes_match_~a.offset 0) (= ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.base| 0)) (= (select .cse3 .cse4) 0) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.base (select .cse5 .cse4)) (= (select .cse5 .cse6) 0) (not (= ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes.base 0)) (= ULTIMATE.start_assert_bytes_match_~a.base ULTIMATE.start_assert_bytes_match_~b.base) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.len| 0) (= (select .cse1 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0) (= ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0.offset 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res.allocator.base| 0) (= ULTIMATE.start_assert_bytes_match_~b.offset 0) (= (select .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3.offset|) 0) (= (select .cse3 .cse6) 0))) [2021-11-06 10:17:26,259 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:17:26,260 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 10:17:26,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,273 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,275 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,283 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,283 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,284 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,284 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,284 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,284 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,287 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,287 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,287 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,287 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,288 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,288 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,288 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,288 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,290 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,290 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,294 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,295 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,295 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,295 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,295 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,295 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,295 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,296 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,296 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,296 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,296 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,296 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,296 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,297 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,298 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,298 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,298 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,298 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,298 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,298 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,299 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,299 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,299 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,299 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,299 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,300 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,300 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,300 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,300 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:17:26 BoogieIcfgContainer [2021-11-06 10:17:26,316 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 10:17:26,317 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 10:17:26,317 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 10:17:26,317 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 10:17:26,317 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:52" (3/4) ... [2021-11-06 10:17:26,319 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-06 10:17:26,332 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 121 nodes and edges [2021-11-06 10:17:26,333 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2021-11-06 10:17:26,334 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2021-11-06 10:17:26,334 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-06 10:17:26,335 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-06 10:17:26,336 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-06 10:17:26,336 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-06 10:17:26,337 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-06 10:17:26,372 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((cond == 1 && \result == 0) && !(\result == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && capacity == size [2021-11-06 10:17:26,372 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((buf == 0 && buf == 0) && !(buf == 0)) && buf == buf) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && buf == buf) && #memory_$Pointer$[buf][buf + 8] == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && capacity == capacity) && !(buf == 0)) && \result <= 1) && 1 <= \result) && 0 == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) || ((((((((((((((((((((((array == bytes && buf == 0) && \result == 0) && buf == 0) && !(\result == 0)) && capacity <= 36028797018963967 + 18446744073709551616 * ((capacity + -1) / 18446744073709551616)) && !(buf == 0)) && buf == buf) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && buf == buf) && #memory_$Pointer$[buf][buf + 8] == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && bytes == 0) && capacity == capacity) && !(buf == 0)) && \result <= 1) && 1 <= \result) && 0 == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][buf] == 0) && array == #memory_$Pointer$[buf][buf + 8]) && #memory_$Pointer$[buf][buf + 24] == 0) && array == 0) [2021-11-06 10:17:26,372 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((array == bytes && buf == 0) && \result == 0) && !(\result == 0)) && array == aws_byte_buf_from_empty_array_#res.buffer) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && aws_byte_buf_from_empty_array_#res.buffer == 0) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && capacity == unknown-#res!capacity-unknown) && bytes == 0) && capacity == capacity) && !(buf == 0)) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && array == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) || ((((((((((((buf == 0 && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && aws_byte_buf_from_empty_array_#res.buffer == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && capacity == unknown-#res!capacity-unknown) && capacity == capacity) && !(buf == 0)) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && aws_byte_buf_from_empty_array_#res.buffer == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) [2021-11-06 10:17:26,373 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((buf == 0 && #memory_$Pointer$[buf][buf + 8] == 0) && aws_byte_buf_from_empty_array_#res.buffer == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && capacity == unknown-#res!capacity-unknown) && capacity == capacity) && !(buf == 0)) && #memory_$Pointer$[buf][buf + 8] == 0) && \result <= 1) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && aws_byte_buf_from_empty_array_#res.buffer == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) || ((((((((((((((((((((((((((buf == 0 && array == bytes) && buf == 0) && \result == 0) && !(\result == 0)) && array == aws_byte_buf_from_empty_array_#res.buffer) && aws_byte_buf_from_empty_array_#res.buffer == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 36028797018963967) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && capacity == size) && capacity == unknown-#res!capacity-unknown) && bytes == 0) && capacity == capacity) && !(buf == 0)) && #memory_$Pointer$[buf][buf + 8] == 0) && \result <= 1) && array == #memory_$Pointer$[buf][buf + 8]) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && array == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) [2021-11-06 10:17:26,373 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((buf == 0 && array == bytes) && buf == 0) && \result == 0) && cond / 256 <= 0) && !(\result == 0)) && array == aws_byte_buf_from_empty_array_#res.buffer) && 1 <= cond) && aws_byte_buf_from_empty_array_#res.buffer == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 36028797018963967) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && capacity == size) && capacity == unknown-#res!capacity-unknown) && bytes == 0) && a == 0) && capacity == capacity) && !(buf == 0)) && #memory_$Pointer$[buf][buf + 8] == 0) && array == #memory_$Pointer$[buf][buf + 8]) && #memory_$Pointer$[buf][buf + 24] == 0) && !(bytes == 0)) && a == b) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && array == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && b == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 24] == 0 [2021-11-06 10:17:26,939 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-06 10:17:26,939 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 10:17:26,941 INFO L168 Benchmark]: Toolchain (without parser) took 103237.61 ms. Allocated memory was 96.5 MB in the beginning and 526.4 MB in the end (delta: 429.9 MB). Free memory was 56.0 MB in the beginning and 438.1 MB in the end (delta: -382.0 MB). Peak memory consumption was 356.6 MB. Max. memory is 16.1 GB. [2021-11-06 10:17:26,941 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 96.5 MB. Free memory was 53.7 MB in the beginning and 53.7 MB in the end (delta: 39.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 10:17:26,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1620.41 ms. Allocated memory was 96.5 MB in the beginning and 161.5 MB in the end (delta: 65.0 MB). Free memory was 55.7 MB in the beginning and 105.5 MB in the end (delta: -49.8 MB). Peak memory consumption was 54.2 MB. Max. memory is 16.1 GB. [2021-11-06 10:17:26,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.14 ms. Allocated memory is still 161.5 MB. Free memory was 105.5 MB in the beginning and 93.9 MB in the end (delta: 11.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-06 10:17:26,942 INFO L168 Benchmark]: Boogie Preprocessor took 81.88 ms. Allocated memory is still 161.5 MB. Free memory was 93.9 MB in the beginning and 86.4 MB in the end (delta: 7.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-06 10:17:26,942 INFO L168 Benchmark]: RCFGBuilder took 6728.54 ms. Allocated memory was 161.5 MB in the beginning and 285.2 MB in the end (delta: 123.7 MB). Free memory was 86.4 MB in the beginning and 197.9 MB in the end (delta: -111.5 MB). Peak memory consumption was 156.9 MB. Max. memory is 16.1 GB. [2021-11-06 10:17:26,942 INFO L168 Benchmark]: TraceAbstraction took 94047.89 ms. Allocated memory was 285.2 MB in the beginning and 526.4 MB in the end (delta: 241.2 MB). Free memory was 197.9 MB in the beginning and 321.5 MB in the end (delta: -123.6 MB). Peak memory consumption was 118.6 MB. Max. memory is 16.1 GB. [2021-11-06 10:17:26,942 INFO L168 Benchmark]: Witness Printer took 622.54 ms. Allocated memory is still 526.4 MB. Free memory was 321.5 MB in the beginning and 438.1 MB in the end (delta: -116.5 MB). Peak memory consumption was 192.8 MB. Max. memory is 16.1 GB. [2021-11-06 10:17:26,944 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.17 ms. Allocated memory is still 96.5 MB. Free memory was 53.7 MB in the beginning and 53.7 MB in the end (delta: 39.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1620.41 ms. Allocated memory was 96.5 MB in the beginning and 161.5 MB in the end (delta: 65.0 MB). Free memory was 55.7 MB in the beginning and 105.5 MB in the end (delta: -49.8 MB). Peak memory consumption was 54.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 131.14 ms. Allocated memory is still 161.5 MB. Free memory was 105.5 MB in the beginning and 93.9 MB in the end (delta: 11.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 81.88 ms. Allocated memory is still 161.5 MB. Free memory was 93.9 MB in the beginning and 86.4 MB in the end (delta: 7.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 6728.54 ms. Allocated memory was 161.5 MB in the beginning and 285.2 MB in the end (delta: 123.7 MB). Free memory was 86.4 MB in the beginning and 197.9 MB in the end (delta: -111.5 MB). Peak memory consumption was 156.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 94047.89 ms. Allocated memory was 285.2 MB in the beginning and 526.4 MB in the end (delta: 241.2 MB). Free memory was 197.9 MB in the beginning and 321.5 MB in the end (delta: -123.6 MB). Peak memory consumption was 118.6 MB. Max. memory is 16.1 GB. * Witness Printer took 622.54 ms. Allocated memory is still 526.4 MB. Free memory was 321.5 MB in the beginning and 438.1 MB in the end (delta: -116.5 MB). Peak memory consumption was 192.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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$.offset - 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$.offset - 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$.offset - 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$.offset - 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: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 93.9s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 69.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1772 SDtfs, 2442 SDslu, 4624 SDs, 0 SdLazy, 1848 SolverSat, 139 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 62.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=17, InterpolantAutomatonStates: 173, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 352 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 804 HoareAnnotationTreeSize, 6 FomulaSimplifications, 2748 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 571 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 14.1s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 734 NumberOfCodeBlocks, 734 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 710 ConstructedInterpolants, 0 QuantifiedInterpolants, 5534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 8976]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 266]: Loop Invariant [2021-11-06 10:17:26,949 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,949 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,949 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,950 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,953 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,953 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,954 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,955 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((buf == 0 && array == bytes) && buf == 0) && \result == 0) && cond / 256 <= 0) && !(\result == 0)) && array == aws_byte_buf_from_empty_array_#res.buffer) && 1 <= cond) && aws_byte_buf_from_empty_array_#res.buffer == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 36028797018963967) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && capacity == size) && capacity == unknown-#res!capacity-unknown) && bytes == 0) && a == 0) && capacity == capacity) && !(buf == 0)) && #memory_$Pointer$[buf][buf + 8] == 0) && array == #memory_$Pointer$[buf][buf + 8]) && #memory_$Pointer$[buf][buf + 24] == 0) && !(bytes == 0)) && a == b) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && array == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && b == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 24] == 0 - InvariantResult [Line: 7375]: Loop Invariant [2021-11-06 10:17:26,958 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,958 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,958 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,959 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,961 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((buf == 0 && buf == 0) && !(buf == 0)) && buf == buf) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && buf == buf) && #memory_$Pointer$[buf][buf + 8] == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && capacity == capacity) && !(buf == 0)) && \result <= 1) && 1 <= \result) && 0 == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) || ((((((((((((((((((((((array == bytes && buf == 0) && \result == 0) && buf == 0) && !(\result == 0)) && capacity <= 36028797018963967 + 18446744073709551616 * ((capacity + -1) / 18446744073709551616)) && !(buf == 0)) && buf == buf) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && buf == buf) && #memory_$Pointer$[buf][buf + 8] == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && bytes == 0) && capacity == capacity) && !(buf == 0)) && \result <= 1) && 1 <= \result) && 0 == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][buf] == 0) && array == #memory_$Pointer$[buf][buf + 8]) && #memory_$Pointer$[buf][buf + 24] == 0) && array == 0) - InvariantResult [Line: 8218]: Loop Invariant [2021-11-06 10:17:26,966 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,966 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,966 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,966 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,966 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,966 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,967 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,967 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,967 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,967 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,967 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,967 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,968 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,968 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,968 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,968 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: ((((((((((((((((((array == bytes && buf == 0) && \result == 0) && !(\result == 0)) && array == aws_byte_buf_from_empty_array_#res.buffer) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && aws_byte_buf_from_empty_array_#res.buffer == 0) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && capacity == unknown-#res!capacity-unknown) && bytes == 0) && capacity == capacity) && !(buf == 0)) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && array == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) || ((((((((((((buf == 0 && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && aws_byte_buf_from_empty_array_#res.buffer == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && capacity == unknown-#res!capacity-unknown) && capacity == capacity) && !(buf == 0)) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && aws_byte_buf_from_empty_array_#res.buffer == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (((cond == 1 && \result == 0) && !(\result == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && capacity == size - InvariantResult [Line: 7375]: Loop Invariant [2021-11-06 10:17:26,969 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,969 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,969 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,969 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,970 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,970 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,970 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,970 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,970 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,971 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,971 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,972 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,972 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,973 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,974 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,974 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,974 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,974 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,975 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,975 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,975 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,975 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,975 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,976 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:17:26,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:17:26,976 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:17:26,976 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((buf == 0 && #memory_$Pointer$[buf][buf + 8] == 0) && aws_byte_buf_from_empty_array_#res.buffer == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && capacity <= 36028797018963967 + 18446744073709551616 * (capacity / 18446744073709551616)) && capacity == size) && capacity == unknown-#res!capacity-unknown) && capacity == capacity) && !(buf == 0)) && #memory_$Pointer$[buf][buf + 8] == 0) && \result <= 1) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && aws_byte_buf_from_empty_array_#res.buffer == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) || ((((((((((((((((((((((((((buf == 0 && array == bytes) && buf == 0) && \result == 0) && !(\result == 0)) && array == aws_byte_buf_from_empty_array_#res.buffer) && aws_byte_buf_from_empty_array_#res.buffer == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 36028797018963967) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && aws_byte_buf_from_empty_array_#res.allocator == 0) && capacity == unknown-#memory_int-unknown[buf][buf + 16]) && capacity == size) && capacity == unknown-#res!capacity-unknown) && bytes == 0) && capacity == capacity) && !(buf == 0)) && #memory_$Pointer$[buf][buf + 8] == 0) && \result <= 1) && array == #memory_$Pointer$[buf][buf + 8]) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && unknown-#res!len-unknown == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && array == 0) && aws_byte_buf_from_empty_array_#res.allocator == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) RESULT: Ultimate proved your program to be correct! [2021-11-06 10:17:27,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE