./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_destroy_secure_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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_destroy_secure_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 bc5ed5fb850d9a2c9d9a14514ffc7939afe81a277edfb59aefd3c5f66024eda8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:57:54,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:57:54,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:57:54,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:57:54,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:57:54,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:57:54,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:57:54,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:57:54,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:57:54,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:57:54,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:57:54,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:57:54,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:57:54,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:57:54,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:57:54,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:57:54,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:57:54,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:57:54,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:57:54,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:57:54,203 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:57:54,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:57:54,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:57:54,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:57:54,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:57:54,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:57:54,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:57:54,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:57:54,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:57:54,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:57:54,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:57:54,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:57:54,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:57:54,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:57:54,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:57:54,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:57:54,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:57:54,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:57:54,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:57:54,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:57:54,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:57:54,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:57:54,227 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:57:54,263 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:57:54,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:57:54,264 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:57:54,264 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:57:54,265 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:57:54,265 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:57:54,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:57:54,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:57:54,266 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:57:54,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:57:54,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:57:54,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:57:54,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:57:54,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:57:54,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:57:54,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:57:54,268 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:57:54,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:57:54,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:57:54,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:57:54,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:57:54,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:57:54,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:57:54,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:57:54,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:57:54,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:57:54,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:57:54,271 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:57:54,271 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:57:54,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:57:54,272 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 -> bc5ed5fb850d9a2c9d9a14514ffc7939afe81a277edfb59aefd3c5f66024eda8 [2022-07-13 22:57:54,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:57:54,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:57:54,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:57:54,544 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:57:54,544 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:57:54,546 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_destroy_secure_harness.i [2022-07-13 22:57:54,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eea5f0f9c/91eb59166c0f4f708edeb42bd2fa8e98/FLAG3eb93d177 [2022-07-13 22:57:55,324 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:57:55,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_destroy_secure_harness.i [2022-07-13 22:57:55,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eea5f0f9c/91eb59166c0f4f708edeb42bd2fa8e98/FLAG3eb93d177 [2022-07-13 22:57:55,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eea5f0f9c/91eb59166c0f4f708edeb42bd2fa8e98 [2022-07-13 22:57:55,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:57:55,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:57:55,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:57:55,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:57:55,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:57:55,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:57:55" (1/1) ... [2022-07-13 22:57:55,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@429dd762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:55, skipping insertion in model container [2022-07-13 22:57:55,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:57:55" (1/1) ... [2022-07-13 22:57:55,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:57:55,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:57:55,769 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_destroy_secure_harness.i[4499,4512] [2022-07-13 22:57:55,777 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_destroy_secure_harness.i[4559,4572] [2022-07-13 22:57:56,573 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:56,574 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:56,574 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:56,575 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:56,576 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:56,587 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:56,588 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:56,590 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:56,590 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:56,901 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:57:56,902 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:57:56,903 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:57:56,904 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:57:56,905 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:57:56,906 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:57:56,907 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:57:56,907 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:57:56,908 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:57:56,908 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:57:57,035 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:57:57,121 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:57,121 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:57,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:57:57,339 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:57:57,352 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_destroy_secure_harness.i[4499,4512] [2022-07-13 22:57:57,353 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_destroy_secure_harness.i[4559,4572] [2022-07-13 22:57:57,399 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:57,403 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:57,405 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:57,406 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:57,406 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:57,412 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:57,414 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:57,415 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:57,415 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:57,458 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:57:57,459 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:57:57,460 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:57:57,461 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:57:57,462 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:57:57,463 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:57:57,463 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:57:57,464 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:57:57,464 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:57:57,464 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:57:57,487 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:57:57,560 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:57,561 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:57:57,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:57:57,816 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:57:57,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:57 WrapperNode [2022-07-13 22:57:57,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:57:57,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:57:57,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:57:57,819 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:57:57,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:57" (1/1) ... [2022-07-13 22:57:57,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:57" (1/1) ... [2022-07-13 22:57:58,077 INFO L137 Inliner]: procedures = 693, calls = 2772, calls flagged for inlining = 60, calls inlined = 8, statements flattened = 812 [2022-07-13 22:57:58,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:57:58,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:57:58,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:57:58,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:57:58,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:57" (1/1) ... [2022-07-13 22:57:58,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:57" (1/1) ... [2022-07-13 22:57:58,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:57" (1/1) ... [2022-07-13 22:57:58,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:57" (1/1) ... [2022-07-13 22:57:58,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:57" (1/1) ... [2022-07-13 22:57:58,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:57" (1/1) ... [2022-07-13 22:57:58,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:57" (1/1) ... [2022-07-13 22:57:58,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:57:58,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:57:58,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:57:58,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:57:58,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:57" (1/1) ... [2022-07-13 22:57:58,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:57:58,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:57:58,229 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-13 22:57:58,252 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-13 22:57:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-13 22:57:58,278 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-13 22:57:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-07-13 22:57:58,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-07-13 22:57:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:57:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:57:58,279 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:57:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:57:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:57:58,280 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:57:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:57:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:57:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:57:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:57:58,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:57:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:57:58,283 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:57:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 22:57:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure aws_secure_zero [2022-07-13 22:57:58,283 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_secure_zero [2022-07-13 22:57:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2022-07-13 22:57:58,284 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2022-07-13 22:57:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-13 22:57:58,284 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-13 22:57:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_bytes [2022-07-13 22:57:58,284 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_bytes [2022-07-13 22:57:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:57:58,285 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:57:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:57:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:57:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-13 22:57:58,286 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-13 22:57:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-13 22:57:58,287 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-13 22:57:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:57:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:57:58,561 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:57:58,563 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:57:59,677 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:57:59,684 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:57:59,685 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 22:57:59,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:57:59 BoogieIcfgContainer [2022-07-13 22:57:59,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:57:59,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:57:59,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:57:59,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:57:59,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:57:55" (1/3) ... [2022-07-13 22:57:59,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95d1faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:57:59, skipping insertion in model container [2022-07-13 22:57:59,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:57" (2/3) ... [2022-07-13 22:57:59,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95d1faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:57:59, skipping insertion in model container [2022-07-13 22:57:59,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:57:59" (3/3) ... [2022-07-13 22:57:59,702 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_destroy_secure_harness.i [2022-07-13 22:57:59,715 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:57:59,715 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:57:59,777 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:57:59,783 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@33d6ce78, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3959aef2 [2022-07-13 22:57:59,784 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:57:59,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 70 states have (on average 1.2) internal successors, (84), 71 states have internal predecessors, (84), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-13 22:57:59,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 22:57:59,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:57:59,803 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1] [2022-07-13 22:57:59,804 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:57:59,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:57:59,811 INFO L85 PathProgramCache]: Analyzing trace with hash 513295118, now seen corresponding path program 1 times [2022-07-13 22:57:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:57:59,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454507823] [2022-07-13 22:57:59,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:57:59,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:00,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:00,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:00,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:00,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:00,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:00,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:58:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:00,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:58:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:00,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:58:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 22:58:00,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:00,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454507823] [2022-07-13 22:58:00,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454507823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:00,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:00,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 22:58:00,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603316724] [2022-07-13 22:58:00,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:00,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:58:00,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:00,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:58:00,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:58:00,610 INFO L87 Difference]: Start difference. First operand has 104 states, 70 states have (on average 1.2) internal successors, (84), 71 states have internal predecessors, (84), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 22:58:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:00,891 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2022-07-13 22:58:00,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 22:58:00,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2022-07-13 22:58:00,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:00,901 INFO L225 Difference]: With dead ends: 209 [2022-07-13 22:58:00,901 INFO L226 Difference]: Without dead ends: 103 [2022-07-13 22:58:00,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:58:00,907 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 85 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:00,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 150 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:58:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-13 22:58:00,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2022-07-13 22:58:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 63 states have internal predecessors, (72), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-07-13 22:58:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2022-07-13 22:58:00,961 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 65 [2022-07-13 22:58:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:00,963 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2022-07-13 22:58:00,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 22:58:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2022-07-13 22:58:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 22:58:00,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:00,966 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1] [2022-07-13 22:58:00,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:58:00,967 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:00,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:00,968 INFO L85 PathProgramCache]: Analyzing trace with hash 702801866, now seen corresponding path program 1 times [2022-07-13 22:58:00,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:00,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643947747] [2022-07-13 22:58:00,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:00,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:58:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:58:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:58:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 22:58:01,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:01,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643947747] [2022-07-13 22:58:01,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643947747] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:01,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787499894] [2022-07-13 22:58:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:01,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:01,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:01,790 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-13 22:58:01,791 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-13 22:58:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:02,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 2546 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 22:58:02,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 22:58:02,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:02,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787499894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:02,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:02,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 22 [2022-07-13 22:58:02,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642908705] [2022-07-13 22:58:02,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:02,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:58:02,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:02,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:58:02,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:58:02,490 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 22:58:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:02,721 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2022-07-13 22:58:02,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:58:02,722 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 65 [2022-07-13 22:58:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:02,727 INFO L225 Difference]: With dead ends: 136 [2022-07-13 22:58:02,727 INFO L226 Difference]: Without dead ends: 117 [2022-07-13 22:58:02,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2022-07-13 22:58:02,734 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 54 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:02,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1130 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:58:02,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-13 22:58:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2022-07-13 22:58:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 68 states have internal predecessors, (78), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-13 22:58:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2022-07-13 22:58:02,753 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 65 [2022-07-13 22:58:02,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:02,753 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2022-07-13 22:58:02,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 22:58:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2022-07-13 22:58:02,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 22:58:02,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:02,756 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1] [2022-07-13 22:58:02,786 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-13 22:58:02,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:02,984 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:02,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:02,984 INFO L85 PathProgramCache]: Analyzing trace with hash 193328776, now seen corresponding path program 1 times [2022-07-13 22:58:02,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:02,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268304880] [2022-07-13 22:58:02,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:02,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:58:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:58:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:58:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,272 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 22:58:03,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:03,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268304880] [2022-07-13 22:58:03,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268304880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:03,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:03,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:58:03,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264156298] [2022-07-13 22:58:03,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:03,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:58:03,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:03,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:58:03,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:58:03,275 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 22:58:03,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:03,480 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2022-07-13 22:58:03,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:58:03,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 65 [2022-07-13 22:58:03,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:03,482 INFO L225 Difference]: With dead ends: 136 [2022-07-13 22:58:03,482 INFO L226 Difference]: Without dead ends: 103 [2022-07-13 22:58:03,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:58:03,483 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 89 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:03,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 194 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:58:03,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-13 22:58:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2022-07-13 22:58:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-07-13 22:58:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2022-07-13 22:58:03,494 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 65 [2022-07-13 22:58:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:03,494 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2022-07-13 22:58:03,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 22:58:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2022-07-13 22:58:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 22:58:03,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:03,496 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 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-13 22:58:03,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 22:58:03,496 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:03,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:03,497 INFO L85 PathProgramCache]: Analyzing trace with hash -216705520, now seen corresponding path program 1 times [2022-07-13 22:58:03,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:03,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832228931] [2022-07-13 22:58:03,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:03,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:58:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:58:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 22:58:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:58:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:58:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,143 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-13 22:58:04,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:04,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832228931] [2022-07-13 22:58:04,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832228931] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:04,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409110162] [2022-07-13 22:58:04,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:04,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:04,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:04,146 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:04,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 22:58:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 2658 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 22:58:04,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:04,723 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 22:58:04,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:04,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409110162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:04,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:04,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [18] total 20 [2022-07-13 22:58:04,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302379507] [2022-07-13 22:58:04,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:04,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:58:04,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:04,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:58:04,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:58:04,726 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 22:58:04,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:04,777 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2022-07-13 22:58:04,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:58:04,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 96 [2022-07-13 22:58:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:04,779 INFO L225 Difference]: With dead ends: 154 [2022-07-13 22:58:04,779 INFO L226 Difference]: Without dead ends: 95 [2022-07-13 22:58:04,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:58:04,781 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 301 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-13 22:58:04,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 301 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:58:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-13 22:58:04,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-07-13 22:58:04,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 63 states have internal predecessors, (69), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-07-13 22:58:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-07-13 22:58:04,789 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 96 [2022-07-13 22:58:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:04,790 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-07-13 22:58:04,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 22:58:04,790 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-07-13 22:58:04,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-13 22:58:04,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:04,792 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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, 1, 1, 1, 1, 1, 1, 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-13 22:58:04,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:05,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 22:58:05,020 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:05,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:05,020 INFO L85 PathProgramCache]: Analyzing trace with hash 91273307, now seen corresponding path program 1 times [2022-07-13 22:58:05,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:05,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165790717] [2022-07-13 22:58:05,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:05,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:58:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:58:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:58:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 22:58:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:58:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-13 22:58:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-13 22:58:05,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:05,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165790717] [2022-07-13 22:58:05,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165790717] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:05,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239278023] [2022-07-13 22:58:05,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:05,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:05,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:05,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:05,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 22:58:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 2686 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-13 22:58:06,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:06,422 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 15 treesize of output 7 [2022-07-13 22:58:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-13 22:58:06,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:06,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239278023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:06,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:06,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [14] total 30 [2022-07-13 22:58:06,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440788992] [2022-07-13 22:58:06,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:06,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 22:58:06,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:06,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 22:58:06,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=807, Unknown=0, NotChecked=0, Total=870 [2022-07-13 22:58:06,651 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 18 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-13 22:58:07,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:07,144 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2022-07-13 22:58:07,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 22:58:07,146 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) Word has length 105 [2022-07-13 22:58:07,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:07,146 INFO L225 Difference]: With dead ends: 124 [2022-07-13 22:58:07,147 INFO L226 Difference]: Without dead ends: 96 [2022-07-13 22:58:07,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=1375, Unknown=0, NotChecked=0, Total=1482 [2022-07-13 22:58:07,148 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 30 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:07,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1488 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:58:07,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-13 22:58:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-13 22:58:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 64 states have (on average 1.09375) internal successors, (70), 64 states have internal predecessors, (70), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-07-13 22:58:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2022-07-13 22:58:07,157 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 105 [2022-07-13 22:58:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:07,157 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2022-07-13 22:58:07,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-13 22:58:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2022-07-13 22:58:07,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 22:58:07,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:07,164 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-13 22:58:07,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:07,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:07,365 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:07,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:07,366 INFO L85 PathProgramCache]: Analyzing trace with hash 469333189, now seen corresponding path program 1 times [2022-07-13 22:58:07,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:07,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775915080] [2022-07-13 22:58:07,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:07,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:58:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:58:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 22:58:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 22:58:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:58:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:58:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 22:58:07,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:07,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775915080] [2022-07-13 22:58:07,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775915080] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:07,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941638309] [2022-07-13 22:58:07,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:07,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:07,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:07,946 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:58:07,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 22:58:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 2705 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-13 22:58:08,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:08,824 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-13 22:58:08,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:58:08,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:58:08,849 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-13 22:58:08,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 125 [2022-07-13 22:58:09,067 INFO L356 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2022-07-13 22:58:09,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 59 [2022-07-13 22:58:09,090 INFO L356 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2022-07-13 22:58:09,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 76 [2022-07-13 22:58:12,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:58:12,793 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 22:58:12,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 32 [2022-07-13 22:58:12,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-13 22:58:14,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:58:14,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:58:14,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:58:14,028 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:58:14,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 31 [2022-07-13 22:58:14,197 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 22:58:14,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:58:15,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941638309] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:15,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:58:15,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 51] total 62 [2022-07-13 22:58:15,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450881676] [2022-07-13 22:58:15,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:58:15,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-07-13 22:58:15,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:15,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-07-13 22:58:15,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4212, Unknown=0, NotChecked=0, Total=4422 [2022-07-13 22:58:15,264 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 62 states, 53 states have (on average 2.30188679245283) internal successors, (122), 46 states have internal predecessors, (122), 18 states have call successors, (32), 9 states have call predecessors, (32), 16 states have return successors, (30), 20 states have call predecessors, (30), 17 states have call successors, (30) [2022-07-13 22:58:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:16,214 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2022-07-13 22:58:16,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 22:58:16,215 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 53 states have (on average 2.30188679245283) internal successors, (122), 46 states have internal predecessors, (122), 18 states have call successors, (32), 9 states have call predecessors, (32), 16 states have return successors, (30), 20 states have call predecessors, (30), 17 states have call successors, (30) Word has length 106 [2022-07-13 22:58:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:16,215 INFO L225 Difference]: With dead ends: 103 [2022-07-13 22:58:16,216 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 22:58:16,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=323, Invalid=5839, Unknown=0, NotChecked=0, Total=6162 [2022-07-13 22:58:16,219 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 64 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:16,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 270 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 600 Invalid, 0 Unknown, 89 Unchecked, 0.5s Time] [2022-07-13 22:58:16,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 22:58:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 22:58:16,220 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-13 22:58:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 22:58:16,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2022-07-13 22:58:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:16,221 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 22:58:16,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 53 states have (on average 2.30188679245283) internal successors, (122), 46 states have internal predecessors, (122), 18 states have call successors, (32), 9 states have call predecessors, (32), 16 states have return successors, (30), 20 states have call predecessors, (30), 17 states have call successors, (30) [2022-07-13 22:58:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 22:58:16,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 22:58:16,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 22:58:16,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 22:58:16,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:16,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 22:58:16,625 INFO L895 garLoopResultBuilder]: At program point L8735(line 8735) the Hoare annotation is: (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2022-07-13 22:58:16,625 INFO L899 garLoopResultBuilder]: For program point L8735-1(line 8735) no Hoare annotation was computed. [2022-07-13 22:58:16,625 INFO L899 garLoopResultBuilder]: For program point aws_secure_zeroEXIT(lines 8734 8751) no Hoare annotation was computed. [2022-07-13 22:58:16,625 INFO L895 garLoopResultBuilder]: At program point aws_secure_zeroENTRY(lines 8734 8751) the Hoare annotation is: (and (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2022-07-13 22:58:16,625 INFO L899 garLoopResultBuilder]: For program point aws_secure_zeroFINAL(lines 8734 8751) no Hoare annotation was computed. [2022-07-13 22:58:16,625 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|) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |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_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (= |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) (or (< (div (+ .cse0 (- 18446744073709551609)) (- 18446744073709551616)) 1) (let ((.cse1 (select (select |#memory_int| |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base|) (+ |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 8)))) (< (div (+ (- 1) .cse0 (* (- 1) .cse1)) (- 18446744073709551616)) (+ (div .cse1 18446744073709551616) 1)))))) [2022-07-13 22:58:16,625 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-07-13 22:58:16,625 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 (= |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)|) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (= |#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)|) (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-13 22:58:16,626 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-07-13 22:58:16,626 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-13 22:58:16,626 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-07-13 22:58:16,626 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 (= |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)|) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (= |#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)|) (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-13 22:58:16,626 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-07-13 22:58:16,626 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-13 22:58:16,626 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-13 22:58:16,626 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-07-13 22:58:16,626 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-07-13 22:58:16,627 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-13 22:58:16,627 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-07-13 22:58:16,627 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-07-13 22:58:16,627 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-13 22:58:16,627 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-13 22:58:16,627 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-13 22:58:16,627 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-13 22:58:16,627 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-13 22:58:16,627 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2022-07-13 22:58:16,627 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2022-07-13 22:58:16,627 INFO L902 garLoopResultBuilder]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2022-07-13 22:58:16,628 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2022-07-13 22:58:16,628 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-13 22:58:16,628 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-13 22:58:16,628 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-13 22:58:16,628 INFO L899 garLoopResultBuilder]: For program point L7069-2(lines 7061 7074) no Hoare annotation was computed. [2022-07-13 22:58:16,628 INFO L899 garLoopResultBuilder]: For program point aws_mem_releaseEXIT(lines 7061 7074) no Hoare annotation was computed. [2022-07-13 22:58:16,628 INFO L899 garLoopResultBuilder]: For program point L7069(lines 7069 7073) no Hoare annotation was computed. [2022-07-13 22:58:16,628 INFO L895 garLoopResultBuilder]: At program point L7062(lines 7062 7064) the Hoare annotation is: (= |old(#valid)| |#valid|) [2022-07-13 22:58:16,628 INFO L895 garLoopResultBuilder]: At program point aws_mem_releaseENTRY(lines 7061 7074) the Hoare annotation is: (= |old(#valid)| |#valid|) [2022-07-13 22:58:16,628 INFO L899 garLoopResultBuilder]: For program point L7065-1(lines 7065 7067) no Hoare annotation was computed. [2022-07-13 22:58:16,628 INFO L895 garLoopResultBuilder]: At program point L7065(lines 7065 7067) the Hoare annotation is: (= |old(#valid)| |#valid|) [2022-07-13 22:58:16,628 INFO L899 garLoopResultBuilder]: For program point L7062-1(lines 7062 7064) no Hoare annotation was computed. [2022-07-13 22:58:16,629 INFO L902 garLoopResultBuilder]: At program point aws_string_bytesENTRY(lines 6242 6246) the Hoare annotation is: true [2022-07-13 22:58:16,629 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesEXIT(lines 6242 6246) no Hoare annotation was computed. [2022-07-13 22:58:16,629 INFO L899 garLoopResultBuilder]: For program point aws_string_bytesFINAL(lines 6242 6246) no Hoare annotation was computed. [2022-07-13 22:58:16,629 INFO L902 garLoopResultBuilder]: At program point L6244-1(line 6244) the Hoare annotation is: true [2022-07-13 22:58:16,629 INFO L899 garLoopResultBuilder]: For program point L6244-2(line 6244) no Hoare annotation was computed. [2022-07-13 22:58:16,629 INFO L902 garLoopResultBuilder]: At program point L6244(line 6244) the Hoare annotation is: true [2022-07-13 22:58:16,629 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-13 22:58:16,629 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-13 22:58:16,629 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-13 22:58:16,629 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-13 22:58:16,629 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-07-13 22:58:16,630 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-07-13 22:58:16,630 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-07-13 22:58:16,630 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-07-13 22:58:16,630 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-07-13 22:58:16,630 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-13 22:58:16,630 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-07-13 22:58:16,630 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-07-13 22:58:16,630 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-07-13 22:58:16,630 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-07-13 22:58:16,630 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-13 22:58:16,630 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-13 22:58:16,630 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-13 22:58:16,631 INFO L899 garLoopResultBuilder]: For program point L9210(lines 9210 9215) no Hoare annotation was computed. [2022-07-13 22:58:16,631 INFO L899 garLoopResultBuilder]: For program point L9549(lines 9549 9551) no Hoare annotation was computed. [2022-07-13 22:58:16,631 INFO L902 garLoopResultBuilder]: At program point L9553(line 9553) the Hoare annotation is: true [2022-07-13 22:58:16,631 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 22:58:16,635 INFO L895 garLoopResultBuilder]: At program point L9211(line 9211) the Hoare annotation is: (and (= (* 256 (div |ULTIMATE.start_aws_string_destroy_secure_harness_~nondet_parameter~0#1| 256)) |ULTIMATE.start_aws_string_destroy_secure_harness_~nondet_parameter~0#1|) (not (= |ULTIMATE.start_aws_string_destroy_secure_harness_~str~3#1.base| 0))) [2022-07-13 22:58:16,635 INFO L899 garLoopResultBuilder]: For program point L9211-1(line 9211) no Hoare annotation was computed. [2022-07-13 22:58:16,635 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 22:58:16,635 INFO L899 garLoopResultBuilder]: For program point L9537(lines 9537 9552) no Hoare annotation was computed. [2022-07-13 22:58:16,635 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 22:58:16,635 INFO L895 garLoopResultBuilder]: At program point L9211-2(line 9211) the Hoare annotation is: (and (= (* 256 (div |ULTIMATE.start_aws_string_destroy_secure_harness_~nondet_parameter~0#1| 256)) |ULTIMATE.start_aws_string_destroy_secure_harness_~nondet_parameter~0#1|) (not (= |ULTIMATE.start_aws_string_destroy_secure_harness_~str~3#1.base| 0))) [2022-07-13 22:58:16,635 INFO L899 garLoopResultBuilder]: For program point L9211-3(line 9211) no Hoare annotation was computed. [2022-07-13 22:58:16,635 INFO L895 garLoopResultBuilder]: At program point L7118(line 7118) the Hoare annotation is: false [2022-07-13 22:58:16,636 INFO L899 garLoopResultBuilder]: For program point L9546(lines 9546 9547) no Hoare annotation was computed. [2022-07-13 22:58:16,636 INFO L899 garLoopResultBuilder]: For program point L7114(lines 7114 7122) no Hoare annotation was computed. [2022-07-13 22:58:16,636 INFO L899 garLoopResultBuilder]: For program point L235(line 235) no Hoare annotation was computed. [2022-07-13 22:58:16,636 INFO L899 garLoopResultBuilder]: For program point L7118-1(line 7118) no Hoare annotation was computed. [2022-07-13 22:58:16,636 INFO L902 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: true [2022-07-13 22:58:16,636 INFO L899 garLoopResultBuilder]: For program point L9546-2(lines 9546 9547) no Hoare annotation was computed. [2022-07-13 22:58:16,636 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 22:58:16,636 INFO L899 garLoopResultBuilder]: For program point L9212(lines 9212 9214) no Hoare annotation was computed. [2022-07-13 22:58:16,636 INFO L899 garLoopResultBuilder]: For program point L9538-1(line 9538) no Hoare annotation was computed. [2022-07-13 22:58:16,636 INFO L899 garLoopResultBuilder]: For program point L9208(lines 9208 9216) no Hoare annotation was computed. [2022-07-13 22:58:16,636 INFO L899 garLoopResultBuilder]: For program point L7119-1(line 7119) no Hoare annotation was computed. [2022-07-13 22:58:16,636 INFO L895 garLoopResultBuilder]: At program point L7119(line 7119) the Hoare annotation is: false [2022-07-13 22:58:16,636 INFO L899 garLoopResultBuilder]: For program point L7115(lines 7115 7121) no Hoare annotation was computed. [2022-07-13 22:58:16,637 INFO L895 garLoopResultBuilder]: At program point L9213(line 9213) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_aws_string_destroy_secure_harness_~str~3#1.base| 0)))) (or (and .cse0 (not (< 0 (mod |ULTIMATE.start_aws_string_destroy_secure_harness_~len~2#1| 18446744073709551616)))) (and (= (* 256 (div |ULTIMATE.start_aws_string_destroy_secure_harness_~nondet_parameter~0#1| 256)) |ULTIMATE.start_aws_string_destroy_secure_harness_~nondet_parameter~0#1|) .cse0))) [2022-07-13 22:58:16,637 INFO L899 garLoopResultBuilder]: For program point L9213-1(line 9213) no Hoare annotation was computed. [2022-07-13 22:58:16,637 INFO L895 garLoopResultBuilder]: At program point L9209-4(line 9209) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_string_destroy_secure_harness_~str~3#1.base| 0)) (= (+ (* (- 256) (div |ULTIMATE.start_aws_string_destroy_secure_harness_~nondet_parameter~0#1| 256)) |ULTIMATE.start_aws_string_destroy_secure_harness_~nondet_parameter~0#1|) 0)) [2022-07-13 22:58:16,637 INFO L899 garLoopResultBuilder]: For program point L9209-5(line 9209) no Hoare annotation was computed. [2022-07-13 22:58:16,637 INFO L899 garLoopResultBuilder]: For program point L9209(line 9209) no Hoare annotation was computed. [2022-07-13 22:58:16,637 INFO L895 garLoopResultBuilder]: At program point L9209-2(line 9209) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_string_destroy_secure_harness_~str~3#1.base| 0)) (= (+ (* (- 256) (div |ULTIMATE.start_aws_string_destroy_secure_harness_~nondet_parameter~0#1| 256)) |ULTIMATE.start_aws_string_destroy_secure_harness_~nondet_parameter~0#1|) 0)) [2022-07-13 22:58:16,637 INFO L899 garLoopResultBuilder]: For program point L7124(lines 7124 7126) no Hoare annotation was computed. [2022-07-13 22:58:16,637 INFO L899 garLoopResultBuilder]: For program point L9209-3(line 9209) no Hoare annotation was computed. [2022-07-13 22:58:16,637 INFO L899 garLoopResultBuilder]: For program point L7120-1(line 7120) no Hoare annotation was computed. [2022-07-13 22:58:16,637 INFO L895 garLoopResultBuilder]: At program point L7120(line 7120) the Hoare annotation is: false [2022-07-13 22:58:16,637 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-13 22:58:16,637 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-13 22:58:16,638 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-13 22:58:16,638 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-13 22:58:16,638 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-13 22:58:16,638 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-13 22:58:16,641 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-13 22:58:16,643 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 22:58:16,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 10:58:16 BoogieIcfgContainer [2022-07-13 22:58:16,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 22:58:16,656 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 22:58:16,656 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 22:58:16,657 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 22:58:16,657 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:57:59" (3/4) ... [2022-07-13 22:58:16,660 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 22:58:16,665 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_secure_zero [2022-07-13 22:58:16,666 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-07-13 22:58:16,666 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-13 22:58:16,666 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2022-07-13 22:58:16,666 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-13 22:58:16,666 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_release [2022-07-13 22:58:16,666 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_bytes [2022-07-13 22:58:16,666 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-13 22:58:16,666 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-13 22:58:16,666 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-07-13 22:58:16,667 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-13 22:58:16,667 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-13 22:58:16,678 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2022-07-13 22:58:16,679 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2022-07-13 22:58:16,680 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-07-13 22:58:16,681 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-13 22:58:16,682 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-13 22:58:16,683 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-13 22:58:16,684 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 22:58:16,685 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 22:58:16,710 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(max_size) == max_size && !(str == 0)) && str == 0) && len % 18446744073709551616 < \old(max_size) % 18446744073709551616) && !(\result == 0)) && !(\old(max_size) == 16)) && \result == 0) && len % 18446744073709551616 < \old(max_size) % 18446744073709551616) && ((\old(max_size) % 18446744073709551616 + -18446744073709551609) / -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) [2022-07-13 22:58:17,043 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 22:58:17,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 22:58:17,044 INFO L158 Benchmark]: Toolchain (without parser) took 21633.14ms. Allocated memory was 75.5MB in the beginning and 371.2MB in the end (delta: 295.7MB). Free memory was 43.2MB in the beginning and 228.6MB in the end (delta: -185.4MB). Peak memory consumption was 219.5MB. Max. memory is 16.1GB. [2022-07-13 22:58:17,044 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 75.5MB. Free memory is still 53.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:58:17,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2405.78ms. Allocated memory was 75.5MB in the beginning and 113.2MB in the end (delta: 37.7MB). Free memory was 43.0MB in the beginning and 43.3MB in the end (delta: -310.9kB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2022-07-13 22:58:17,045 INFO L158 Benchmark]: Boogie Procedure Inliner took 260.38ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 43.3MB in the beginning and 106.0MB in the end (delta: -62.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 22:58:17,045 INFO L158 Benchmark]: Boogie Preprocessor took 109.76ms. Allocated memory is still 163.6MB. Free memory was 106.0MB in the beginning and 99.3MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 22:58:17,045 INFO L158 Benchmark]: RCFGBuilder took 1497.94ms. Allocated memory is still 163.6MB. Free memory was 99.3MB in the beginning and 78.4MB in the end (delta: 20.9MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. [2022-07-13 22:58:17,046 INFO L158 Benchmark]: TraceAbstraction took 16966.33ms. Allocated memory was 163.6MB in the beginning and 308.3MB in the end (delta: 144.7MB). Free memory was 78.4MB in the beginning and 113.7MB in the end (delta: -35.3MB). Peak memory consumption was 108.4MB. Max. memory is 16.1GB. [2022-07-13 22:58:17,046 INFO L158 Benchmark]: Witness Printer took 386.95ms. Allocated memory was 308.3MB in the beginning and 371.2MB in the end (delta: 62.9MB). Free memory was 113.7MB in the beginning and 228.6MB in the end (delta: -114.9MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2022-07-13 22:58:17,047 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.20ms. Allocated memory is still 75.5MB. Free memory is still 53.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2405.78ms. Allocated memory was 75.5MB in the beginning and 113.2MB in the end (delta: 37.7MB). Free memory was 43.0MB in the beginning and 43.3MB in the end (delta: -310.9kB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 260.38ms. Allocated memory was 113.2MB in the beginning and 163.6MB in the end (delta: 50.3MB). Free memory was 43.3MB in the beginning and 106.0MB in the end (delta: -62.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.76ms. Allocated memory is still 163.6MB. Free memory was 106.0MB in the beginning and 99.3MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1497.94ms. Allocated memory is still 163.6MB. Free memory was 99.3MB in the beginning and 78.4MB in the end (delta: 20.9MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. * TraceAbstraction took 16966.33ms. Allocated memory was 163.6MB in the beginning and 308.3MB in the end (delta: 144.7MB). Free memory was 78.4MB in the beginning and 113.7MB in the end (delta: -35.3MB). Peak memory consumption was 108.4MB. Max. memory is 16.1GB. * Witness Printer took 386.95ms. Allocated memory was 308.3MB in the beginning and 371.2MB in the end (delta: 62.9MB). Free memory was 113.7MB in the beginning and 228.6MB in the end (delta: -114.9MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.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 13 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 356 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 324 mSDsluCounter, 3533 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 89 IncrementalHoareTripleChecker+Unchecked, 2958 mSDsCounter, 184 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1194 IncrementalHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 184 mSolverCounterUnsat, 575 mSDtfsCounter, 1194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 598 GetRequests, 432 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1843 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=0, InterpolantAutomatonStates: 61, 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, 6 MinimizatonAttempts, 31 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 107 PreInvPairs, 120 NumberOfFragments, 399 HoareAnnotationTreeSize, 107 FomulaSimplifications, 62 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 35 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 874 NumberOfCodeBlocks, 874 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 864 ConstructedInterpolants, 35 QuantifiedInterpolants, 5402 SizeOfPredicates, 90 NumberOfNonLiveVariables, 10595 ConjunctsInSsa, 271 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 318/396 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: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9553]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: (((((((\old(max_size) == max_size && !(str == 0)) && str == 0) && len % 18446744073709551616 < \old(max_size) % 18446744073709551616) && !(\result == 0)) && !(\old(max_size) == 16)) && \result == 0) && len % 18446744073709551616 < \old(max_size) % 18446744073709551616) && ((\old(max_size) % 18446744073709551616 + -18446744073709551609) / -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) RESULT: Ultimate proved your program to be correct! [2022-07-13 22:58:17,068 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