./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 fcb8e130 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-fcb8e13 [2021-11-22 19:32:50,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 19:32:50,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 19:32:50,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 19:32:50,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 19:32:50,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 19:32:50,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 19:32:50,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 19:32:50,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 19:32:50,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 19:32:50,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 19:32:50,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 19:32:50,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 19:32:50,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 19:32:50,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 19:32:50,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 19:32:50,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 19:32:50,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 19:32:50,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 19:32:50,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 19:32:50,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 19:32:50,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 19:32:50,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 19:32:50,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 19:32:50,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 19:32:50,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 19:32:50,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 19:32:50,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 19:32:50,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 19:32:50,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 19:32:50,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 19:32:50,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 19:32:50,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 19:32:50,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 19:32:50,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 19:32:50,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 19:32:50,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 19:32:50,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 19:32:50,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 19:32:50,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 19:32:50,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 19:32:50,989 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 19:32:51,013 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 19:32:51,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 19:32:51,013 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 19:32:51,013 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 19:32:51,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 19:32:51,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 19:32:51,015 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 19:32:51,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 19:32:51,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 19:32:51,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 19:32:51,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 19:32:51,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 19:32:51,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 19:32:51,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 19:32:51,016 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 19:32:51,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 19:32:51,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 19:32:51,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 19:32:51,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 19:32:51,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:32:51,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 19:32:51,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 19:32:51,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 19:32:51,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 19:32:51,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 19:32:51,018 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 19:32:51,018 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 19:32:51,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 19:32:51,018 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 19:32:51,018 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-22 19:32:51,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 19:32:51,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 19:32:51,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 19:32:51,281 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 19:32:51,282 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 19:32:51,283 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-22 19:32:51,321 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d2d765fe/eb1d4f4fe66744c599984ec46cd6f59a/FLAG69221c458 [2021-11-22 19:32:51,836 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 19:32:51,836 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-22 19:32:51,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d2d765fe/eb1d4f4fe66744c599984ec46cd6f59a/FLAG69221c458 [2021-11-22 19:32:52,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d2d765fe/eb1d4f4fe66744c599984ec46cd6f59a [2021-11-22 19:32:52,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 19:32:52,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 19:32:52,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 19:32:52,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 19:32:52,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 19:32:52,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:32:52" (1/1) ... [2021-11-22 19:32:52,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff71878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:52, skipping insertion in model container [2021-11-22 19:32:52,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:32:52" (1/1) ... [2021-11-22 19:32:52,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 19:32:52,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 19:32:52,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2021-11-22 19:32:52,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2021-11-22 19:32:53,142 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,146 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,147 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,148 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,148 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,155 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,160 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,161 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,161 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,356 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:32:53,357 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:32:53,358 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:32:53,358 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:32:53,359 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:32:53,359 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:32:53,360 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:32:53,360 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:32:53,361 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:32:53,361 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:32:53,431 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:32:53,474 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,475 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,506 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:32:53,560 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 19:32:53,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2021-11-22 19:32:53,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2021-11-22 19:32:53,601 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,603 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,603 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,604 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,605 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,610 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,611 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,612 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,612 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,644 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-22 19:32:53,646 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-22 19:32:53,646 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-22 19:32:53,647 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-22 19:32:53,647 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-22 19:32:53,648 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-22 19:32:53,648 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-22 19:32:53,649 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-22 19:32:53,649 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-22 19:32:53,649 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-22 19:32:53,689 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-22 19:32:53,729 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,729 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-22 19:32:53,768 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 19:32:53,898 INFO L208 MainTranslator]: Completed translation [2021-11-22 19:32:53,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:53 WrapperNode [2021-11-22 19:32:53,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 19:32:53,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 19:32:53,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 19:32:53,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 19:32:53,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:53" (1/1) ... [2021-11-22 19:32:54,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:53" (1/1) ... [2021-11-22 19:32:54,105 INFO L137 Inliner]: procedures = 690, calls = 2614, calls flagged for inlining = 946, calls inlined = 19, statements flattened = 934 [2021-11-22 19:32:54,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 19:32:54,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 19:32:54,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 19:32:54,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 19:32:54,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:53" (1/1) ... [2021-11-22 19:32:54,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:53" (1/1) ... [2021-11-22 19:32:54,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:53" (1/1) ... [2021-11-22 19:32:54,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:53" (1/1) ... [2021-11-22 19:32:54,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:53" (1/1) ... [2021-11-22 19:32:54,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:53" (1/1) ... [2021-11-22 19:32:54,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:53" (1/1) ... [2021-11-22 19:32:54,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 19:32:54,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 19:32:54,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 19:32:54,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 19:32:54,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:53" (1/1) ... [2021-11-22 19:32:54,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 19:32:54,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 19:32:54,207 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-22 19:32:54,212 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-22 19:32:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 19:32:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 19:32:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 19:32:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 19:32:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 19:32:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 19:32:54,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 19:32:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 19:32:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 19:32:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 19:32:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 19:32:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 19:32:54,411 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 19:32:54,412 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 19:32:55,210 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 19:32:55,215 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 19:32:55,215 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-22 19:32:55,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:32:55 BoogieIcfgContainer [2021-11-22 19:32:55,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 19:32:55,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 19:32:55,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 19:32:55,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 19:32:55,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:32:52" (1/3) ... [2021-11-22 19:32:55,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8be2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:32:55, skipping insertion in model container [2021-11-22 19:32:55,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:32:53" (2/3) ... [2021-11-22 19:32:55,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8be2c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:32:55, skipping insertion in model container [2021-11-22 19:32:55,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:32:55" (3/3) ... [2021-11-22 19:32:55,222 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_empty_array_harness.i [2021-11-22 19:32:55,226 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 19:32:55,226 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-11-22 19:32:55,255 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 19:32:55,259 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-22 19:32:55,259 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-22 19:32:55,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 78 states have internal predecessors, (105), 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-22 19:32:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 19:32:55,272 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:55,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:55,273 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-22 19:32:55,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:55,276 INFO L85 PathProgramCache]: Analyzing trace with hash 810375617, now seen corresponding path program 1 times [2021-11-22 19:32:55,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:55,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049240006] [2021-11-22 19:32:55,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:55,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:55,613 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-22 19:32:55,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:55,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049240006] [2021-11-22 19:32:55,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049240006] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:55,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:55,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 19:32:55,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173207892] [2021-11-22 19:32:55,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:55,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 19:32:55,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:55,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 19:32:55,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 19:32:55,643 INFO L87 Difference]: Start difference. First operand has 79 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 78 states have internal predecessors, (105), 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-22 19:32:55,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:55,661 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2021-11-22 19:32:55,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 19:32:55,663 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-22 19:32:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:55,669 INFO L225 Difference]: With dead ends: 155 [2021-11-22 19:32:55,669 INFO L226 Difference]: Without dead ends: 72 [2021-11-22 19:32:55,671 INFO L932 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-22 19:32:55,676 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:55,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:32:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-22 19:32:55,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-11-22 19:32:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.323076923076923) internal successors, (86), 71 states have internal predecessors, (86), 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-22 19:32:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2021-11-22 19:32:55,705 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 14 [2021-11-22 19:32:55,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:55,706 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2021-11-22 19:32:55,708 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-22 19:32:55,708 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2021-11-22 19:32:55,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 19:32:55,709 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:55,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:55,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 19:32:55,710 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-22 19:32:55,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:55,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1068541055, now seen corresponding path program 1 times [2021-11-22 19:32:55,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:55,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929058176] [2021-11-22 19:32:55,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:55,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:55,984 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-22 19:32:55,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:55,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929058176] [2021-11-22 19:32:55,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929058176] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:55,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:55,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:32:55,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026960399] [2021-11-22 19:32:55,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:55,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:32:55,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:55,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:32:55,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:32:55,988 INFO L87 Difference]: Start difference. First operand 72 states and 86 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-22 19:32:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:56,028 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2021-11-22 19:32:56,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:32:56,029 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-22 19:32:56,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:56,029 INFO L225 Difference]: With dead ends: 122 [2021-11-22 19:32:56,030 INFO L226 Difference]: Without dead ends: 72 [2021-11-22 19:32:56,030 INFO L932 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-22 19:32:56,031 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 61 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:56,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 178 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:32:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-22 19:32:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-11-22 19:32:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 71 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-22 19:32:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2021-11-22 19:32:56,035 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 14 [2021-11-22 19:32:56,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:56,036 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2021-11-22 19:32:56,036 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-22 19:32:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2021-11-22 19:32:56,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-22 19:32:56,036 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:56,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:56,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 19:32:56,037 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-22 19:32:56,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:56,037 INFO L85 PathProgramCache]: Analyzing trace with hash -715146382, now seen corresponding path program 1 times [2021-11-22 19:32:56,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:56,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937975093] [2021-11-22 19:32:56,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:56,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:56,128 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-22 19:32:56,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:56,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937975093] [2021-11-22 19:32:56,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937975093] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:56,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:56,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:32:56,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416111331] [2021-11-22 19:32:56,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:56,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:32:56,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:56,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:32:56,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:32:56,130 INFO L87 Difference]: Start difference. First operand 72 states and 85 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-22 19:32:56,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:56,173 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2021-11-22 19:32:56,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:32:56,173 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-22 19:32:56,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:56,174 INFO L225 Difference]: With dead ends: 175 [2021-11-22 19:32:56,174 INFO L226 Difference]: Without dead ends: 116 [2021-11-22 19:32:56,175 INFO L932 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-22 19:32:56,175 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 70 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:56,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 278 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:32:56,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-22 19:32:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 76. [2021-11-22 19:32:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.289855072463768) internal successors, (89), 75 states have internal predecessors, (89), 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-22 19:32:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2021-11-22 19:32:56,180 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 20 [2021-11-22 19:32:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:56,181 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2021-11-22 19:32:56,181 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-22 19:32:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2021-11-22 19:32:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-22 19:32:56,181 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:56,182 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:56,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 19:32:56,182 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-22 19:32:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:56,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1524493008, now seen corresponding path program 1 times [2021-11-22 19:32:56,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:56,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815636832] [2021-11-22 19:32:56,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:56,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:56,287 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-22 19:32:56,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:56,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815636832] [2021-11-22 19:32:56,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815636832] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:56,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:56,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:32:56,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658738287] [2021-11-22 19:32:56,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:56,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:32:56,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:56,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:32:56,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:32:56,289 INFO L87 Difference]: Start difference. First operand 76 states and 89 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-22 19:32:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:56,333 INFO L93 Difference]: Finished difference Result 149 states and 176 transitions. [2021-11-22 19:32:56,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:32:56,333 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-22 19:32:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:56,334 INFO L225 Difference]: With dead ends: 149 [2021-11-22 19:32:56,334 INFO L226 Difference]: Without dead ends: 96 [2021-11-22 19:32:56,335 INFO L932 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-22 19:32:56,335 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 49 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:56,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 224 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:32:56,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-11-22 19:32:56,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 80. [2021-11-22 19:32:56,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.273972602739726) internal successors, (93), 79 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:32:56,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2021-11-22 19:32:56,339 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 20 [2021-11-22 19:32:56,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:56,340 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2021-11-22 19:32:56,340 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-22 19:32:56,340 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2021-11-22 19:32:56,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-22 19:32:56,340 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:56,341 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:56,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 19:32:56,341 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-22 19:32:56,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:56,341 INFO L85 PathProgramCache]: Analyzing trace with hash -322119372, now seen corresponding path program 1 times [2021-11-22 19:32:56,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:56,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050151259] [2021-11-22 19:32:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:56,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:56,480 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-22 19:32:56,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:56,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050151259] [2021-11-22 19:32:56,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050151259] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:56,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:56,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:32:56,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249613832] [2021-11-22 19:32:56,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:56,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:32:56,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:56,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:32:56,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:32:56,482 INFO L87 Difference]: Start difference. First operand 80 states and 93 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-22 19:32:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:56,597 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2021-11-22 19:32:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:32:56,598 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-22 19:32:56,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:56,598 INFO L225 Difference]: With dead ends: 141 [2021-11-22 19:32:56,599 INFO L226 Difference]: Without dead ends: 137 [2021-11-22 19:32:56,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:32:56,599 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 105 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:56,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 410 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:56,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-11-22 19:32:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 88. [2021-11-22 19:32:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 87 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:32:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2021-11-22 19:32:56,603 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 20 [2021-11-22 19:32:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:56,604 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2021-11-22 19:32:56,604 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-22 19:32:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2021-11-22 19:32:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 19:32:56,605 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:56,605 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:56,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 19:32:56,605 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-22 19:32:56,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:56,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2144800216, now seen corresponding path program 1 times [2021-11-22 19:32:56,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:56,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614242167] [2021-11-22 19:32:56,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:56,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:56,748 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-22 19:32:56,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:56,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614242167] [2021-11-22 19:32:56,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614242167] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:56,749 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:56,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:32:56,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256252954] [2021-11-22 19:32:56,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:56,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:32:56,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:56,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:32:56,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:32:56,750 INFO L87 Difference]: Start difference. First operand 88 states and 101 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-22 19:32:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:56,839 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2021-11-22 19:32:56,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:32:56,840 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-22 19:32:56,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:56,840 INFO L225 Difference]: With dead ends: 155 [2021-11-22 19:32:56,840 INFO L226 Difference]: Without dead ends: 95 [2021-11-22 19:32:56,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:32:56,841 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 38 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:56,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 254 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:56,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-22 19:32:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2021-11-22 19:32:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 89 states have internal predecessors, (103), 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-22 19:32:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2021-11-22 19:32:56,845 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 24 [2021-11-22 19:32:56,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:56,845 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2021-11-22 19:32:56,845 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-22 19:32:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2021-11-22 19:32:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 19:32:56,845 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:56,845 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:56,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 19:32:56,846 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-22 19:32:56,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:56,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1464741846, now seen corresponding path program 1 times [2021-11-22 19:32:56,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:56,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134667388] [2021-11-22 19:32:56,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:56,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:56,997 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-22 19:32:56,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:56,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134667388] [2021-11-22 19:32:56,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134667388] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:56,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:56,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:32:56,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658413309] [2021-11-22 19:32:56,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:56,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:32:56,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:56,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:32:56,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:32:56,999 INFO L87 Difference]: Start difference. First operand 90 states and 103 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-22 19:32:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:57,122 INFO L93 Difference]: Finished difference Result 209 states and 234 transitions. [2021-11-22 19:32:57,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:32:57,122 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-22 19:32:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:57,123 INFO L225 Difference]: With dead ends: 209 [2021-11-22 19:32:57,123 INFO L226 Difference]: Without dead ends: 145 [2021-11-22 19:32:57,123 INFO L932 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-22 19:32:57,123 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 59 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:57,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 345 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-11-22 19:32:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2021-11-22 19:32:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 95 states have internal predecessors, (109), 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-22 19:32:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2021-11-22 19:32:57,126 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 24 [2021-11-22 19:32:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:57,127 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2021-11-22 19:32:57,127 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-22 19:32:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2021-11-22 19:32:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 19:32:57,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:57,127 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:57,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 19:32:57,130 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-22 19:32:57,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:57,131 INFO L85 PathProgramCache]: Analyzing trace with hash -711790034, now seen corresponding path program 1 times [2021-11-22 19:32:57,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:57,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280269153] [2021-11-22 19:32:57,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:57,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:57,457 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-22 19:32:57,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:57,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280269153] [2021-11-22 19:32:57,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280269153] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:57,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:57,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:32:57,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858077497] [2021-11-22 19:32:57,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:57,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:32:57,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:57,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:32:57,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:32:57,459 INFO L87 Difference]: Start difference. First operand 96 states and 109 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-22 19:32:57,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:57,698 INFO L93 Difference]: Finished difference Result 197 states and 223 transitions. [2021-11-22 19:32:57,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 19:32:57,698 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-22 19:32:57,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:57,699 INFO L225 Difference]: With dead ends: 197 [2021-11-22 19:32:57,699 INFO L226 Difference]: Without dead ends: 117 [2021-11-22 19:32:57,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-11-22 19:32:57,700 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 278 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:57,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 342 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:57,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-22 19:32:57,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2021-11-22 19:32:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.2173913043478262) internal successors, (112), 98 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-22 19:32:57,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2021-11-22 19:32:57,704 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 24 [2021-11-22 19:32:57,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:57,704 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2021-11-22 19:32:57,704 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-22 19:32:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2021-11-22 19:32:57,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 19:32:57,705 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:57,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:57,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 19:32:57,706 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-22 19:32:57,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:57,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1994829360, now seen corresponding path program 1 times [2021-11-22 19:32:57,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:57,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761663569] [2021-11-22 19:32:57,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:57,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:57,903 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-22 19:32:57,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:57,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761663569] [2021-11-22 19:32:57,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761663569] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:57,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:57,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:32:57,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712766803] [2021-11-22 19:32:57,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:57,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:32:57,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:57,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:32:57,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:32:57,905 INFO L87 Difference]: Start difference. First operand 99 states and 112 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-22 19:32:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:58,083 INFO L93 Difference]: Finished difference Result 187 states and 210 transitions. [2021-11-22 19:32:58,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:32:58,083 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-22 19:32:58,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:58,084 INFO L225 Difference]: With dead ends: 187 [2021-11-22 19:32:58,084 INFO L226 Difference]: Without dead ends: 117 [2021-11-22 19:32:58,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:32:58,084 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 64 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:58,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 354 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-22 19:32:58,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2021-11-22 19:32:58,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.2065217391304348) internal successors, (111), 98 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-22 19:32:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-11-22 19:32:58,087 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 24 [2021-11-22 19:32:58,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:58,088 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-11-22 19:32:58,088 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-22 19:32:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-11-22 19:32:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 19:32:58,088 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:58,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:58,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 19:32:58,088 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-22 19:32:58,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:58,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2041972498, now seen corresponding path program 1 times [2021-11-22 19:32:58,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:58,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130618753] [2021-11-22 19:32:58,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:58,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:58,197 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-22 19:32:58,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:58,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130618753] [2021-11-22 19:32:58,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130618753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:58,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:58,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 19:32:58,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207240830] [2021-11-22 19:32:58,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:58,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 19:32:58,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:58,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 19:32:58,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 19:32:58,200 INFO L87 Difference]: Start difference. First operand 99 states and 111 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-22 19:32:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:58,283 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2021-11-22 19:32:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:32:58,284 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-22 19:32:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:58,284 INFO L225 Difference]: With dead ends: 166 [2021-11-22 19:32:58,284 INFO L226 Difference]: Without dead ends: 94 [2021-11-22 19:32:58,285 INFO L932 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-22 19:32:58,285 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 27 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:58,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 250 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:58,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-22 19:32:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-11-22 19:32:58,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 93 states have internal predecessors, (103), 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-22 19:32:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2021-11-22 19:32:58,287 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 24 [2021-11-22 19:32:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:58,288 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-11-22 19:32:58,288 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-22 19:32:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2021-11-22 19:32:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 19:32:58,288 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:58,288 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:58,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 19:32:58,288 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-22 19:32:58,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:58,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1548380899, now seen corresponding path program 1 times [2021-11-22 19:32:58,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:58,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819292325] [2021-11-22 19:32:58,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:58,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:58,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-22 19:32:58,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:58,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819292325] [2021-11-22 19:32:58,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819292325] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:58,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:58,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:32:58,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518743830] [2021-11-22 19:32:58,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:58,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:32:58,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:58,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:32:58,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:32:58,431 INFO L87 Difference]: Start difference. First operand 94 states and 103 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-22 19:32:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:58,628 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2021-11-22 19:32:58,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-22 19:32:58,629 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-22 19:32:58,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:58,629 INFO L225 Difference]: With dead ends: 167 [2021-11-22 19:32:58,629 INFO L226 Difference]: Without dead ends: 163 [2021-11-22 19:32:58,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-11-22 19:32:58,630 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 116 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:58,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 568 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:58,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-11-22 19:32:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 98. [2021-11-22 19:32:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 97 states have internal predecessors, (107), 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-22 19:32:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2021-11-22 19:32:58,633 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 26 [2021-11-22 19:32:58,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:58,633 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2021-11-22 19:32:58,633 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-22 19:32:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2021-11-22 19:32:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 19:32:58,634 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:58,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:58,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 19:32:58,634 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-22 19:32:58,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:58,634 INFO L85 PathProgramCache]: Analyzing trace with hash 739034273, now seen corresponding path program 1 times [2021-11-22 19:32:58,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:58,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541255804] [2021-11-22 19:32:58,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:58,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:58,730 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-22 19:32:58,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:58,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541255804] [2021-11-22 19:32:58,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541255804] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:58,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:58,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:32:58,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999194566] [2021-11-22 19:32:58,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:58,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:32:58,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:58,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:32:58,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:32:58,732 INFO L87 Difference]: Start difference. First operand 98 states and 107 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-22 19:32:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:58,794 INFO L93 Difference]: Finished difference Result 160 states and 175 transitions. [2021-11-22 19:32:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 19:32:58,795 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-22 19:32:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:58,795 INFO L225 Difference]: With dead ends: 160 [2021-11-22 19:32:58,795 INFO L226 Difference]: Without dead ends: 94 [2021-11-22 19:32:58,795 INFO L932 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-22 19:32:58,796 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 19 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:58,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 185 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:58,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-22 19:32:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2021-11-22 19:32:58,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 89 states have internal predecessors, (98), 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-22 19:32:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2021-11-22 19:32:58,798 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 26 [2021-11-22 19:32:58,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:58,798 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2021-11-22 19:32:58,798 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-22 19:32:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2021-11-22 19:32:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 19:32:58,799 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:58,799 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:58,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 19:32:58,799 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-22 19:32:58,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:58,799 INFO L85 PathProgramCache]: Analyzing trace with hash -365390039, now seen corresponding path program 1 times [2021-11-22 19:32:58,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:58,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336952908] [2021-11-22 19:32:58,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:58,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:58,899 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-22 19:32:58,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:58,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336952908] [2021-11-22 19:32:58,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336952908] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:58,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:58,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 19:32:58,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964809182] [2021-11-22 19:32:58,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:58,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 19:32:58,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:58,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 19:32:58,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 19:32:58,901 INFO L87 Difference]: Start difference. First operand 90 states and 98 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-22 19:32:58,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:58,925 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2021-11-22 19:32:58,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 19:32:58,925 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-22 19:32:58,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:58,926 INFO L225 Difference]: With dead ends: 120 [2021-11-22 19:32:58,926 INFO L226 Difference]: Without dead ends: 90 [2021-11-22 19:32:58,926 INFO L932 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-22 19:32:58,926 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 91 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:58,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 110 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 19:32:58,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-11-22 19:32:58,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-11-22 19:32:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 89 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-22 19:32:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2021-11-22 19:32:58,935 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 26 [2021-11-22 19:32:58,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:58,935 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2021-11-22 19:32:58,935 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-22 19:32:58,935 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2021-11-22 19:32:58,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-22 19:32:58,936 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:58,936 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:58,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 19:32:58,936 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-22 19:32:58,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:58,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1400671456, now seen corresponding path program 1 times [2021-11-22 19:32:58,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:58,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516973049] [2021-11-22 19:32:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:58,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:59,073 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-22 19:32:59,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:59,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516973049] [2021-11-22 19:32:59,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516973049] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:59,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:59,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:32:59,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312943995] [2021-11-22 19:32:59,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:59,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:32:59,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:59,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:32:59,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:32:59,076 INFO L87 Difference]: Start difference. First operand 90 states and 97 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-22 19:32:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:59,172 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2021-11-22 19:32:59,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:32:59,173 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-22 19:32:59,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:59,173 INFO L225 Difference]: With dead ends: 90 [2021-11-22 19:32:59,173 INFO L226 Difference]: Without dead ends: 88 [2021-11-22 19:32:59,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:32:59,174 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 110 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:59,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 183 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:59,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-11-22 19:32:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-11-22 19:32:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.144578313253012) internal successors, (95), 87 states have internal predecessors, (95), 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-22 19:32:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2021-11-22 19:32:59,176 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 34 [2021-11-22 19:32:59,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:59,176 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2021-11-22 19:32:59,176 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-22 19:32:59,176 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2021-11-22 19:32:59,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 19:32:59,177 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:59,177 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:59,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-22 19:32:59,177 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-22 19:32:59,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:59,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1720376510, now seen corresponding path program 1 times [2021-11-22 19:32:59,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:59,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885588887] [2021-11-22 19:32:59,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:59,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:59,421 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-22 19:32:59,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:59,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885588887] [2021-11-22 19:32:59,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885588887] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:59,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:59,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:32:59,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445987282] [2021-11-22 19:32:59,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:59,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:32:59,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:59,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:32:59,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:32:59,423 INFO L87 Difference]: Start difference. First operand 88 states and 95 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-22 19:32:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:59,687 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2021-11-22 19:32:59,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:32:59,688 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-22 19:32:59,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:59,688 INFO L225 Difference]: With dead ends: 158 [2021-11-22 19:32:59,688 INFO L226 Difference]: Without dead ends: 156 [2021-11-22 19:32:59,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:32:59,689 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 389 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:59,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 367 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:32:59,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-11-22 19:32:59,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2021-11-22 19:32:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.143939393939394) internal successors, (151), 136 states have internal predecessors, (151), 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-22 19:32:59,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2021-11-22 19:32:59,692 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 36 [2021-11-22 19:32:59,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:59,693 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2021-11-22 19:32:59,693 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-22 19:32:59,693 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2021-11-22 19:32:59,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 19:32:59,693 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:59,693 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:59,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 19:32:59,693 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-22 19:32:59,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:59,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1549467370, now seen corresponding path program 1 times [2021-11-22 19:32:59,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:59,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313438132] [2021-11-22 19:32:59,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:59,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:32:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:32:59,827 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-22 19:32:59,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:32:59,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313438132] [2021-11-22 19:32:59,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313438132] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:32:59,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:32:59,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:32:59,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028972314] [2021-11-22 19:32:59,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:32:59,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:32:59,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:32:59,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:32:59,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:32:59,829 INFO L87 Difference]: Start difference. First operand 137 states and 151 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-22 19:32:59,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:32:59,953 INFO L93 Difference]: Finished difference Result 200 states and 218 transitions. [2021-11-22 19:32:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:32:59,954 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-22 19:32:59,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:32:59,954 INFO L225 Difference]: With dead ends: 200 [2021-11-22 19:32:59,954 INFO L226 Difference]: Without dead ends: 161 [2021-11-22 19:32:59,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-11-22 19:32:59,955 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 163 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:32:59,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 236 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:32:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-22 19:32:59,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 141. [2021-11-22 19:32:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.1397058823529411) internal successors, (155), 140 states have internal predecessors, (155), 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-22 19:32:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2021-11-22 19:32:59,959 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 36 [2021-11-22 19:32:59,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:32:59,959 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2021-11-22 19:32:59,959 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-22 19:32:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2021-11-22 19:32:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 19:32:59,960 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:32:59,960 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:32:59,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 19:32:59,960 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-22 19:32:59,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:32:59,960 INFO L85 PathProgramCache]: Analyzing trace with hash -869409000, now seen corresponding path program 1 times [2021-11-22 19:32:59,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:32:59,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888470313] [2021-11-22 19:32:59,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:32:59,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:00,150 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-22 19:33:00,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:00,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888470313] [2021-11-22 19:33:00,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888470313] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:00,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:00,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:33:00,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725462737] [2021-11-22 19:33:00,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:00,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:33:00,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:00,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:33:00,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:33:00,152 INFO L87 Difference]: Start difference. First operand 141 states and 155 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-22 19:33:00,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:00,366 INFO L93 Difference]: Finished difference Result 203 states and 217 transitions. [2021-11-22 19:33:00,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:33:00,366 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-22 19:33:00,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:00,367 INFO L225 Difference]: With dead ends: 203 [2021-11-22 19:33:00,367 INFO L226 Difference]: Without dead ends: 162 [2021-11-22 19:33:00,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-11-22 19:33:00,368 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 180 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:00,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 439 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:33:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-11-22 19:33:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 141. [2021-11-22 19:33:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.1323529411764706) internal successors, (154), 140 states have internal predecessors, (154), 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-22 19:33:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2021-11-22 19:33:00,371 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 36 [2021-11-22 19:33:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:00,371 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2021-11-22 19:33:00,372 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-22 19:33:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2021-11-22 19:33:00,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 19:33:00,372 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:00,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:00,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 19:33:00,372 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-22 19:33:00,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:00,372 INFO L85 PathProgramCache]: Analyzing trace with hash -611243562, now seen corresponding path program 1 times [2021-11-22 19:33:00,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:00,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287345248] [2021-11-22 19:33:00,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:00,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:00,582 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-22 19:33:00,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:00,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287345248] [2021-11-22 19:33:00,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287345248] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:00,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:00,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:33:00,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174710838] [2021-11-22 19:33:00,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:00,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:33:00,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:00,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:33:00,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:33:00,584 INFO L87 Difference]: Start difference. First operand 141 states and 154 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-22 19:33:00,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:00,717 INFO L93 Difference]: Finished difference Result 218 states and 236 transitions. [2021-11-22 19:33:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:33:00,718 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-22 19:33:00,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:00,718 INFO L225 Difference]: With dead ends: 218 [2021-11-22 19:33:00,718 INFO L226 Difference]: Without dead ends: 149 [2021-11-22 19:33:00,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:33:00,719 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 147 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:00,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 241 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:00,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-11-22 19:33:00,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 134. [2021-11-22 19:33:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.1085271317829457) internal successors, (143), 133 states have internal predecessors, (143), 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-22 19:33:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2021-11-22 19:33:00,723 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 36 [2021-11-22 19:33:00,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:00,723 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2021-11-22 19:33:00,723 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-22 19:33:00,723 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2021-11-22 19:33:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-22 19:33:00,724 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:00,724 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:00,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 19:33:00,724 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-22 19:33:00,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash 280712196, now seen corresponding path program 1 times [2021-11-22 19:33:00,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:00,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250718265] [2021-11-22 19:33:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:00,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:00,848 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-22 19:33:00,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:00,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250718265] [2021-11-22 19:33:00,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250718265] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:00,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:00,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 19:33:00,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673772692] [2021-11-22 19:33:00,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:00,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 19:33:00,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:00,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 19:33:00,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 19:33:00,850 INFO L87 Difference]: Start difference. First operand 134 states and 143 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-22 19:33:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:00,940 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2021-11-22 19:33:00,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:33:00,940 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-22 19:33:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:00,941 INFO L225 Difference]: With dead ends: 134 [2021-11-22 19:33:00,941 INFO L226 Difference]: Without dead ends: 132 [2021-11-22 19:33:00,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:33:00,941 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 84 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:00,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 209 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:00,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-11-22 19:33:00,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-11-22 19:33:00,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 128 states have (on average 1.1015625) internal successors, (141), 131 states have internal predecessors, (141), 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-22 19:33:00,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2021-11-22 19:33:00,946 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 38 [2021-11-22 19:33:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:00,946 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2021-11-22 19:33:00,946 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-22 19:33:00,946 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2021-11-22 19:33:00,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-22 19:33:00,946 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:00,946 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:00,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 19:33:00,947 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-22 19:33:00,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:00,947 INFO L85 PathProgramCache]: Analyzing trace with hash -408934709, now seen corresponding path program 1 times [2021-11-22 19:33:00,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:00,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661407509] [2021-11-22 19:33:00,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:00,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:01,081 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-22 19:33:01,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:01,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661407509] [2021-11-22 19:33:01,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661407509] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:01,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:01,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:33:01,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052927435] [2021-11-22 19:33:01,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:01,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:33:01,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:01,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:33:01,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:33:01,083 INFO L87 Difference]: Start difference. First operand 132 states and 141 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-22 19:33:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:01,177 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2021-11-22 19:33:01,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 19:33:01,178 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-22 19:33:01,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:01,178 INFO L225 Difference]: With dead ends: 170 [2021-11-22 19:33:01,178 INFO L226 Difference]: Without dead ends: 131 [2021-11-22 19:33:01,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:33:01,179 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 110 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:01,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 216 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-11-22 19:33:01,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2021-11-22 19:33:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 121 states have (on average 1.0826446280991735) internal successors, (131), 124 states have internal predecessors, (131), 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-22 19:33:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2021-11-22 19:33:01,182 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 38 [2021-11-22 19:33:01,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:01,182 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2021-11-22 19:33:01,183 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-22 19:33:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2021-11-22 19:33:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-22 19:33:01,183 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:01,183 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:01,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 19:33:01,183 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-22 19:33:01,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:01,183 INFO L85 PathProgramCache]: Analyzing trace with hash 399724621, now seen corresponding path program 1 times [2021-11-22 19:33:01,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:01,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912271740] [2021-11-22 19:33:01,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:01,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:01,299 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-22 19:33:01,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:01,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912271740] [2021-11-22 19:33:01,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912271740] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:01,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:01,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 19:33:01,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119506276] [2021-11-22 19:33:01,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:01,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 19:33:01,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:01,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 19:33:01,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 19:33:01,301 INFO L87 Difference]: Start difference. First operand 125 states and 131 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-22 19:33:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:01,405 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2021-11-22 19:33:01,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 19:33:01,405 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-22 19:33:01,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:01,406 INFO L225 Difference]: With dead ends: 140 [2021-11-22 19:33:01,406 INFO L226 Difference]: Without dead ends: 78 [2021-11-22 19:33:01,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:33:01,407 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 46 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:01,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 442 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:01,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-22 19:33:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-11-22 19:33:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 77 states have internal predecessors, (81), 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-22 19:33:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2021-11-22 19:33:01,409 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 41 [2021-11-22 19:33:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:01,410 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2021-11-22 19:33:01,410 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-22 19:33:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2021-11-22 19:33:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 19:33:01,410 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:01,410 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:01,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-22 19:33:01,410 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:33:01,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:01,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1999613423, now seen corresponding path program 1 times [2021-11-22 19:33:01,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:01,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799569043] [2021-11-22 19:33:01,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:01,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:01,729 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-22 19:33:01,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:01,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799569043] [2021-11-22 19:33:01,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799569043] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:01,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:01,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 19:33:01,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445884630] [2021-11-22 19:33:01,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:01,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 19:33:01,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:01,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 19:33:01,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-22 19:33:01,731 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 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-22 19:33:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:02,009 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2021-11-22 19:33:02,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 19:33:02,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 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-22 19:33:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:02,011 INFO L225 Difference]: With dead ends: 78 [2021-11-22 19:33:02,011 INFO L226 Difference]: Without dead ends: 76 [2021-11-22 19:33:02,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-11-22 19:33:02,012 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 191 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:02,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 147 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:33:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-11-22 19:33:02,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-11-22 19:33:02,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 73 states have (on average 1.082191780821918) internal successors, (79), 75 states have internal predecessors, (79), 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-22 19:33:02,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2021-11-22 19:33:02,015 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 42 [2021-11-22 19:33:02,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:02,015 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2021-11-22 19:33:02,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 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-22 19:33:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2021-11-22 19:33:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-22 19:33:02,015 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:02,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:02,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-22 19:33:02,016 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:33:02,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:02,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1444386363, now seen corresponding path program 1 times [2021-11-22 19:33:02,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:02,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214098803] [2021-11-22 19:33:02,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:02,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:02,351 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-22 19:33:02,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:02,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214098803] [2021-11-22 19:33:02,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214098803] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:02,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:02,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-22 19:33:02,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814219690] [2021-11-22 19:33:02,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:02,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-22 19:33:02,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:02,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 19:33:02,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-22 19:33:02,353 INFO L87 Difference]: Start difference. First operand 76 states and 79 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-22 19:33:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:02,633 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2021-11-22 19:33:02,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 19:33:02,634 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-22 19:33:02,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:02,634 INFO L225 Difference]: With dead ends: 104 [2021-11-22 19:33:02,634 INFO L226 Difference]: Without dead ends: 62 [2021-11-22 19:33:02,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-11-22 19:33:02,636 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 247 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:02,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 157 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 19:33:02,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-22 19:33:02,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-11-22 19:33:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 61 states have internal predecessors, (61), 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-22 19:33:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 61 transitions. [2021-11-22 19:33:02,639 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 61 transitions. Word has length 42 [2021-11-22 19:33:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:02,639 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 61 transitions. [2021-11-22 19:33:02,639 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-22 19:33:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 61 transitions. [2021-11-22 19:33:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-22 19:33:02,639 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:02,639 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:02,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-22 19:33:02,640 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:33:02,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:02,640 INFO L85 PathProgramCache]: Analyzing trace with hash 832606961, now seen corresponding path program 1 times [2021-11-22 19:33:02,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:02,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7439380] [2021-11-22 19:33:02,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:02,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:02,876 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-22 19:33:02,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:02,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7439380] [2021-11-22 19:33:02,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7439380] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:02,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:02,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-22 19:33:02,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370618400] [2021-11-22 19:33:02,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:02,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-22 19:33:02,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:02,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-22 19:33:02,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-22 19:33:02,878 INFO L87 Difference]: Start difference. First operand 62 states and 61 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-22 19:33:03,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:03,014 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2021-11-22 19:33:03,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:33:03,015 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-22 19:33:03,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:03,015 INFO L225 Difference]: With dead ends: 62 [2021-11-22 19:33:03,015 INFO L226 Difference]: Without dead ends: 60 [2021-11-22 19:33:03,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-11-22 19:33:03,016 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 150 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:03,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 205 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:03,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-22 19:33:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-11-22 19:33:03,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0) internal successors, (59), 59 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 59 transitions. [2021-11-22 19:33:03,019 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 59 transitions. Word has length 53 [2021-11-22 19:33:03,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:03,019 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 59 transitions. [2021-11-22 19:33:03,019 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-22 19:33:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 59 transitions. [2021-11-22 19:33:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-22 19:33:03,019 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 19:33:03,019 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:03,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-22 19:33:03,020 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-22 19:33:03,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 19:33:03,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1987033673, now seen corresponding path program 1 times [2021-11-22 19:33:03,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 19:33:03,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101764585] [2021-11-22 19:33:03,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 19:33:03,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 19:33:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 19:33:03,506 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-22 19:33:03,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 19:33:03,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101764585] [2021-11-22 19:33:03,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101764585] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 19:33:03,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 19:33:03,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-22 19:33:03,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639726988] [2021-11-22 19:33:03,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 19:33:03,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 19:33:03,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 19:33:03,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 19:33:03,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-22 19:33:03,508 INFO L87 Difference]: Start difference. First operand 60 states and 59 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:03,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 19:33:03,713 INFO L93 Difference]: Finished difference Result 60 states and 59 transitions. [2021-11-22 19:33:03,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-22 19:33:03,714 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-22 19:33:03,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 19:33:03,714 INFO L225 Difference]: With dead ends: 60 [2021-11-22 19:33:03,714 INFO L226 Difference]: Without dead ends: 0 [2021-11-22 19:33:03,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-11-22 19:33:03,715 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 138 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 19:33:03,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 233 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 19:33:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-22 19:33:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-22 19:33:03,715 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-22 19:33:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-22 19:33:03,715 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2021-11-22 19:33:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 19:33:03,715 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-22 19:33:03,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 19:33:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-22 19:33:03,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-22 19:33:03,718 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-11-22 19:33:03,718 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-11-22 19:33:03,718 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2021-11-22 19:33:03,718 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2021-11-22 19:33:03,718 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2021-11-22 19:33:03,718 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2021-11-22 19:33:03,718 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-11-22 19:33:03,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-22 19:33:03,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-22 19:33:05,248 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,248 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-22 19:33:05,249 INFO L858 garLoopResultBuilder]: For program point L8972(lines 8972 8974) no Hoare annotation was computed. [2021-11-22 19:33:05,249 INFO L858 garLoopResultBuilder]: For program point L8972-2(lines 8972 8974) no Hoare annotation was computed. [2021-11-22 19:33:05,249 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,249 INFO L854 garLoopResultBuilder]: At program point L8231(lines 8218 8232) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| |ULTIMATE.start_bounded_malloc_~size#1|)) (.cse2 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|)) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616)) 36028797018963967))) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse7 (<= |ULTIMATE.start_bounded_malloc_~size#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_bounded_malloc_~size#1| 18446744073709551616)) 36028797018963967))) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (.cse10 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse11 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|) 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) (.cse4 (div |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| 18446744073709551616))) (or (and (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|) .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (* 18446744073709551616 .cse4)) .cse5 .cse6 .cse7 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse14 (* |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (- 1))) (.cse15 (* .cse4 18446744073709551616))) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) .cse6 .cse7 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) .cse8 .cse9 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|) 18446744073709551616)))) (not .cse13) .cse10 .cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| (+ (* 18446744073709551616 (div (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse14 .cse15) 18446744073709551616)) 18446744073709551615)) .cse12 (<= (* 18446744073709551616 (div (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| 18446744073709551615 .cse14 .cse15) 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|))))) [2021-11-22 19:33:05,249 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:33:05,249 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:33:05,249 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:33:05,249 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:33:05,249 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8975) no Hoare annotation was computed. [2021-11-22 19:33:05,249 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:33:05,249 INFO L858 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:33:05,249 INFO L858 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-11-22 19:33:05,249 INFO L861 garLoopResultBuilder]: At program point L8976(line 8976) the Hoare annotation is: true [2021-11-22 19:33:05,249 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-22 19:33:05,249 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2021-11-22 19:33:05,250 INFO L858 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,251 INFO L858 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,251 INFO L858 garLoopResultBuilder]: For program point L7377-14(line 7377) no Hoare annotation was computed. [2021-11-22 19:33:05,251 INFO L858 garLoopResultBuilder]: For program point L7377-13(lines 7377 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,251 INFO L854 garLoopResultBuilder]: At program point L7377-12(lines 7375 7381) the Hoare annotation is: (let ((.cse22 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse23 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 8)) (.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 24))) (let ((.cse0 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| |ULTIMATE.start_bounded_malloc_~size#1|)) (.cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0))) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|)) (.cse4 (= 0 (select .cse25 .cse24))) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) (.cse5 (select .cse25 .cse23)) (.cse7 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|)) (.cse8 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616)) 36028797018963967))) (.cse21 (div |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| 18446744073709551616)) (.cse9 (= (select .cse22 .cse24) 0)) (.cse10 (<= |ULTIMATE.start_bounded_malloc_~size#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_bounded_malloc_~size#1| 18446744073709551616)) 36028797018963967))) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse12 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|) (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 16))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|)) (.cse16 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse17 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|) 0)) (.cse18 (= (select .cse22 .cse23) 0)) (.cse19 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0)) (.cse20 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (let ((.cse14 (* |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (- 1))) (.cse15 (* .cse21 18446744073709551616))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= .cse5 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6 .cse7 .cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) .cse9 (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) .cse10 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) .cse11 (<= .cse12 (+ (* 18446744073709551616 (div (+ (- 1) .cse12) 18446744073709551616)) 36028797018963967)) .cse13 (<= (* 18446744073709551616 (div (+ 18446744073709551615 .cse12 .cse14 .cse15) 18446744073709551616)) .cse12) .cse16 (<= .cse12 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse12 .cse14 .cse15) 18446744073709551616)))) .cse17 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse18 .cse19 .cse20)) (and .cse0 (<= .cse12 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) .cse1 .cse2 .cse3 .cse4 .cse6 (= .cse5 0) .cse7 .cse8 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (* 18446744073709551616 .cse21)) .cse9 .cse10 .cse11 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| .cse12) .cse13 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2021-11-22 19:33:05,251 INFO L858 garLoopResultBuilder]: For program point L7377-19(lines 7377 7378) no Hoare annotation was computed. [2021-11-22 19:33:05,251 INFO L858 garLoopResultBuilder]: For program point L7377-17(lines 7377 7378) no Hoare annotation was computed. [2021-11-22 19:33:05,251 INFO L858 garLoopResultBuilder]: For program point L7377-16(line 7377) no Hoare annotation was computed. [2021-11-22 19:33:05,251 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,251 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-22 19:33:05,251 INFO L858 garLoopResultBuilder]: For program point L7377-22(lines 7377 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,251 INFO L858 garLoopResultBuilder]: For program point L7377-20(lines 7377 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,251 INFO L854 garLoopResultBuilder]: At program point L7377-25(lines 7375 7381) the Hoare annotation is: (let ((.cse24 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|)) (.cse29 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse31 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse28 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse32 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse30 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| |ULTIMATE.start_bounded_malloc_~size#1|)) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|)) (.cse4 (= (select .cse30 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse5 (= (select .cse28 .cse32) 0)) (.cse6 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|)) (.cse7 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616)) 36028797018963967))) (.cse26 (div |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| 18446744073709551616)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse9 (select .cse31 .cse32)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse14 (= (select .cse31 .cse29) 0)) (.cse15 (<= |ULTIMATE.start_bounded_malloc_~size#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_bounded_malloc_~size#1| 18446744073709551616)) 36028797018963967))) (.cse10 (select .cse30 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|))) (.cse16 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse19 (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0)) (.cse20 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse21 (= (select .cse24 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|) 0)) (.cse22 (= 0 (select .cse28 .cse29))) (.cse25 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) (.cse18 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0))) (or (let ((.cse11 (* |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (- 1))) (.cse12 (* .cse26 18446744073709551616))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 (= .cse9 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= .cse10 (+ (* 18446744073709551616 (div (+ .cse11 .cse10 .cse12) 18446744073709551616)) 18446744073709551615)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) .cse13 .cse14 .cse15 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) .cse16 .cse17 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|) 18446744073709551616)))) (not .cse18) .cse19 .cse20 .cse21 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse22 (<= (* 18446744073709551616 (div (+ 18446744073709551615 .cse11 .cse10 .cse12) 18446744073709551616)) .cse10) (let ((.cse23 (select .cse24 (+ 16 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)))) (<= .cse23 (+ (* 18446744073709551616 (div (+ (- 1) .cse23) 18446744073709551616)) 36028797018963967))) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| (+ (* 18446744073709551616 (div (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse11 .cse12) 18446744073709551616)) 18446744073709551615)) .cse25 (<= (* 18446744073709551616 (div (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| 18446744073709551615 .cse11 .cse12) 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|))) (let ((.cse27 (+ 8 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|))) (and .cse0 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (* 18446744073709551616 .cse26)) .cse8 (= .cse9 0) .cse13 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse27) 0) .cse14 .cse15 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| .cse10) (<= .cse10 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) .cse16 .cse17 .cse19 .cse20 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse27) 0) .cse21 .cse22 .cse25 .cse18))))) [2021-11-22 19:33:05,251 INFO L858 garLoopResultBuilder]: For program point L7377-24(lines 7377 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,251 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L8222(lines 8222 8223) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L8222-2(lines 8222 8223) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L7380-9(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L7380-13(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L7380-12(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L7380-11(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,252 INFO L858 garLoopResultBuilder]: For program point L7380-17(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,253 INFO L858 garLoopResultBuilder]: For program point L7380-15(line 7380) no Hoare annotation was computed. [2021-11-22 19:33:05,253 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,253 INFO L854 garLoopResultBuilder]: At program point L6886(lines 6882 6887) the Hoare annotation is: (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| |ULTIMATE.start_bounded_malloc_~size#1|) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (<= |ULTIMATE.start_bounded_malloc_~size#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_bounded_malloc_~size#1| 18446744073709551616)) 36028797018963967)) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) [2021-11-22 19:33:05,253 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-22 19:33:05,253 INFO L858 garLoopResultBuilder]: For program point L7101(lines 7101 7111) no Hoare annotation was computed. [2021-11-22 19:33:05,253 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-22 19:33:05,253 INFO L854 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse2 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse4 (select .cse0 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|))) (.cse8 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|)) (.cse5 (* |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (- 1))) (.cse6 (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| 18446744073709551616) 18446744073709551616))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| |ULTIMATE.start_bounded_malloc_~size#1|) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) (= (select .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse1 .cse2) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= (select .cse3 .cse2) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|) (<= .cse4 (+ (* 18446744073709551616 (div (+ .cse5 .cse4 .cse6) 18446744073709551616)) 18446744073709551615)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0) (= (select .cse3 .cse7) 0) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|) 18446744073709551616)))) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= (select .cse8 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse1 .cse7)) (<= (* 18446744073709551616 (div (+ 18446744073709551615 .cse5 .cse4 .cse6) 18446744073709551616)) .cse4) (let ((.cse9 (select .cse8 (+ 16 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)))) (<= .cse9 (+ (* 18446744073709551616 (div (+ (- 1) .cse9) 18446744073709551616)) 36028797018963967))) (<= (div |ULTIMATE.start___VERIFIER_assert_~cond#1| 256) 0) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| (+ (* 18446744073709551616 (div (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse5 .cse6) 18446744073709551616)) 18446744073709551615)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0) (<= (* 18446744073709551616 (div (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| 18446744073709551615 .cse5 .cse6) 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|)))) [2021-11-22 19:33:05,275 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 19:33:05,277 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 19:33:05,290 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,291 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,291 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,292 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,293 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,301 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,303 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,303 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,304 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,304 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,304 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,304 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,324 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,324 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,324 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,325 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,325 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,325 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,325 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,325 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,326 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,328 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,328 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,329 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,329 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,329 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,329 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,329 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,329 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,331 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,331 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,331 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,331 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,331 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,331 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,332 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,332 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,332 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,333 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,333 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,333 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,333 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,335 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,335 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,335 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,335 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,335 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,335 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,336 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,337 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,337 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,337 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,337 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,337 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,338 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,338 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,338 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,339 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,339 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,340 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,340 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 07:33:05 BoogieIcfgContainer [2021-11-22 19:33:05,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 19:33:05,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 19:33:05,341 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 19:33:05,341 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 19:33:05,342 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:32:55" (3/4) ... [2021-11-22 19:33:05,344 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-22 19:33:05,355 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2021-11-22 19:33:05,356 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-11-22 19:33:05,357 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-11-22 19:33:05,357 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-22 19:33:05,358 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-22 19:33:05,359 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-22 19:33:05,360 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-22 19:33:05,360 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-22 19:33:05,378 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((cond == 1 && capacity == size) && \result == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0) [2021-11-22 19:33:05,379 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((\result <= 1 && capacity == size) && !(buf == 0)) && capacity <= capacity) && 0 == #memory_$Pointer$[buf][buf + 24]) && #memory_$Pointer$[buf][buf + 8] == array) && buf == buf) && 1 <= \result) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616) + 36028797018963967) && array == 0) && bytes == array) && !(bytes == 0)) && #memory_$Pointer$[buf][buf + 24] == 0) && \result == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf + 16] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][buf + 16]) / 18446744073709551616) + 36028797018963967) && buf == buf) && 18446744073709551616 * ((18446744073709551615 + unknown-#memory_int-unknown[buf][buf + 16] + capacity * -1 + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) <= unknown-#memory_int-unknown[buf][buf + 16]) && capacity <= capacity) && unknown-#memory_int-unknown[buf][buf + 16] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][buf + 16] + capacity * -1 + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616)) && unknown-#memory_int-unknown[buf][buf] == 0) && bytes == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && buf == 0) && buf == 0) || ((((((((((((((((((((\result <= 1 && unknown-#memory_int-unknown[buf][buf + 16] <= capacity) && capacity == size) && !(buf == 0)) && capacity <= capacity) && 0 == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && #memory_$Pointer$[buf][buf + 8] == 0) && 1 <= \result) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616) + 36028797018963967) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616)) && #memory_$Pointer$[buf][buf + 24] == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(buf == 0)) && capacity <= unknown-#memory_int-unknown[buf][buf + 16]) && buf == buf) && capacity <= capacity) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && buf == 0) && buf == 0) [2021-11-22 19:33:05,379 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((capacity <= unknown-#res!capacity-unknown && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == size) && capacity <= capacity) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616) + 36028797018963967) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616)) && unknown-#res!len-unknown == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && unknown-#res!capacity-unknown <= capacity) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity <= capacity) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) || (((((((((((((((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && capacity == size) && capacity <= capacity) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616) + 36028797018963967) && array == 0) && bytes == array) && unknown-#res!len-unknown == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == array) && \result == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && !(aws_byte_buf_from_empty_array_#res#1.buffer == 0)) && capacity <= capacity) && unknown-#memory_int-unknown[buf][buf] == 0) && bytes == 0) && unknown-#res!capacity-unknown <= 18446744073709551616 * ((unknown-#res!capacity-unknown + capacity * -1 + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) + 18446744073709551615) && buf == 0) && 18446744073709551616 * ((unknown-#res!capacity-unknown + 18446744073709551615 + capacity * -1 + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) <= unknown-#res!capacity-unknown) [2021-11-22 19:33:05,379 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((\result <= 1 && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == size) && capacity <= capacity) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && 1 <= \result) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616) + 36028797018963967) && array == 0) && bytes == array) && unknown-#res!len-unknown == 0) && #memory_$Pointer$[buf][buf + 8] == array) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((capacity * -1 + unknown-#memory_int-unknown[buf][16 + buf] + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) + 18446744073709551615) && aws_byte_buf_from_empty_array_#res#1.buffer == array) && \result == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && !(aws_byte_buf_from_empty_array_#res#1.buffer == 0)) && buf == 0) && capacity <= capacity) && unknown-#memory_int-unknown[buf][buf] == 0) && bytes == 0) && 0 == #memory_$Pointer$[buf][buf + 24]) && 18446744073709551616 * ((18446744073709551615 + capacity * -1 + unknown-#memory_int-unknown[buf][16 + buf] + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) <= unknown-#memory_int-unknown[buf][16 + buf]) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 36028797018963967) && unknown-#res!capacity-unknown <= 18446744073709551616 * ((unknown-#res!capacity-unknown + capacity * -1 + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) + 18446744073709551615) && buf == 0) && 18446744073709551616 * ((unknown-#res!capacity-unknown + 18446744073709551615 + capacity * -1 + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) <= unknown-#res!capacity-unknown) || (((((((((((((((((((((((((((\result <= 1 && capacity <= unknown-#res!capacity-unknown) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == size) && capacity <= capacity) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && 1 <= \result) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616) + 36028797018963967) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616)) && unknown-#res!len-unknown == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && #memory_$Pointer$[buf][8 + buf] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && capacity <= unknown-#memory_int-unknown[buf][16 + buf]) && unknown-#memory_int-unknown[buf][16 + buf] <= capacity) && unknown-#res!capacity-unknown <= capacity) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && buf == 0) && capacity <= capacity) && #memory_$Pointer$[buf][8 + buf] == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && 0 == #memory_$Pointer$[buf][buf + 24]) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) [2021-11-22 19:33:05,380 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && capacity == size) && capacity <= capacity) && unknown-#memory_int-unknown[buf][buf] == 0) && b == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && array == 0) && bytes == array) && unknown-#res!len-unknown == 0) && #memory_$Pointer$[buf][buf + 8] == array) && 1 <= cond) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((capacity * -1 + unknown-#memory_int-unknown[buf][16 + buf] + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) + 18446744073709551615) && aws_byte_buf_from_empty_array_#res#1.buffer == array) && \result == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && !(\result == 0)) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && !(aws_byte_buf_from_empty_array_#res#1.buffer == 0)) && buf == 0) && capacity <= capacity) && b == a) && unknown-#memory_int-unknown[buf][buf] == 0) && bytes == 0) && 0 == #memory_$Pointer$[buf][buf + 24]) && 18446744073709551616 * ((18446744073709551615 + capacity * -1 + unknown-#memory_int-unknown[buf][16 + buf] + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) <= unknown-#memory_int-unknown[buf][16 + buf]) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 36028797018963967) && cond / 256 <= 0) && a == 0) && unknown-#res!capacity-unknown <= 18446744073709551616 * ((unknown-#res!capacity-unknown + capacity * -1 + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) + 18446744073709551615) && buf == 0) && 18446744073709551616 * ((unknown-#res!capacity-unknown + 18446744073709551615 + capacity * -1 + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) <= unknown-#res!capacity-unknown [2021-11-22 19:33:05,929 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-22 19:33:05,930 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 19:33:05,930 INFO L158 Benchmark]: Toolchain (without parser) took 13625.59ms. Allocated memory was 92.3MB in the beginning and 597.7MB in the end (delta: 505.4MB). Free memory was 68.1MB in the beginning and 198.8MB in the end (delta: -130.7MB). Peak memory consumption was 395.1MB. Max. memory is 16.1GB. [2021-11-22 19:33:05,931 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 19:33:05,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1592.22ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 67.9MB in the beginning and 57.2MB in the end (delta: 10.7MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2021-11-22 19:33:05,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 205.90ms. Allocated memory is still 111.1MB. Free memory was 57.2MB in the beginning and 45.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-22 19:33:05,931 INFO L158 Benchmark]: Boogie Preprocessor took 78.90ms. Allocated memory is still 111.1MB. Free memory was 45.1MB in the beginning and 38.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-22 19:33:05,931 INFO L158 Benchmark]: RCFGBuilder took 1031.13ms. Allocated memory was 111.1MB in the beginning and 192.9MB in the end (delta: 81.8MB). Free memory was 38.8MB in the beginning and 150.8MB in the end (delta: -112.0MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2021-11-22 19:33:05,932 INFO L158 Benchmark]: TraceAbstraction took 10123.04ms. Allocated memory was 192.9MB in the beginning and 457.2MB in the end (delta: 264.2MB). Free memory was 150.8MB in the beginning and 267.3MB in the end (delta: -116.5MB). Peak memory consumption was 147.7MB. Max. memory is 16.1GB. [2021-11-22 19:33:05,932 INFO L158 Benchmark]: Witness Printer took 588.86ms. Allocated memory was 457.2MB in the beginning and 597.7MB in the end (delta: 140.5MB). Free memory was 267.3MB in the beginning and 198.8MB in the end (delta: 68.5MB). Peak memory consumption was 230.0MB. Max. memory is 16.1GB. [2021-11-22 19:33:05,933 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.18ms. Allocated memory is still 92.3MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1592.22ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 67.9MB in the beginning and 57.2MB in the end (delta: 10.7MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 205.90ms. Allocated memory is still 111.1MB. Free memory was 57.2MB in the beginning and 45.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.90ms. Allocated memory is still 111.1MB. Free memory was 45.1MB in the beginning and 38.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1031.13ms. Allocated memory was 111.1MB in the beginning and 192.9MB in the end (delta: 81.8MB). Free memory was 38.8MB in the beginning and 150.8MB in the end (delta: -112.0MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10123.04ms. Allocated memory was 192.9MB in the beginning and 457.2MB in the end (delta: 264.2MB). Free memory was 150.8MB in the beginning and 267.3MB in the end (delta: -116.5MB). Peak memory consumption was 147.7MB. Max. memory is 16.1GB. * Witness Printer took 588.86ms. Allocated memory was 457.2MB in the beginning and 597.7MB in the end (delta: 140.5MB). Free memory was 267.3MB in the beginning and 198.8MB in the end (delta: 68.5MB). Peak memory consumption was 230.0MB. Max. memory is 16.1GB. * 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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: 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: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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: 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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#1 : { 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: 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#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled * 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, 79 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2932 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2932 mSDsluCounter, 6668 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4812 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1962 IncrementalHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 1856 mSDtfsCounter, 1962 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=16, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 345 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 1206 HoareAnnotationTreeSize, 6 FomulaSimplifications, 512 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 2631 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 777 NumberOfCodeBlocks, 777 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 752 ConstructedInterpolants, 0 QuantifiedInterpolants, 7996 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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-22 19:33:05,949 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,949 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,950 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,950 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,950 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,950 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,951 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,951 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,951 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,952 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,952 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && capacity == size) && capacity <= capacity) && unknown-#memory_int-unknown[buf][buf] == 0) && b == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && array == 0) && bytes == array) && unknown-#res!len-unknown == 0) && #memory_$Pointer$[buf][buf + 8] == array) && 1 <= cond) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((capacity * -1 + unknown-#memory_int-unknown[buf][16 + buf] + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) + 18446744073709551615) && aws_byte_buf_from_empty_array_#res#1.buffer == array) && \result == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && !(\result == 0)) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && !(aws_byte_buf_from_empty_array_#res#1.buffer == 0)) && buf == 0) && capacity <= capacity) && b == a) && unknown-#memory_int-unknown[buf][buf] == 0) && bytes == 0) && 0 == #memory_$Pointer$[buf][buf + 24]) && 18446744073709551616 * ((18446744073709551615 + capacity * -1 + unknown-#memory_int-unknown[buf][16 + buf] + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) <= unknown-#memory_int-unknown[buf][16 + buf]) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 36028797018963967) && cond / 256 <= 0) && a == 0) && unknown-#res!capacity-unknown <= 18446744073709551616 * ((unknown-#res!capacity-unknown + capacity * -1 + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) + 18446744073709551615) && buf == 0) && 18446744073709551616 * ((unknown-#res!capacity-unknown + 18446744073709551615 + capacity * -1 + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) <= unknown-#res!capacity-unknown - InvariantResult [Line: 7375]: Loop Invariant [2021-11-22 19:33:05,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,954 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,956 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((\result <= 1 && capacity == size) && !(buf == 0)) && capacity <= capacity) && 0 == #memory_$Pointer$[buf][buf + 24]) && #memory_$Pointer$[buf][buf + 8] == array) && buf == buf) && 1 <= \result) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616) + 36028797018963967) && array == 0) && bytes == array) && !(bytes == 0)) && #memory_$Pointer$[buf][buf + 24] == 0) && \result == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf + 16] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][buf + 16]) / 18446744073709551616) + 36028797018963967) && buf == buf) && 18446744073709551616 * ((18446744073709551615 + unknown-#memory_int-unknown[buf][buf + 16] + capacity * -1 + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) <= unknown-#memory_int-unknown[buf][buf + 16]) && capacity <= capacity) && unknown-#memory_int-unknown[buf][buf + 16] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][buf + 16] + capacity * -1 + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616)) && unknown-#memory_int-unknown[buf][buf] == 0) && bytes == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && buf == 0) && buf == 0) || ((((((((((((((((((((\result <= 1 && unknown-#memory_int-unknown[buf][buf + 16] <= capacity) && capacity == size) && !(buf == 0)) && capacity <= capacity) && 0 == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && #memory_$Pointer$[buf][buf + 8] == 0) && 1 <= \result) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616) + 36028797018963967) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616)) && #memory_$Pointer$[buf][buf + 24] == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(buf == 0)) && capacity <= unknown-#memory_int-unknown[buf][buf + 16]) && buf == buf) && capacity <= capacity) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && buf == 0) && buf == 0) - InvariantResult [Line: 8218]: Loop Invariant [2021-11-22 19:33:05,956 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,957 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,958 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,958 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,958 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,958 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,958 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,959 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,959 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,959 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,959 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,959 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: (((((((((((((((capacity <= unknown-#res!capacity-unknown && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == size) && capacity <= capacity) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616) + 36028797018963967) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616)) && unknown-#res!len-unknown == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && unknown-#res!capacity-unknown <= capacity) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity <= capacity) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) || (((((((((((((((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && capacity == size) && capacity <= capacity) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616) + 36028797018963967) && array == 0) && bytes == array) && unknown-#res!len-unknown == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == array) && \result == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && !(aws_byte_buf_from_empty_array_#res#1.buffer == 0)) && capacity <= capacity) && unknown-#memory_int-unknown[buf][buf] == 0) && bytes == 0) && unknown-#res!capacity-unknown <= 18446744073709551616 * ((unknown-#res!capacity-unknown + capacity * -1 + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) + 18446744073709551615) && buf == 0) && 18446744073709551616 * ((unknown-#res!capacity-unknown + 18446744073709551615 + capacity * -1 + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) <= unknown-#res!capacity-unknown) - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (((cond == 1 && capacity == size) && \result == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0) - InvariantResult [Line: 7375]: Loop Invariant [2021-11-22 19:33:05,960 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,960 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,961 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,961 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,961 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,961 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,961 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,961 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,962 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,962 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,962 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,962 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,962 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,962 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,963 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,963 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,964 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,964 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,964 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,964 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,965 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,965 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,965 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,965 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,966 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-22 19:33:05,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-22 19:33:05,966 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-22 19:33:05,966 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: ((((((((((((((((((((((((((((((((\result <= 1 && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == size) && capacity <= capacity) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && 1 <= \result) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616) + 36028797018963967) && array == 0) && bytes == array) && unknown-#res!len-unknown == 0) && #memory_$Pointer$[buf][buf + 8] == array) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((capacity * -1 + unknown-#memory_int-unknown[buf][16 + buf] + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) + 18446744073709551615) && aws_byte_buf_from_empty_array_#res#1.buffer == array) && \result == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && !(aws_byte_buf_from_empty_array_#res#1.buffer == 0)) && buf == 0) && capacity <= capacity) && unknown-#memory_int-unknown[buf][buf] == 0) && bytes == 0) && 0 == #memory_$Pointer$[buf][buf + 24]) && 18446744073709551616 * ((18446744073709551615 + capacity * -1 + unknown-#memory_int-unknown[buf][16 + buf] + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) <= unknown-#memory_int-unknown[buf][16 + buf]) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 36028797018963967) && unknown-#res!capacity-unknown <= 18446744073709551616 * ((unknown-#res!capacity-unknown + capacity * -1 + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) + 18446744073709551615) && buf == 0) && 18446744073709551616 * ((unknown-#res!capacity-unknown + 18446744073709551615 + capacity * -1 + capacity / 18446744073709551616 * 18446744073709551616) / 18446744073709551616) <= unknown-#res!capacity-unknown) || (((((((((((((((((((((((((((\result <= 1 && capacity <= unknown-#res!capacity-unknown) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == size) && capacity <= capacity) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && 1 <= \result) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616) + 36028797018963967) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616)) && unknown-#res!len-unknown == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && #memory_$Pointer$[buf][8 + buf] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && capacity <= unknown-#memory_int-unknown[buf][16 + buf]) && unknown-#memory_int-unknown[buf][16 + buf] <= capacity) && unknown-#res!capacity-unknown <= capacity) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && buf == 0) && capacity <= capacity) && #memory_$Pointer$[buf][8 + buf] == 0) && unknown-#memory_int-unknown[buf][buf] == 0) && 0 == #memory_$Pointer$[buf][buf + 24]) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) RESULT: Ultimate proved your program to be correct! [2021-11-22 19:33:05,974 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