./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_compare_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_string_compare_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 66fb9bfec5c458b51d86deb6748dd65f162e7ac6a772af5f3fec59d101a18d8d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:17:07,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:17:07,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:17:07,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:17:07,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:17:07,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:17:07,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:17:07,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:17:07,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:17:07,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:17:07,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:17:07,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:17:07,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:17:07,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:17:07,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:17:07,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:17:07,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:17:07,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:17:07,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:17:07,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:17:07,344 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:17:07,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:17:07,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:17:07,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:17:07,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:17:07,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:17:07,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:17:07,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:17:07,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:17:07,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:17:07,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:17:07,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:17:07,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:17:07,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:17:07,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:17:07,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:17:07,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:17:07,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:17:07,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:17:07,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:17:07,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:17:07,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:17:07,366 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:17:07,387 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:17:07,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:17:07,388 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:17:07,388 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:17:07,388 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:17:07,388 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:17:07,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:17:07,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:17:07,389 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:17:07,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:17:07,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:17:07,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:17:07,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:17:07,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:17:07,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:17:07,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:17:07,391 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:17:07,391 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:17:07,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:17:07,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:17:07,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:17:07,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:17:07,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:17:07,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:17:07,392 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:17:07,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:17:07,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:17:07,393 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:17:07,393 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:17:07,393 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:17:07,393 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 -> 66fb9bfec5c458b51d86deb6748dd65f162e7ac6a772af5f3fec59d101a18d8d [2022-07-12 11:17:07,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:17:07,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:17:07,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:17:07,603 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:17:07,604 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:17:07,604 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_compare_harness.i [2022-07-12 11:17:07,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2e64a4d/1577a4269bd44585a544a1238e2af58a/FLAGe77b4b721 [2022-07-12 11:17:08,218 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:17:08,219 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_compare_harness.i [2022-07-12 11:17:08,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2e64a4d/1577a4269bd44585a544a1238e2af58a/FLAGe77b4b721 [2022-07-12 11:17:08,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2e64a4d/1577a4269bd44585a544a1238e2af58a [2022-07-12 11:17:08,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:17:08,691 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:17:08,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:17:08,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:17:08,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:17:08,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:17:08" (1/1) ... [2022-07-12 11:17:08,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d17760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:08, skipping insertion in model container [2022-07-12 11:17:08,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:17:08" (1/1) ... [2022-07-12 11:17:08,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:17:08,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:17:09,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_compare_harness.i[4492,4505] [2022-07-12 11:17:09,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_compare_harness.i[4552,4565] [2022-07-12 11:17:09,553 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:09,555 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:09,556 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:09,556 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:09,558 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:09,569 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:09,570 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:09,571 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:09,571 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:09,783 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:17:09,784 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:17:09,784 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:17:09,785 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:17:09,786 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:17:09,786 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:17:09,787 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:17:09,787 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:17:09,788 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:17:09,788 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:17:09,897 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:17:10,000 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:10,001 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:10,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:17:10,091 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:17:10,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_compare_harness.i[4492,4505] [2022-07-12 11:17:10,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_compare_harness.i[4552,4565] [2022-07-12 11:17:10,131 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:10,131 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:10,131 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:10,132 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:10,132 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:10,135 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:10,136 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:10,137 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:10,138 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:10,159 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:17:10,160 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:17:10,160 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:17:10,161 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:17:10,162 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:17:10,162 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:17:10,162 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:17:10,162 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:17:10,163 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:17:10,163 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:17:10,180 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:17:10,244 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:10,245 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:17:10,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:17:10,404 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:17:10,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:10 WrapperNode [2022-07-12 11:17:10,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:17:10,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:17:10,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:17:10,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:17:10,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:10" (1/1) ... [2022-07-12 11:17:10,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:10" (1/1) ... [2022-07-12 11:17:10,557 INFO L137 Inliner]: procedures = 693, calls = 2780, calls flagged for inlining = 57, calls inlined = 5, statements flattened = 822 [2022-07-12 11:17:10,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:17:10,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:17:10,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:17:10,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:17:10,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:10" (1/1) ... [2022-07-12 11:17:10,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:10" (1/1) ... [2022-07-12 11:17:10,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:10" (1/1) ... [2022-07-12 11:17:10,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:10" (1/1) ... [2022-07-12 11:17:10,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:10" (1/1) ... [2022-07-12 11:17:10,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:10" (1/1) ... [2022-07-12 11:17:10,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:10" (1/1) ... [2022-07-12 11:17:10,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:17:10,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:17:10,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:17:10,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:17:10,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:10" (1/1) ... [2022-07-12 11:17:10,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:17:10,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:10,649 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) [2022-07-12 11:17:10,669 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 [2022-07-12 11:17:10,701 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-12 11:17:10,701 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-12 11:17:10,701 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_compare [2022-07-12 11:17:10,701 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_compare [2022-07-12 11:17:10,701 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-07-12 11:17:10,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-07-12 11:17:10,701 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-12 11:17:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 11:17:10,702 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 11:17:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:17:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:17:10,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:17:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:17:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:17:10,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:17:10,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:17:10,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:17:10,704 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 11:17:10,704 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 11:17:10,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 11:17:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_bytes [2022-07-12 11:17:10,705 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_bytes [2022-07-12 11:17:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:17:10,705 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:17:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:17:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-12 11:17:10,705 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-12 11:17:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 11:17:10,706 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 11:17:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:17:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:17:10,933 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:17:10,934 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:17:11,556 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:17:11,561 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:17:11,561 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 11:17:11,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:17:11 BoogieIcfgContainer [2022-07-12 11:17:11,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:17:11,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:17:11,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:17:11,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:17:11,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:17:08" (1/3) ... [2022-07-12 11:17:11,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1ef99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:17:11, skipping insertion in model container [2022-07-12 11:17:11,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:17:10" (2/3) ... [2022-07-12 11:17:11,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1ef99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:17:11, skipping insertion in model container [2022-07-12 11:17:11,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:17:11" (3/3) ... [2022-07-12 11:17:11,568 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_compare_harness.i [2022-07-12 11:17:11,577 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:17:11,577 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:17:11,610 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:17:11,614 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d3210c0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5fad24 [2022-07-12 11:17:11,614 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:17:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 80 states have (on average 1.3) internal successors, (104), 81 states have internal predecessors, (104), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-07-12 11:17:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 11:17:11,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:11,625 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:11,625 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:11,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:11,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1023392938, now seen corresponding path program 1 times [2022-07-12 11:17:11,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:11,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187248149] [2022-07-12 11:17:11,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:11,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 11:17:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:17:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:17:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:17:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 11:17:12,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:12,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187248149] [2022-07-12 11:17:12,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187248149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:12,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:12,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 11:17:12,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102032830] [2022-07-12 11:17:12,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:12,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 11:17:12,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:12,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 11:17:12,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 11:17:12,152 INFO L87 Difference]: Start difference. First operand has 125 states, 80 states have (on average 1.3) internal successors, (104), 81 states have internal predecessors, (104), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 11:17:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:12,196 INFO L93 Difference]: Finished difference Result 245 states and 350 transitions. [2022-07-12 11:17:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 11:17:12,197 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2022-07-12 11:17:12,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:12,209 INFO L225 Difference]: With dead ends: 245 [2022-07-12 11:17:12,209 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 11:17:12,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 11:17:12,219 INFO L413 NwaCegarLoop]: 168 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, 168 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 [2022-07-12 11:17:12,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:17:12,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 11:17:12,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-12 11:17:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 77 states have internal predecessors, (97), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-12 11:17:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 162 transitions. [2022-07-12 11:17:12,272 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 162 transitions. Word has length 52 [2022-07-12 11:17:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:12,273 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 162 transitions. [2022-07-12 11:17:12,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 11:17:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 162 transitions. [2022-07-12 11:17:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 11:17:12,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:12,280 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:12,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:17:12,280 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:12,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:12,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1611808362, now seen corresponding path program 1 times [2022-07-12 11:17:12,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:12,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752379324] [2022-07-12 11:17:12,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:12,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 11:17:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:17:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:17:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:17:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 11:17:12,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:12,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752379324] [2022-07-12 11:17:12,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752379324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:12,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:12,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:17:12,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067717650] [2022-07-12 11:17:12,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:12,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:17:12,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:12,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:17:12,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:17:12,552 INFO L87 Difference]: Start difference. First operand 120 states and 162 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 11:17:12,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:12,591 INFO L93 Difference]: Finished difference Result 176 states and 237 transitions. [2022-07-12 11:17:12,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:17:12,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2022-07-12 11:17:12,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:12,594 INFO L225 Difference]: With dead ends: 176 [2022-07-12 11:17:12,594 INFO L226 Difference]: Without dead ends: 140 [2022-07-12 11:17:12,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:17:12,595 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 8 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:12,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 474 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:17:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-12 11:17:12,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2022-07-12 11:17:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-07-12 11:17:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 188 transitions. [2022-07-12 11:17:12,610 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 188 transitions. Word has length 52 [2022-07-12 11:17:12,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:12,611 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 188 transitions. [2022-07-12 11:17:12,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 11:17:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 188 transitions. [2022-07-12 11:17:12,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-12 11:17:12,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:12,614 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:12,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 11:17:12,614 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:12,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:12,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1339119567, now seen corresponding path program 1 times [2022-07-12 11:17:12,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:12,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007744800] [2022-07-12 11:17:12,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:12,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 11:17:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:17:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:17:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:17:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:17:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 11:17:12,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:12,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007744800] [2022-07-12 11:17:12,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007744800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:12,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:12,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:17:12,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295920711] [2022-07-12 11:17:12,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:12,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:17:12,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:12,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:17:12,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:17:12,804 INFO L87 Difference]: Start difference. First operand 137 states and 188 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 11:17:12,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:12,830 INFO L93 Difference]: Finished difference Result 164 states and 222 transitions. [2022-07-12 11:17:12,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:17:12,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2022-07-12 11:17:12,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:12,834 INFO L225 Difference]: With dead ends: 164 [2022-07-12 11:17:12,834 INFO L226 Difference]: Without dead ends: 143 [2022-07-12 11:17:12,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:17:12,838 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:12,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 470 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:17:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-12 11:17:12,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-07-12 11:17:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 93 states have internal predecessors, (118), 38 states have call successors, (38), 10 states have call predecessors, (38), 11 states have return successors, (39), 39 states have call predecessors, (39), 37 states have call successors, (39) [2022-07-12 11:17:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 195 transitions. [2022-07-12 11:17:12,856 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 195 transitions. Word has length 61 [2022-07-12 11:17:12,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:12,857 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 195 transitions. [2022-07-12 11:17:12,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 11:17:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 195 transitions. [2022-07-12 11:17:12,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 11:17:12,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:12,860 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:12,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 11:17:12,860 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:12,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:12,861 INFO L85 PathProgramCache]: Analyzing trace with hash 911301910, now seen corresponding path program 1 times [2022-07-12 11:17:12,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:12,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236177418] [2022-07-12 11:17:12,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:12,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:12,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 11:17:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:17:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:17:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:17:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:17:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 11:17:13,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:13,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236177418] [2022-07-12 11:17:13,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236177418] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:13,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:13,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:17:13,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902608884] [2022-07-12 11:17:13,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:13,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:17:13,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:13,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:17:13,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:17:13,079 INFO L87 Difference]: Start difference. First operand 143 states and 195 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 11:17:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:13,112 INFO L93 Difference]: Finished difference Result 207 states and 280 transitions. [2022-07-12 11:17:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:17:13,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2022-07-12 11:17:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:13,115 INFO L225 Difference]: With dead ends: 207 [2022-07-12 11:17:13,115 INFO L226 Difference]: Without dead ends: 163 [2022-07-12 11:17:13,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:17:13,117 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 5 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:13,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 649 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:17:13,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-12 11:17:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-07-12 11:17:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 107 states have (on average 1.2616822429906542) internal successors, (135), 108 states have internal predecessors, (135), 44 states have call successors, (44), 10 states have call predecessors, (44), 11 states have return successors, (44), 44 states have call predecessors, (44), 41 states have call successors, (44) [2022-07-12 11:17:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 223 transitions. [2022-07-12 11:17:13,125 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 223 transitions. Word has length 62 [2022-07-12 11:17:13,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:13,125 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 223 transitions. [2022-07-12 11:17:13,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-12 11:17:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 223 transitions. [2022-07-12 11:17:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 11:17:13,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:13,127 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:13,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:17:13,127 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:13,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:13,127 INFO L85 PathProgramCache]: Analyzing trace with hash 17815572, now seen corresponding path program 1 times [2022-07-12 11:17:13,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:13,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140742575] [2022-07-12 11:17:13,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:13,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 11:17:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:17:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:17:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:17:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:17:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 11:17:13,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:13,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140742575] [2022-07-12 11:17:13,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140742575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:13,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:13,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:17:13,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952428499] [2022-07-12 11:17:13,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:13,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:17:13,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:13,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:17:13,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:17:13,349 INFO L87 Difference]: Start difference. First operand 163 states and 223 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-12 11:17:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:13,430 INFO L93 Difference]: Finished difference Result 193 states and 260 transitions. [2022-07-12 11:17:13,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:17:13,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 62 [2022-07-12 11:17:13,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:13,431 INFO L225 Difference]: With dead ends: 193 [2022-07-12 11:17:13,431 INFO L226 Difference]: Without dead ends: 171 [2022-07-12 11:17:13,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:17:13,432 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 29 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:13,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 963 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:17:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-12 11:17:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 162. [2022-07-12 11:17:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 106 states have (on average 1.2641509433962264) internal successors, (134), 107 states have internal predecessors, (134), 44 states have call successors, (44), 10 states have call predecessors, (44), 11 states have return successors, (44), 44 states have call predecessors, (44), 41 states have call successors, (44) [2022-07-12 11:17:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 222 transitions. [2022-07-12 11:17:13,439 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 222 transitions. Word has length 62 [2022-07-12 11:17:13,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:13,439 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 222 transitions. [2022-07-12 11:17:13,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-12 11:17:13,439 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 222 transitions. [2022-07-12 11:17:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-12 11:17:13,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:13,440 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:13,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 11:17:13,440 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:13,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:13,441 INFO L85 PathProgramCache]: Analyzing trace with hash -699694359, now seen corresponding path program 1 times [2022-07-12 11:17:13,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:13,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848156163] [2022-07-12 11:17:13,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:13,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 11:17:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:17:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:17:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:17:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:13,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:14,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:17:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:14,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:17:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:14,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:17:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:14,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:14,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:17:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 11:17:14,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:14,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848156163] [2022-07-12 11:17:14,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848156163] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:17:14,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435349819] [2022-07-12 11:17:14,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:14,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:17:14,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:17:14,069 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:17:14,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 11:17:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:14,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 2584 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-12 11:17:14,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:17:14,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 60 [2022-07-12 11:17:14,813 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-12 11:17:14,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 28 [2022-07-12 11:17:14,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:17:14,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 11:17:16,383 INFO L356 Elim1Store]: treesize reduction 93, result has 7.9 percent of original size [2022-07-12 11:17:16,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 183 treesize of output 116 [2022-07-12 11:17:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 11:17:16,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:17:17,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-07-12 11:17:17,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 11:17:17,837 INFO L356 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2022-07-12 11:17:17,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 18 [2022-07-12 11:17:17,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-07-12 11:17:17,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 11:17:17,859 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-12 11:17:17,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 1 [2022-07-12 11:17:17,877 INFO L356 Elim1Store]: treesize reduction 66, result has 5.7 percent of original size [2022-07-12 11:17:17,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 50 [2022-07-12 11:17:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 11:17:18,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435349819] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:17:18,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:17:18,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 25, 18] total 50 [2022-07-12 11:17:18,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748945074] [2022-07-12 11:17:18,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:17:18,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-12 11:17:18,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:18,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-12 11:17:18,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2299, Unknown=0, NotChecked=0, Total=2450 [2022-07-12 11:17:18,175 INFO L87 Difference]: Start difference. First operand 162 states and 222 transitions. Second operand has 50 states, 44 states have (on average 2.840909090909091) internal successors, (125), 37 states have internal predecessors, (125), 17 states have call successors, (34), 7 states have call predecessors, (34), 12 states have return successors, (32), 20 states have call predecessors, (32), 15 states have call successors, (32) [2022-07-12 11:17:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:20,956 INFO L93 Difference]: Finished difference Result 249 states and 332 transitions. [2022-07-12 11:17:20,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 11:17:20,958 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 44 states have (on average 2.840909090909091) internal successors, (125), 37 states have internal predecessors, (125), 17 states have call successors, (34), 7 states have call predecessors, (34), 12 states have return successors, (32), 20 states have call predecessors, (32), 15 states have call successors, (32) Word has length 90 [2022-07-12 11:17:20,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:20,960 INFO L225 Difference]: With dead ends: 249 [2022-07-12 11:17:20,960 INFO L226 Difference]: Without dead ends: 68 [2022-07-12 11:17:20,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 161 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=308, Invalid=3982, Unknown=0, NotChecked=0, Total=4290 [2022-07-12 11:17:20,962 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 170 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:20,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 913 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2601 Invalid, 0 Unknown, 205 Unchecked, 1.8s Time] [2022-07-12 11:17:20,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-12 11:17:20,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-07-12 11:17:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-12 11:17:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2022-07-12 11:17:20,967 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 90 [2022-07-12 11:17:20,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:20,967 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2022-07-12 11:17:20,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 44 states have (on average 2.840909090909091) internal successors, (125), 37 states have internal predecessors, (125), 17 states have call successors, (34), 7 states have call predecessors, (34), 12 states have return successors, (32), 20 states have call predecessors, (32), 15 states have call successors, (32) [2022-07-12 11:17:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2022-07-12 11:17:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 11:17:20,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:20,968 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:20,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 11:17:21,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 11:17:21,184 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:21,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1244120169, now seen corresponding path program 1 times [2022-07-12 11:17:21,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:21,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469533136] [2022-07-12 11:17:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:21,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 11:17:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:17:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:17:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:17:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:17:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:17:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:17:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:17:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-12 11:17:21,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:21,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469533136] [2022-07-12 11:17:21,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469533136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:21,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:21,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:17:21,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119170259] [2022-07-12 11:17:21,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:21,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:17:21,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:21,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:17:21,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:17:21,388 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 11:17:21,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:21,418 INFO L93 Difference]: Finished difference Result 113 states and 142 transitions. [2022-07-12 11:17:21,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:17:21,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2022-07-12 11:17:21,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:21,419 INFO L225 Difference]: With dead ends: 113 [2022-07-12 11:17:21,419 INFO L226 Difference]: Without dead ends: 65 [2022-07-12 11:17:21,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:17:21,420 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 13 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:21,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 308 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:17:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-12 11:17:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-12 11:17:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 43 states have internal predecessors, (49), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-12 11:17:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2022-07-12 11:17:21,425 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 96 [2022-07-12 11:17:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:21,425 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2022-07-12 11:17:21,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 11:17:21,426 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2022-07-12 11:17:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-12 11:17:21,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:17:21,427 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:21,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 11:17:21,427 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:17:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:17:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2083496473, now seen corresponding path program 1 times [2022-07-12 11:17:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:17:21,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276879637] [2022-07-12 11:17:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:17:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:17:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:17:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 11:17:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:17:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:17:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:17:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:17:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:17:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:17:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:17:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:17:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:17:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:17:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-12 11:17:21,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:17:21,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276879637] [2022-07-12 11:17:21,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276879637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:17:21,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:17:21,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:17:21,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64540932] [2022-07-12 11:17:21,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:17:21,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:17:21,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:17:21,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:17:21,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:17:21,649 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 6 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-12 11:17:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:17:21,749 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2022-07-12 11:17:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:17:21,749 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 6 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 96 [2022-07-12 11:17:21,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:17:21,750 INFO L225 Difference]: With dead ends: 76 [2022-07-12 11:17:21,750 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 11:17:21,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:17:21,751 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 20 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:17:21,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 314 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:17:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 11:17:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 11:17:21,752 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) [2022-07-12 11:17:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 11:17:21,752 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2022-07-12 11:17:21,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:17:21,752 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 11:17:21,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 6 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-12 11:17:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 11:17:21,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 11:17:21,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 11:17:21,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 11:17:21,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 11:17:22,011 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (let ((.cse0 (mod |ensure_string_is_allocated_bounded_length_#in~max_size#1| 18446744073709551616))) (and (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (< (mod |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616) .cse0) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (let ((.cse2 (select |#memory_int| |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base|))) (let ((.cse1 (select .cse2 (+ |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 8)))) (let ((.cse4 (* (- 1) .cse1))) (let ((.cse5 (div (+ (- 1) .cse0 .cse4) (- 18446744073709551616))) (.cse6 (div .cse1 18446744073709551616)) (.cse3 (mod .cse1 18446744073709551616))) (or (and (< 0 (+ (div (+ .cse0 (- 18446744073709551609)) 18446744073709551616) 1)) (= 0 .cse1)) (and (= (select .cse2 (+ |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| (- 18446744073709551600) .cse3)) 0) (< (+ (div (+ 18446744073709551615 .cse4) (- 18446744073709551616)) .cse5) (+ (div (+ (- 9223372036854775808) .cse1) 18446744073709551616) .cse6 1))) (and (< .cse5 (+ .cse6 1)) (<= .cse3 9223372036854775807) (= (select .cse2 (+ |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 16 .cse3)) 0))))))) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 0) (< (mod |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) .cse0))) [2022-07-12 11:17:22,011 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-07-12 11:17:22,011 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (let ((.cse0 (mod |ensure_string_is_allocated_bounded_length_#in~max_size#1| 18446744073709551616))) (and (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (< (mod |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616) .cse0) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (< (mod |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) .cse0))) [2022-07-12 11:17:22,011 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-07-12 11:17:22,012 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (let ((.cse0 (mod |ensure_string_is_allocated_bounded_length_#in~max_size#1| 18446744073709551616))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< (mod |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616) .cse0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (< (mod |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) .cse0))) [2022-07-12 11:17:22,012 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-07-12 11:17:22,012 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (let ((.cse0 (mod |ensure_string_is_allocated_bounded_length_#in~max_size#1| 18446744073709551616))) (and (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (< (mod |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616) .cse0) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (< (mod |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) .cse0))) [2022-07-12 11:17:22,012 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-07-12 11:17:22,012 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-12 11:17:22,012 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-12 11:17:22,012 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-07-12 11:17:22,012 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-07-12 11:17:22,012 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-12 11:17:22,012 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-07-12 11:17:22,012 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-07-12 11:17:22,012 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-12 11:17:22,012 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-12 11:17:22,012 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-12 11:17:22,012 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-12 11:17:22,012 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-12 11:17:22,013 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-12 11:17:22,013 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-12 11:17:22,013 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-12 11:17:22,013 INFO L902 garLoopResultBuilder]: At program point aws_string_bytesENTRY(lines 6242 6246) the Hoare annotation is: true [2022-07-12 11:17:22,013 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesEXIT(lines 6242 6246) no Hoare annotation was computed. [2022-07-12 11:17:22,013 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesFINAL(lines 6242 6246) no Hoare annotation was computed. [2022-07-12 11:17:22,013 INFO L902 garLoopResultBuilder]: At program point L6244-1(line 6244) the Hoare annotation is: true [2022-07-12 11:17:22,013 INFO L899 garLoopResultBuilder]: For program point L6244-2(line 6244) no Hoare annotation was computed. [2022-07-12 11:17:22,013 INFO L902 garLoopResultBuilder]: At program point L6244(line 6244) the Hoare annotation is: true [2022-07-12 11:17:22,013 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-12 11:17:22,013 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-12 11:17:22,013 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-12 11:17:22,013 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-12 11:17:22,013 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-07-12 11:17:22,013 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-07-12 11:17:22,013 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-07-12 11:17:22,013 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-07-12 11:17:22,013 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-07-12 11:17:22,014 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-12 11:17:22,014 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-07-12 11:17:22,014 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-07-12 11:17:22,014 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-07-12 11:17:22,014 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-07-12 11:17:22,014 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-12 11:17:22,014 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-12 11:17:22,014 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-12 11:17:22,014 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-07-12 11:17:22,014 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-07-12 11:17:22,014 INFO L895 garLoopResultBuilder]: At program point L9557(line 9557) the Hoare annotation is: false [2022-07-12 11:17:22,014 INFO L895 garLoopResultBuilder]: At program point L9557-1(line 9557) the Hoare annotation is: false [2022-07-12 11:17:22,014 INFO L899 garLoopResultBuilder]: For program point L9557-2(line 9557) no Hoare annotation was computed. [2022-07-12 11:17:22,014 INFO L899 garLoopResultBuilder]: For program point L9549(lines 9549 9551) no Hoare annotation was computed. [2022-07-12 11:17:22,014 INFO L899 garLoopResultBuilder]: For program point L9553-1(lines 9537 9559) no Hoare annotation was computed. [2022-07-12 11:17:22,014 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 11:17:22,014 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 11:17:22,015 INFO L899 garLoopResultBuilder]: For program point L9537(lines 9537 9559) no Hoare annotation was computed. [2022-07-12 11:17:22,015 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 11:17:22,015 INFO L895 garLoopResultBuilder]: At program point L9554(line 9554) the Hoare annotation is: false [2022-07-12 11:17:22,015 INFO L895 garLoopResultBuilder]: At program point L9554-1(line 9554) the Hoare annotation is: false [2022-07-12 11:17:22,015 INFO L899 garLoopResultBuilder]: For program point L9554-2(line 9554) no Hoare annotation was computed. [2022-07-12 11:17:22,015 INFO L899 garLoopResultBuilder]: For program point L9542-1(lines 9542 9544) no Hoare annotation was computed. [2022-07-12 11:17:22,015 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-07-12 11:17:22,015 INFO L895 garLoopResultBuilder]: At program point L9542-2(line 9542) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| 0)) [2022-07-12 11:17:22,015 INFO L899 garLoopResultBuilder]: For program point L9542-3(lines 9542 9543) no Hoare annotation was computed. [2022-07-12 11:17:22,015 INFO L902 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: true [2022-07-12 11:17:22,015 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-07-12 11:17:22,015 INFO L895 garLoopResultBuilder]: At program point L9542(line 9542) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| 0)) [2022-07-12 11:17:22,015 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-07-12 11:17:22,015 INFO L899 garLoopResultBuilder]: For program point L9538-5(lines 9538 9539) no Hoare annotation was computed. [2022-07-12 11:17:22,015 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 11:17:22,015 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-07-12 11:17:22,015 INFO L899 garLoopResultBuilder]: For program point L9538-1(lines 9538 9539) no Hoare annotation was computed. [2022-07-12 11:17:22,015 INFO L899 garLoopResultBuilder]: For program point L9542-5(lines 9542 9543) no Hoare annotation was computed. [2022-07-12 11:17:22,016 INFO L902 garLoopResultBuilder]: At program point L9538-2(line 9538) the Hoare annotation is: true [2022-07-12 11:17:22,016 INFO L899 garLoopResultBuilder]: For program point L9538-3(line 9538) no Hoare annotation was computed. [2022-07-12 11:17:22,016 INFO L899 garLoopResultBuilder]: For program point L9542-7(lines 9542 9544) no Hoare annotation was computed. [2022-07-12 11:17:22,016 INFO L895 garLoopResultBuilder]: At program point L9547(line 9547) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_compare_harness_~str_b~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| |ULTIMATE.start_aws_string_compare_harness_~str_b~1#1.offset|) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| 0)) [2022-07-12 11:17:22,016 INFO L899 garLoopResultBuilder]: For program point L9547-1(line 9547) no Hoare annotation was computed. [2022-07-12 11:17:22,016 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-07-12 11:17:22,016 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-07-12 11:17:22,016 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-07-12 11:17:22,016 INFO L902 garLoopResultBuilder]: At program point L9560(line 9560) the Hoare annotation is: true [2022-07-12 11:17:22,016 INFO L899 garLoopResultBuilder]: For program point L9548(line 9548) no Hoare annotation was computed. [2022-07-12 11:17:22,016 INFO L895 garLoopResultBuilder]: At program point L9548-2(line 9548) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_compare_harness_#t~ite1355#1.base| |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base|) (= |ULTIMATE.start_aws_string_compare_harness_~str_b~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| |ULTIMATE.start_aws_string_compare_harness_#t~ite1355#1.offset|) (= |ULTIMATE.start_aws_string_compare_harness_~str_b~1#1.offset| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| 0)) [2022-07-12 11:17:22,016 INFO L899 garLoopResultBuilder]: For program point L9548-3(line 9548) no Hoare annotation was computed. [2022-07-12 11:17:22,016 INFO L895 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| 0)) [2022-07-12 11:17:22,016 INFO L899 garLoopResultBuilder]: For program point L9548-4(lines 9548 9552) no Hoare annotation was computed. [2022-07-12 11:17:22,016 INFO L899 garLoopResultBuilder]: For program point L9544-1(line 9544) no Hoare annotation was computed. [2022-07-12 11:17:22,016 INFO L899 garLoopResultBuilder]: For program point L9548-5(lines 9537 9559) no Hoare annotation was computed. [2022-07-12 11:17:22,017 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-12 11:17:22,017 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-12 11:17:22,017 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-12 11:17:22,017 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-12 11:17:22,017 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-12 11:17:22,017 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-12 11:17:22,017 INFO L902 garLoopResultBuilder]: At program point aws_string_compareENTRY(lines 9218 9252) the Hoare annotation is: true [2022-07-12 11:17:22,017 INFO L899 garLoopResultBuilder]: For program point L9239-2(line 9239) no Hoare annotation was computed. [2022-07-12 11:17:22,017 INFO L895 garLoopResultBuilder]: At program point L9239(line 9239) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|))) [2022-07-12 11:17:22,017 INFO L895 garLoopResultBuilder]: At program point L9239-1(line 9239) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|))) [2022-07-12 11:17:22,017 INFO L899 garLoopResultBuilder]: For program point L9219(line 9219) no Hoare annotation was computed. [2022-07-12 11:17:22,017 INFO L895 garLoopResultBuilder]: At program point L9219-2(line 9219) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)) (and (= aws_string_compare_~a.offset aws_string_compare_~b.offset) (= aws_string_compare_~a.base aws_string_compare_~b.base))) [2022-07-12 11:17:22,017 INFO L899 garLoopResultBuilder]: For program point L9219-3(line 9219) no Hoare annotation was computed. [2022-07-12 11:17:22,017 INFO L899 garLoopResultBuilder]: For program point L9248(lines 9248 9250) no Hoare annotation was computed. [2022-07-12 11:17:22,017 INFO L895 garLoopResultBuilder]: At program point L9219-4(line 9219) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)) (and (= aws_string_compare_~a.offset aws_string_compare_~b.offset) (= aws_string_compare_~a.base aws_string_compare_~b.base))) [2022-07-12 11:17:22,017 INFO L899 garLoopResultBuilder]: For program point L9219-5(line 9219) no Hoare annotation was computed. [2022-07-12 11:17:22,018 INFO L895 garLoopResultBuilder]: At program point L9240(line 9240) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|))) [2022-07-12 11:17:22,018 INFO L895 garLoopResultBuilder]: At program point L9240-1(line 9240) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|))) [2022-07-12 11:17:22,018 INFO L899 garLoopResultBuilder]: For program point L9240-2(line 9240) no Hoare annotation was computed. [2022-07-12 11:17:22,018 INFO L899 garLoopResultBuilder]: For program point L9220(line 9220) no Hoare annotation was computed. [2022-07-12 11:17:22,018 INFO L895 garLoopResultBuilder]: At program point L9220-2(line 9220) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)) (and (= aws_string_compare_~a.offset aws_string_compare_~b.offset) (= aws_string_compare_~a.base aws_string_compare_~b.base))) [2022-07-12 11:17:22,018 INFO L899 garLoopResultBuilder]: For program point L9224(lines 9224 9228) no Hoare annotation was computed. [2022-07-12 11:17:22,018 INFO L899 garLoopResultBuilder]: For program point L9245(lines 9245 9247) no Hoare annotation was computed. [2022-07-12 11:17:22,018 INFO L899 garLoopResultBuilder]: For program point L9220-3(line 9220) no Hoare annotation was computed. [2022-07-12 11:17:22,018 INFO L895 garLoopResultBuilder]: At program point L9220-4(line 9220) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)) (and (= aws_string_compare_~a.offset aws_string_compare_~b.offset) (= aws_string_compare_~a.base aws_string_compare_~b.base))) [2022-07-12 11:17:22,018 INFO L899 garLoopResultBuilder]: For program point L9220-5(line 9220) no Hoare annotation was computed. [2022-07-12 11:17:22,018 INFO L899 garLoopResultBuilder]: For program point L9237(line 9237) no Hoare annotation was computed. [2022-07-12 11:17:22,018 INFO L899 garLoopResultBuilder]: For program point L9237-2(line 9237) no Hoare annotation was computed. [2022-07-12 11:17:22,018 INFO L895 garLoopResultBuilder]: At program point L9241(line 9241) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|))) [2022-07-12 11:17:22,018 INFO L895 garLoopResultBuilder]: At program point L9241-1(line 9241) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|))) [2022-07-12 11:17:22,018 INFO L899 garLoopResultBuilder]: For program point L9241-2(line 9241) no Hoare annotation was computed. [2022-07-12 11:17:22,018 INFO L899 garLoopResultBuilder]: For program point L9229(lines 9229 9233) no Hoare annotation was computed. [2022-07-12 11:17:22,018 INFO L899 garLoopResultBuilder]: For program point L9221(lines 9221 9223) no Hoare annotation was computed. [2022-07-12 11:17:22,018 INFO L899 garLoopResultBuilder]: For program point L9242(lines 9242 9244) no Hoare annotation was computed. [2022-07-12 11:17:22,019 INFO L899 garLoopResultBuilder]: For program point aws_string_compareEXIT(lines 9218 9252) no Hoare annotation was computed. [2022-07-12 11:17:22,019 INFO L899 garLoopResultBuilder]: For program point aws_string_compareFINAL(lines 9218 9252) no Hoare annotation was computed. [2022-07-12 11:17:22,021 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:17:22,022 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 11:17:22,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 11:17:22 BoogieIcfgContainer [2022-07-12 11:17:22,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 11:17:22,045 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 11:17:22,045 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 11:17:22,045 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 11:17:22,045 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:17:11" (3/4) ... [2022-07-12 11:17:22,047 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 11:17:22,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-07-12 11:17:22,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-12 11:17:22,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-12 11:17:22,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-12 11:17:22,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_bytes [2022-07-12 11:17:22,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-12 11:17:22,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-12 11:17:22,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_compare [2022-07-12 11:17:22,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-12 11:17:22,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-07-12 11:17:22,062 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 125 nodes and edges [2022-07-12 11:17:22,063 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2022-07-12 11:17:22,064 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2022-07-12 11:17:22,064 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-12 11:17:22,065 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-12 11:17:22,066 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-12 11:17:22,066 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 11:17:22,067 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 11:17:22,087 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(max_size) == max_size && str == 0) && len % 18446744073709551616 < \old(max_size) % 18446744073709551616) && !(\old(max_size) == 16)) && (((0 < (\old(max_size) % 18446744073709551616 + -18446744073709551609) / 18446744073709551616 + 1 && 0 == unknown-#memory_int-unknown[\result][\result + 8]) || (unknown-#memory_int-unknown[\result][\result + -18446744073709551600 + unknown-#memory_int-unknown[\result][\result + 8] % 18446744073709551616] == 0 && (18446744073709551615 + -1 * unknown-#memory_int-unknown[\result][\result + 8]) / -18446744073709551616 + (-1 + \old(max_size) % 18446744073709551616 + -1 * unknown-#memory_int-unknown[\result][\result + 8]) / -18446744073709551616 < (-9223372036854775808 + unknown-#memory_int-unknown[\result][\result + 8]) / 18446744073709551616 + unknown-#memory_int-unknown[\result][\result + 8] / 18446744073709551616 + 1)) || (((-1 + \old(max_size) % 18446744073709551616 + -1 * unknown-#memory_int-unknown[\result][\result + 8]) / -18446744073709551616 < unknown-#memory_int-unknown[\result][\result + 8] / 18446744073709551616 + 1 && unknown-#memory_int-unknown[\result][\result + 8] % 18446744073709551616 <= 9223372036854775807) && unknown-#memory_int-unknown[\result][\result + 16 + unknown-#memory_int-unknown[\result][\result + 8] % 18446744073709551616] == 0))) && \result == 0) && len % 18446744073709551616 < \old(max_size) % 18446744073709551616 [2022-07-12 11:17:22,388 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 11:17:22,388 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 11:17:22,388 INFO L158 Benchmark]: Toolchain (without parser) took 13697.55ms. Allocated memory was 119.5MB in the beginning and 354.4MB in the end (delta: 234.9MB). Free memory was 96.2MB in the beginning and 191.7MB in the end (delta: -95.5MB). Peak memory consumption was 269.1MB. Max. memory is 16.1GB. [2022-07-12 11:17:22,389 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 90.2MB. Free memory was 58.4MB in the beginning and 58.4MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:17:22,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1710.89ms. Allocated memory was 119.5MB in the beginning and 159.4MB in the end (delta: 39.8MB). Free memory was 96.2MB in the beginning and 70.3MB in the end (delta: 25.9MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2022-07-12 11:17:22,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 151.74ms. Allocated memory is still 159.4MB. Free memory was 70.3MB in the beginning and 101.2MB in the end (delta: -30.9MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2022-07-12 11:17:22,389 INFO L158 Benchmark]: Boogie Preprocessor took 62.76ms. Allocated memory is still 159.4MB. Free memory was 101.2MB in the beginning and 94.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 11:17:22,389 INFO L158 Benchmark]: RCFGBuilder took 941.19ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 94.9MB in the beginning and 149.4MB in the end (delta: -54.5MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2022-07-12 11:17:22,390 INFO L158 Benchmark]: TraceAbstraction took 10480.63ms. Allocated memory was 207.6MB in the beginning and 354.4MB in the end (delta: 146.8MB). Free memory was 148.3MB in the beginning and 113.0MB in the end (delta: 35.3MB). Peak memory consumption was 181.1MB. Max. memory is 16.1GB. [2022-07-12 11:17:22,390 INFO L158 Benchmark]: Witness Printer took 343.21ms. Allocated memory is still 354.4MB. Free memory was 113.0MB in the beginning and 191.7MB in the end (delta: -78.7MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2022-07-12 11:17:22,391 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.13ms. Allocated memory is still 90.2MB. Free memory was 58.4MB in the beginning and 58.4MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1710.89ms. Allocated memory was 119.5MB in the beginning and 159.4MB in the end (delta: 39.8MB). Free memory was 96.2MB in the beginning and 70.3MB in the end (delta: 25.9MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 151.74ms. Allocated memory is still 159.4MB. Free memory was 70.3MB in the beginning and 101.2MB in the end (delta: -30.9MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.76ms. Allocated memory is still 159.4MB. Free memory was 101.2MB in the beginning and 94.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 941.19ms. Allocated memory was 159.4MB in the beginning and 207.6MB in the end (delta: 48.2MB). Free memory was 94.9MB in the beginning and 149.4MB in the end (delta: -54.5MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10480.63ms. Allocated memory was 207.6MB in the beginning and 354.4MB in the end (delta: 146.8MB). Free memory was 148.3MB in the beginning and 113.0MB in the end (delta: 35.3MB). Peak memory consumption was 181.1MB. Max. memory is 16.1GB. * Witness Printer took 343.21ms. Allocated memory is still 354.4MB. Free memory was 113.0MB in the beginning and 191.7MB in the end (delta: -78.7MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 4259 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 205 IncrementalHoareTripleChecker+Unchecked, 3209 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2844 IncrementalHoareTripleChecker+Invalid, 3181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 1050 mSDtfsCounter, 2844 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 409 GetRequests, 306 SyntacticMatches, 5 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=4, InterpolantAutomatonStates: 59, 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, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 247 PreInvPairs, 266 NumberOfFragments, 538 HoareAnnotationTreeSize, 247 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 45 FomulaSimplificationsInter, 71 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 661 NumberOfCodeBlocks, 661 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 741 ConstructedInterpolants, 28 QuantifiedInterpolants, 5665 SizeOfPredicates, 24 NumberOfNonLiveVariables, 2584 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 344/374 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: (((((\old(max_size) == max_size && str == 0) && len % 18446744073709551616 < \old(max_size) % 18446744073709551616) && !(\old(max_size) == 16)) && (((0 < (\old(max_size) % 18446744073709551616 + -18446744073709551609) / 18446744073709551616 + 1 && 0 == unknown-#memory_int-unknown[\result][\result + 8]) || (unknown-#memory_int-unknown[\result][\result + -18446744073709551600 + unknown-#memory_int-unknown[\result][\result + 8] % 18446744073709551616] == 0 && (18446744073709551615 + -1 * unknown-#memory_int-unknown[\result][\result + 8]) / -18446744073709551616 + (-1 + \old(max_size) % 18446744073709551616 + -1 * unknown-#memory_int-unknown[\result][\result + 8]) / -18446744073709551616 < (-9223372036854775808 + unknown-#memory_int-unknown[\result][\result + 8]) / 18446744073709551616 + unknown-#memory_int-unknown[\result][\result + 8] / 18446744073709551616 + 1)) || (((-1 + \old(max_size) % 18446744073709551616 + -1 * unknown-#memory_int-unknown[\result][\result + 8]) / -18446744073709551616 < unknown-#memory_int-unknown[\result][\result + 8] / 18446744073709551616 + 1 && unknown-#memory_int-unknown[\result][\result + 8] % 18446744073709551616 <= 9223372036854775807) && unknown-#memory_int-unknown[\result][\result + 16 + unknown-#memory_int-unknown[\result][\result + 8] % 18446744073709551616] == 0))) && \result == 0) && len % 18446744073709551616 < \old(max_size) % 18446744073709551616 - InvariantResult [Line: 9560]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-12 11:17:22,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE