./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_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_eq_byte_buf_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 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:57:58,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:57:58,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:57:58,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:57:58,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:57:58,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:57:58,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:57:58,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:57:58,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:57:58,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:57:58,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:57:58,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:57:58,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:57:58,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:57:58,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:57:58,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:57:58,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:57:58,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:57:58,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:57:58,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:57:58,226 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:57:58,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:57:58,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:57:58,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:57:58,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:57:58,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:57:58,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:57:58,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:57:58,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:57:58,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:57:58,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:57:58,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:57:58,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:57:58,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:57:58,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:57:58,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:57:58,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:57:58,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:57:58,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:57:58,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:57:58,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:57:58,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:57:58,243 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:58,267 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:57:58,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:57:58,267 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:57:58,268 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:57:58,268 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:57:58,268 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:57:58,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:57:58,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:57:58,269 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:57:58,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:57:58,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:57:58,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:57:58,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:57:58,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:57:58,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:57:58,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:57:58,271 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:57:58,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:57:58,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:57:58,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:57:58,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:57:58,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:57:58,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:57:58,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:57:58,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:57:58,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:57:58,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:57:58,272 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:57:58,272 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:57:58,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:57:58,273 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 -> 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce [2022-07-13 22:57:58,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:57:58,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:57:58,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:57:58,477 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:57:58,478 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:57:58,479 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2022-07-13 22:57:58,530 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cda2e004/73964240bdb04ce391d5d95dae488a69/FLAG5936e1323 [2022-07-13 22:57:59,179 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:57:59,179 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2022-07-13 22:57:59,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cda2e004/73964240bdb04ce391d5d95dae488a69/FLAG5936e1323 [2022-07-13 22:57:59,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cda2e004/73964240bdb04ce391d5d95dae488a69 [2022-07-13 22:57:59,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:57:59,573 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:57:59,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:57:59,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:57:59,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:57:59,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:57:59" (1/1) ... [2022-07-13 22:57:59,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359e20e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:57:59, skipping insertion in model container [2022-07-13 22:57:59,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:57:59" (1/1) ... [2022-07-13 22:57:59,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:57:59,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:57:59,847 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_eq_byte_buf_harness.i[4496,4509] [2022-07-13 22:57:59,853 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_eq_byte_buf_harness.i[4556,4569] [2022-07-13 22:58:00,380 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:00,380 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:00,381 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:00,381 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:00,382 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:00,390 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:00,392 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:00,393 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:00,393 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:00,589 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:58:00,604 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:58:00,605 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:58:00,606 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:58:00,607 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:58:00,607 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:58:00,608 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:58:00,608 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:58:00,608 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:58:00,609 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:58:00,711 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:58:00,791 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:00,793 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:00,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:58:00,945 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:58:00,962 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_eq_byte_buf_harness.i[4496,4509] [2022-07-13 22:58:00,964 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_eq_byte_buf_harness.i[4556,4569] [2022-07-13 22:58:00,991 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:00,994 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:00,995 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:00,995 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:00,995 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:01,003 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:01,004 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:01,004 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:01,004 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:01,066 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:58:01,066 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:58:01,067 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:58:01,067 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:58:01,068 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:58:01,068 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:58:01,068 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:58:01,069 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:58:01,069 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:58:01,069 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:58:01,092 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:58:01,145 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:01,145 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:58:01,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:58:01,316 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:58:01,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:01 WrapperNode [2022-07-13 22:58:01,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:58:01,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:58:01,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:58:01,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:58:01,326 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:58:01" (1/1) ... [2022-07-13 22:58:01,423 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:58:01" (1/1) ... [2022-07-13 22:58:01,480 INFO L137 Inliner]: procedures = 693, calls = 2792, calls flagged for inlining = 61, calls inlined = 8, statements flattened = 879 [2022-07-13 22:58:01,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:58:01,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:58:01,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:58:01,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:58:01,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:01" (1/1) ... [2022-07-13 22:58:01,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:01" (1/1) ... [2022-07-13 22:58:01,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:01" (1/1) ... [2022-07-13 22:58:01,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:01" (1/1) ... [2022-07-13 22:58:01,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:01" (1/1) ... [2022-07-13 22:58:01,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:01" (1/1) ... [2022-07-13 22:58:01,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:01" (1/1) ... [2022-07-13 22:58:01,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:58:01,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:58:01,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:58:01,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:58:01,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:01" (1/1) ... [2022-07-13 22:58:01,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:58:01,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:01,592 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:58:01,613 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:58:01,628 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-13 22:58:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-13 22:58:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-13 22:58:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-13 22:58:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-07-13 22:58:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-07-13 22:58:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-13 22:58:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:58:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:58:01,630 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:58:01,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:58:01,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:58:01,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:58:01,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:58:01,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:58:01,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:58:01,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:58:01,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:58:01,632 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:58:01,632 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:58:01,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 22:58:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:58:01,633 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:58:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:58:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:58:01,634 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2022-07-13 22:58:01,634 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2022-07-13 22:58:01,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:58:01,634 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-13 22:58:01,634 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-13 22:58:01,635 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-13 22:58:01,635 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-13 22:58:01,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:58:01,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:58:01,843 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:58:01,844 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:58:02,662 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:58:02,670 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:58:02,670 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 22:58:02,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:58:02 BoogieIcfgContainer [2022-07-13 22:58:02,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:58:02,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:58:02,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:58:02,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:58:02,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:57:59" (1/3) ... [2022-07-13 22:58:02,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e1a8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:58:02, skipping insertion in model container [2022-07-13 22:58:02,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:58:01" (2/3) ... [2022-07-13 22:58:02,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e1a8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:58:02, skipping insertion in model container [2022-07-13 22:58:02,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:58:02" (3/3) ... [2022-07-13 22:58:02,680 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_buf_harness.i [2022-07-13 22:58:02,692 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:58:02,692 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:58:02,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:58:02,757 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@3e9d6ab8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@fa010ef [2022-07-13 22:58:02,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:58:02,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-13 22:58:02,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 22:58:02,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:02,771 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,771 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:02,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:02,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1812998439, now seen corresponding path program 1 times [2022-07-13 22:58:02,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:02,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595776191] [2022-07-13 22:58:02,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:02,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:58:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:58:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:58:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:58:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 22:58:03,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:03,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595776191] [2022-07-13 22:58:03,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595776191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:03,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:03,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 22:58:03,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216167293] [2022-07-13 22:58:03,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:03,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 22:58:03,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:03,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 22:58:03,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:58:03,332 INFO L87 Difference]: Start difference. First operand has 131 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 22:58:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:03,495 INFO L93 Difference]: Finished difference Result 253 states and 352 transitions. [2022-07-13 22:58:03,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:58:03,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2022-07-13 22:58:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:03,505 INFO L225 Difference]: With dead ends: 253 [2022-07-13 22:58:03,505 INFO L226 Difference]: Without dead ends: 126 [2022-07-13 22:58:03,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:58:03,519 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 55 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:03,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 219 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:58:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-13 22:58:03,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-13 22:58:03,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 85 states have internal predecessors, (106), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-13 22:58:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2022-07-13 22:58:03,567 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 167 transitions. Word has length 72 [2022-07-13 22:58:03,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:03,570 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 167 transitions. [2022-07-13 22:58:03,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 22:58:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2022-07-13 22:58:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 22:58:03,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:03,576 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:58:03,577 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:03,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash -795992417, now seen corresponding path program 1 times [2022-07-13 22:58:03,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:03,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741995664] [2022-07-13 22:58:03,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:03,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:58:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:58:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:58:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:58:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 22:58:03,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:03,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741995664] [2022-07-13 22:58:03,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741995664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:03,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:03,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:58:03,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374452151] [2022-07-13 22:58:03,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:03,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:58:03,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:03,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:58:03,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:58:03,898 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 22:58:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:04,197 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2022-07-13 22:58:04,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:58:04,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 72 [2022-07-13 22:58:04,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:04,200 INFO L225 Difference]: With dead ends: 213 [2022-07-13 22:58:04,200 INFO L226 Difference]: Without dead ends: 129 [2022-07-13 22:58:04,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:58:04,201 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 108 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:04,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 403 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:58:04,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-13 22:58:04,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-13 22:58:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.255813953488372) internal successors, (108), 88 states have internal predecessors, (108), 31 states have call successors, (31), 10 states have call predecessors, (31), 11 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-07-13 22:58:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 170 transitions. [2022-07-13 22:58:04,212 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 170 transitions. Word has length 72 [2022-07-13 22:58:04,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:04,213 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 170 transitions. [2022-07-13 22:58:04,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 22:58:04,213 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 170 transitions. [2022-07-13 22:58:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-13 22:58:04,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:04,216 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 22:58:04,216 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:04,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:04,216 INFO L85 PathProgramCache]: Analyzing trace with hash -565003148, now seen corresponding path program 1 times [2022-07-13 22:58:04,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:04,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298962754] [2022-07-13 22:58:04,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:04,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:58:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:58:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:58:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 22:58:04,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:04,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298962754] [2022-07-13 22:58:04,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298962754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:04,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:04,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:58:04,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085253253] [2022-07-13 22:58:04,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:04,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:58:04,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:04,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:58:04,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:58:04,566 INFO L87 Difference]: Start difference. First operand 129 states and 170 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-13 22:58:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:05,013 INFO L93 Difference]: Finished difference Result 225 states and 299 transitions. [2022-07-13 22:58:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:58:05,014 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 78 [2022-07-13 22:58:05,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:05,018 INFO L225 Difference]: With dead ends: 225 [2022-07-13 22:58:05,019 INFO L226 Difference]: Without dead ends: 167 [2022-07-13 22:58:05,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:58:05,022 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 226 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:05,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 555 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:58:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-13 22:58:05,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 146. [2022-07-13 22:58:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 100 states have internal predecessors, (123), 35 states have call successors, (35), 11 states have call predecessors, (35), 12 states have return successors, (36), 34 states have call predecessors, (36), 34 states have call successors, (36) [2022-07-13 22:58:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 194 transitions. [2022-07-13 22:58:05,037 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 194 transitions. Word has length 78 [2022-07-13 22:58:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:05,037 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 194 transitions. [2022-07-13 22:58:05,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-13 22:58:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 194 transitions. [2022-07-13 22:58:05,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-13 22:58:05,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:05,039 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 22:58:05,040 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:05,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:05,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1924525814, now seen corresponding path program 1 times [2022-07-13 22:58:05,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:05,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636850209] [2022-07-13 22:58:05,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:05,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:58:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:58:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:58:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 22:58:05,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:05,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636850209] [2022-07-13 22:58:05,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636850209] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:05,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:05,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:58:05,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985696902] [2022-07-13 22:58:05,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:05,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:58:05,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:05,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:58:05,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:58:05,316 INFO L87 Difference]: Start difference. First operand 146 states and 194 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 22:58:05,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:05,558 INFO L93 Difference]: Finished difference Result 250 states and 338 transitions. [2022-07-13 22:58:05,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:58:05,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 78 [2022-07-13 22:58:05,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:05,560 INFO L225 Difference]: With dead ends: 250 [2022-07-13 22:58:05,560 INFO L226 Difference]: Without dead ends: 194 [2022-07-13 22:58:05,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:58:05,561 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 67 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:05,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 380 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:58:05,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-13 22:58:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2022-07-13 22:58:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 128 states have (on average 1.2578125) internal successors, (161), 130 states have internal predecessors, (161), 51 states have call successors, (51), 11 states have call predecessors, (51), 12 states have return successors, (54), 50 states have call predecessors, (54), 50 states have call successors, (54) [2022-07-13 22:58:05,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 266 transitions. [2022-07-13 22:58:05,573 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 266 transitions. Word has length 78 [2022-07-13 22:58:05,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:05,574 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 266 transitions. [2022-07-13 22:58:05,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 22:58:05,574 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 266 transitions. [2022-07-13 22:58:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 22:58:05,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:05,575 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 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] [2022-07-13 22:58:05,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:58:05,575 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:05,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:05,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2071762423, now seen corresponding path program 1 times [2022-07-13 22:58:05,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:05,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194015314] [2022-07-13 22:58:05,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:05,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:58:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:58:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:58:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:58:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-13 22:58:05,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:05,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194015314] [2022-07-13 22:58:05,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194015314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:05,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:05,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:58:05,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226073248] [2022-07-13 22:58:05,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:05,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:58:05,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:05,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:58:05,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:58:05,878 INFO L87 Difference]: Start difference. First operand 192 states and 266 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 22:58:06,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:06,252 INFO L93 Difference]: Finished difference Result 203 states and 282 transitions. [2022-07-13 22:58:06,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:58:06,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 90 [2022-07-13 22:58:06,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:06,255 INFO L225 Difference]: With dead ends: 203 [2022-07-13 22:58:06,256 INFO L226 Difference]: Without dead ends: 196 [2022-07-13 22:58:06,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:58:06,257 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 80 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:06,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 715 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:58:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-13 22:58:06,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-07-13 22:58:06,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 131 states have (on average 1.251908396946565) internal successors, (164), 134 states have internal predecessors, (164), 51 states have call successors, (51), 11 states have call predecessors, (51), 13 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2022-07-13 22:58:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 275 transitions. [2022-07-13 22:58:06,279 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 275 transitions. Word has length 90 [2022-07-13 22:58:06,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:06,279 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 275 transitions. [2022-07-13 22:58:06,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 22:58:06,280 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 275 transitions. [2022-07-13 22:58:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 22:58:06,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:06,283 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 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] [2022-07-13 22:58:06,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 22:58:06,283 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:06,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:06,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1055189439, now seen corresponding path program 1 times [2022-07-13 22:58:06,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:06,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818913792] [2022-07-13 22:58:06,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:06,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:58:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:58:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:58:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:58:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-13 22:58:06,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:06,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818913792] [2022-07-13 22:58:06,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818913792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:06,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:06,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:58:06,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337724142] [2022-07-13 22:58:06,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:06,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:58:06,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:06,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:58:06,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:58:06,615 INFO L87 Difference]: Start difference. First operand 196 states and 275 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 22:58:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:06,927 INFO L93 Difference]: Finished difference Result 362 states and 524 transitions. [2022-07-13 22:58:06,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:58:06,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2022-07-13 22:58:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:06,928 INFO L225 Difference]: With dead ends: 362 [2022-07-13 22:58:06,929 INFO L226 Difference]: Without dead ends: 221 [2022-07-13 22:58:06,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:58:06,930 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 120 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:06,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 447 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:58:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-13 22:58:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 201. [2022-07-13 22:58:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 136 states have (on average 1.2573529411764706) internal successors, (171), 139 states have internal predecessors, (171), 51 states have call successors, (51), 11 states have call predecessors, (51), 13 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2022-07-13 22:58:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 282 transitions. [2022-07-13 22:58:06,940 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 282 transitions. Word has length 94 [2022-07-13 22:58:06,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:06,940 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 282 transitions. [2022-07-13 22:58:06,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 22:58:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 282 transitions. [2022-07-13 22:58:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 22:58:06,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:06,942 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 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] [2022-07-13 22:58:06,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 22:58:06,942 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:06,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:06,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1313354877, now seen corresponding path program 1 times [2022-07-13 22:58:06,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:06,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113623755] [2022-07-13 22:58:06,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:06,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:58:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:58:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:58:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:58:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-13 22:58:07,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:07,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113623755] [2022-07-13 22:58:07,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113623755] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:07,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029473844] [2022-07-13 22:58:07,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:07,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:07,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:07,341 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:07,342 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:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:07,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 2607 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-13 22:58:07,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:07,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:58:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 22:58:08,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:08,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029473844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:08,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:08,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 20 [2022-07-13 22:58:08,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961987450] [2022-07-13 22:58:08,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:08,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:58:08,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:08,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:58:08,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:58:08,123 INFO L87 Difference]: Start difference. First operand 201 states and 282 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-13 22:58:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:08,162 INFO L93 Difference]: Finished difference Result 373 states and 521 transitions. [2022-07-13 22:58:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:58:08,163 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 94 [2022-07-13 22:58:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:08,164 INFO L225 Difference]: With dead ends: 373 [2022-07-13 22:58:08,164 INFO L226 Difference]: Without dead ends: 220 [2022-07-13 22:58:08,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:58:08,165 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 20 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:08,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 936 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 57 Unchecked, 0.0s Time] [2022-07-13 22:58:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-13 22:58:08,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-07-13 22:58:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 154 states have (on average 1.2597402597402598) internal successors, (194), 157 states have internal predecessors, (194), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2022-07-13 22:58:08,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 305 transitions. [2022-07-13 22:58:08,175 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 305 transitions. Word has length 94 [2022-07-13 22:58:08,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:08,175 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 305 transitions. [2022-07-13 22:58:08,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-13 22:58:08,175 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 305 transitions. [2022-07-13 22:58:08,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-13 22:58:08,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:08,177 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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] [2022-07-13 22:58:08,198 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:08,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:08,387 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:08,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:08,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1354029627, now seen corresponding path program 1 times [2022-07-13 22:58:08,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:08,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912702927] [2022-07-13 22:58:08,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:58:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:58:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:58:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:58:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 22:58:08,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:08,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912702927] [2022-07-13 22:58:08,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912702927] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:08,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603199301] [2022-07-13 22:58:08,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:08,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:08,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:08,562 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:08,564 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:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:08,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 22:58:08,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:08,972 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 22:58:08,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:08,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603199301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:08,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:08,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 22:58:08,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470504159] [2022-07-13 22:58:08,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:08,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:58:08,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:08,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:58:08,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:58:08,975 INFO L87 Difference]: Start difference. First operand 220 states and 305 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:58:08,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:08,996 INFO L93 Difference]: Finished difference Result 379 states and 533 transitions. [2022-07-13 22:58:08,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:58:08,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2022-07-13 22:58:08,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:08,998 INFO L225 Difference]: With dead ends: 379 [2022-07-13 22:58:08,998 INFO L226 Difference]: Without dead ends: 229 [2022-07-13 22:58:08,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:58:09,000 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 20 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:09,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 493 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:58:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-13 22:58:09,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 212. [2022-07-13 22:58:09,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 147 states have (on average 1.2585034013605443) internal successors, (185), 149 states have internal predecessors, (185), 51 states have call successors, (51), 12 states have call predecessors, (51), 13 states have return successors, (58), 50 states have call predecessors, (58), 50 states have call successors, (58) [2022-07-13 22:58:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2022-07-13 22:58:09,010 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 94 [2022-07-13 22:58:09,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:09,011 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2022-07-13 22:58:09,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:58:09,011 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2022-07-13 22:58:09,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-13 22:58:09,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:09,014 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 22:58:09,036 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:09,233 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,SelfDestructingSolverStorable7 [2022-07-13 22:58:09,234 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:09,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:09,234 INFO L85 PathProgramCache]: Analyzing trace with hash -805510601, now seen corresponding path program 1 times [2022-07-13 22:58:09,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:09,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993140410] [2022-07-13 22:58:09,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:09,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:09,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:09,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:09,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:09,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:09,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:09,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:09,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:58:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:09,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:58:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:09,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:58:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:09,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 22:58:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:09,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:58:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-13 22:58:09,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:09,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993140410] [2022-07-13 22:58:09,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993140410] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:09,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714380707] [2022-07-13 22:58:09,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:09,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:09,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:09,466 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:09,467 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:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:09,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:58:09,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 22:58:09,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:09,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714380707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:09,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:09,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-07-13 22:58:09,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036054204] [2022-07-13 22:58:09,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:09,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:58:09,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:09,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:58:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:58:09,915 INFO L87 Difference]: Start difference. First operand 212 states and 294 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 22:58:10,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:10,035 INFO L93 Difference]: Finished difference Result 367 states and 515 transitions. [2022-07-13 22:58:10,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:58:10,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2022-07-13 22:58:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:10,037 INFO L225 Difference]: With dead ends: 367 [2022-07-13 22:58:10,037 INFO L226 Difference]: Without dead ends: 217 [2022-07-13 22:58:10,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:58:10,038 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 12 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:10,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1183 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:58:10,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-13 22:58:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-07-13 22:58:10,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 151 states have (on average 1.2516556291390728) internal successors, (189), 154 states have internal predecessors, (189), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2022-07-13 22:58:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 303 transitions. [2022-07-13 22:58:10,046 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 303 transitions. Word has length 98 [2022-07-13 22:58:10,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:10,046 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 303 transitions. [2022-07-13 22:58:10,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 22:58:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 303 transitions. [2022-07-13 22:58:10,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 22:58:10,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:10,048 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 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] [2022-07-13 22:58:10,067 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:10,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:10,263 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:10,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:10,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1170955310, now seen corresponding path program 1 times [2022-07-13 22:58:10,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:10,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891318238] [2022-07-13 22:58:10,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:10,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:10,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:10,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:10,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:10,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:10,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:10,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:10,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:10,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:58:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:10,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:58:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:10,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:58:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:10,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:58:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-13 22:58:10,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:10,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891318238] [2022-07-13 22:58:10,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891318238] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:10,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320600395] [2022-07-13 22:58:10,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:10,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:10,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:10,408 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:10,409 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:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:10,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 2619 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 22:58:10,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-13 22:58:10,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:10,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320600395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:10,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:10,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 22:58:10,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635423993] [2022-07-13 22:58:10,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:10,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:58:10,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:10,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:58:10,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:58:10,788 INFO L87 Difference]: Start difference. First operand 217 states and 303 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:58:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:10,808 INFO L93 Difference]: Finished difference Result 377 states and 535 transitions. [2022-07-13 22:58:10,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:58:10,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2022-07-13 22:58:10,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:10,810 INFO L225 Difference]: With dead ends: 377 [2022-07-13 22:58:10,810 INFO L226 Difference]: Without dead ends: 220 [2022-07-13 22:58:10,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:58:10,811 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 9 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:10,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 486 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:58:10,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-13 22:58:10,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2022-07-13 22:58:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 151 states have (on average 1.2384105960264902) internal successors, (187), 154 states have internal predecessors, (187), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2022-07-13 22:58:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 301 transitions. [2022-07-13 22:58:10,822 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 301 transitions. Word has length 100 [2022-07-13 22:58:10,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:10,822 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 301 transitions. [2022-07-13 22:58:10,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:58:10,822 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 301 transitions. [2022-07-13 22:58:10,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 22:58:10,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:10,823 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 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] [2022-07-13 22:58:10,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:11,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:11,039 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:11,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:11,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1786047986, now seen corresponding path program 1 times [2022-07-13 22:58:11,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:11,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819446720] [2022-07-13 22:58:11,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:11,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:11,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:11,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:11,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:11,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:11,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:11,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:11,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:11,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:58:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:11,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:58:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:11,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:58:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:11,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:58:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-13 22:58:11,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:11,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819446720] [2022-07-13 22:58:11,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819446720] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:11,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689772267] [2022-07-13 22:58:11,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:11,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:11,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:11,202 INFO L229 MonitoredProcess]: Starting monitored process 6 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:11,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 22:58:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:11,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 2621 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 22:58:11,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 22:58:11,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:58:11,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689772267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:11,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:58:11,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 22:58:11,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830357726] [2022-07-13 22:58:11,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:11,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:58:11,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:11,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:58:11,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:58:11,597 INFO L87 Difference]: Start difference. First operand 217 states and 301 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:58:11,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:11,618 INFO L93 Difference]: Finished difference Result 383 states and 546 transitions. [2022-07-13 22:58:11,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:58:11,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2022-07-13 22:58:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:11,620 INFO L225 Difference]: With dead ends: 383 [2022-07-13 22:58:11,620 INFO L226 Difference]: Without dead ends: 226 [2022-07-13 22:58:11,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:58:11,621 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 34 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:11,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 484 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:58:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-13 22:58:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 213. [2022-07-13 22:58:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 147 states have (on average 1.2244897959183674) internal successors, (180), 150 states have internal predecessors, (180), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2022-07-13 22:58:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 294 transitions. [2022-07-13 22:58:11,628 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 294 transitions. Word has length 100 [2022-07-13 22:58:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:11,629 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 294 transitions. [2022-07-13 22:58:11,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:58:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 294 transitions. [2022-07-13 22:58:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 22:58:11,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:11,630 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 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] [2022-07-13 22:58:11,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:11,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-13 22:58:11,843 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:11,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1106775732, now seen corresponding path program 1 times [2022-07-13 22:58:11,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:11,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857044393] [2022-07-13 22:58:11,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:11,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:58:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:58:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:58:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:58:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-13 22:58:12,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:12,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857044393] [2022-07-13 22:58:12,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857044393] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:12,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327636954] [2022-07-13 22:58:12,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:12,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:12,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:12,393 INFO L229 MonitoredProcess]: Starting monitored process 7 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:12,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 22:58:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:12,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 2616 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-13 22:58:12,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:12,820 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 13 treesize of output 9 [2022-07-13 22:58:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 22:58:13,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:58:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-13 22:58:13,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327636954] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:58:13,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:58:13,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 27 [2022-07-13 22:58:13,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716648082] [2022-07-13 22:58:13,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:58:13,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 22:58:13,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:13,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 22:58:13,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2022-07-13 22:58:13,711 INFO L87 Difference]: Start difference. First operand 213 states and 294 transitions. Second operand has 27 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 7 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2022-07-13 22:58:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:15,015 INFO L93 Difference]: Finished difference Result 258 states and 341 transitions. [2022-07-13 22:58:15,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:58:15,016 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 7 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 100 [2022-07-13 22:58:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:15,017 INFO L225 Difference]: With dead ends: 258 [2022-07-13 22:58:15,017 INFO L226 Difference]: Without dead ends: 230 [2022-07-13 22:58:15,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 201 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 22:58:15,018 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 361 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:15,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1018 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1420 Invalid, 0 Unknown, 312 Unchecked, 1.0s Time] [2022-07-13 22:58:15,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-13 22:58:15,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2022-07-13 22:58:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 155 states have (on average 1.2129032258064516) internal successors, (188), 158 states have internal predecessors, (188), 51 states have call successors, (51), 14 states have call predecessors, (51), 16 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2022-07-13 22:58:15,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 302 transitions. [2022-07-13 22:58:15,028 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 302 transitions. Word has length 100 [2022-07-13 22:58:15,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:15,028 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 302 transitions. [2022-07-13 22:58:15,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 7 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2022-07-13 22:58:15,029 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 302 transitions. [2022-07-13 22:58:15,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 22:58:15,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:15,030 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 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] [2022-07-13 22:58:15,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:15,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:15,247 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:15,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:15,248 INFO L85 PathProgramCache]: Analyzing trace with hash 61814546, now seen corresponding path program 1 times [2022-07-13 22:58:15,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:15,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816910368] [2022-07-13 22:58:15,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:15,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:58:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:58:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:58:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:58:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-13 22:58:15,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:15,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816910368] [2022-07-13 22:58:15,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816910368] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:15,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193409862] [2022-07-13 22:58:15,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:15,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:15,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:15,614 INFO L229 MonitoredProcess]: Starting monitored process 8 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:15,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 22:58:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:15,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 2613 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-13 22:58:15,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 22:58:16,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:58:17,262 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 22:58:17,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 1 [2022-07-13 22:58:17,414 INFO L356 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2022-07-13 22:58:17,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 35 [2022-07-13 22:58:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-13 22:58:17,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193409862] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:58:17,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:58:17,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 33 [2022-07-13 22:58:17,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200711113] [2022-07-13 22:58:17,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:58:17,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 22:58:17,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:17,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 22:58:17,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 22:58:17,498 INFO L87 Difference]: Start difference. First operand 223 states and 302 transitions. Second operand has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2022-07-13 22:58:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:19,895 INFO L93 Difference]: Finished difference Result 354 states and 510 transitions. [2022-07-13 22:58:19,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 22:58:19,896 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) Word has length 100 [2022-07-13 22:58:19,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:19,897 INFO L225 Difference]: With dead ends: 354 [2022-07-13 22:58:19,897 INFO L226 Difference]: Without dead ends: 342 [2022-07-13 22:58:19,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 196 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=587, Invalid=2383, Unknown=0, NotChecked=0, Total=2970 [2022-07-13 22:58:19,899 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 320 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 672 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:19,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1504 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1955 Invalid, 0 Unknown, 672 Unchecked, 1.4s Time] [2022-07-13 22:58:19,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-07-13 22:58:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 334. [2022-07-13 22:58:19,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 232 states have (on average 1.2155172413793103) internal successors, (282), 235 states have internal predecessors, (282), 81 states have call successors, (81), 17 states have call predecessors, (81), 20 states have return successors, (117), 81 states have call predecessors, (117), 80 states have call successors, (117) [2022-07-13 22:58:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 480 transitions. [2022-07-13 22:58:19,915 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 480 transitions. Word has length 100 [2022-07-13 22:58:19,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:19,915 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 480 transitions. [2022-07-13 22:58:19,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2022-07-13 22:58:19,916 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 480 transitions. [2022-07-13 22:58:19,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 22:58:19,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:19,917 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 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] [2022-07-13 22:58:19,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-13 22:58:20,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:20,128 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:20,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:20,128 INFO L85 PathProgramCache]: Analyzing trace with hash 319979984, now seen corresponding path program 1 times [2022-07-13 22:58:20,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:20,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469955870] [2022-07-13 22:58:20,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:20,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:58:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:58:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:58:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:58:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-13 22:58:20,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:20,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469955870] [2022-07-13 22:58:20,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469955870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:20,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:20,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:58:20,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608308758] [2022-07-13 22:58:20,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:20,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:58:20,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:20,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:58:20,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:58:20,335 INFO L87 Difference]: Start difference. First operand 334 states and 480 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 22:58:20,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:20,617 INFO L93 Difference]: Finished difference Result 490 states and 688 transitions. [2022-07-13 22:58:20,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:58:20,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2022-07-13 22:58:20,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:20,619 INFO L225 Difference]: With dead ends: 490 [2022-07-13 22:58:20,619 INFO L226 Difference]: Without dead ends: 325 [2022-07-13 22:58:20,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:58:20,620 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 78 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:20,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 446 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:58:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-07-13 22:58:20,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-07-13 22:58:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 224 states have (on average 1.2142857142857142) internal successors, (272), 226 states have internal predecessors, (272), 81 states have call successors, (81), 17 states have call predecessors, (81), 19 states have return successors, (116), 81 states have call predecessors, (116), 80 states have call successors, (116) [2022-07-13 22:58:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 469 transitions. [2022-07-13 22:58:20,637 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 469 transitions. Word has length 100 [2022-07-13 22:58:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:20,637 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 469 transitions. [2022-07-13 22:58:20,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 22:58:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 469 transitions. [2022-07-13 22:58:20,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 22:58:20,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:20,639 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 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] [2022-07-13 22:58:20,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 22:58:20,639 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:20,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:20,640 INFO L85 PathProgramCache]: Analyzing trace with hash 102489296, now seen corresponding path program 1 times [2022-07-13 22:58:20,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:20,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673633970] [2022-07-13 22:58:20,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:20,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:20,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:58:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:58:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:58:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:58:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-13 22:58:21,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:21,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673633970] [2022-07-13 22:58:21,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673633970] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:21,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019512008] [2022-07-13 22:58:21,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:21,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:21,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:21,302 INFO L229 MonitoredProcess]: Starting monitored process 9 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:21,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 22:58:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:21,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 2618 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-13 22:58:21,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 22:58:22,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:58:23,057 INFO L356 Elim1Store]: treesize reduction 39, result has 46.6 percent of original size [2022-07-13 22:58:23,057 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 48 [2022-07-13 22:58:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-13 22:58:23,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019512008] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:58:23,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:58:23,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 30 [2022-07-13 22:58:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890761755] [2022-07-13 22:58:23,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:58:23,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-13 22:58:23,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:23,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-13 22:58:23,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2022-07-13 22:58:23,455 INFO L87 Difference]: Start difference. First operand 325 states and 469 transitions. Second operand has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-07-13 22:58:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:25,523 INFO L93 Difference]: Finished difference Result 349 states and 492 transitions. [2022-07-13 22:58:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 22:58:25,524 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 100 [2022-07-13 22:58:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:25,525 INFO L225 Difference]: With dead ends: 349 [2022-07-13 22:58:25,525 INFO L226 Difference]: Without dead ends: 337 [2022-07-13 22:58:25,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 198 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=382, Invalid=1780, Unknown=0, NotChecked=0, Total=2162 [2022-07-13 22:58:25,527 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 240 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:25,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 885 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1190 Invalid, 0 Unknown, 204 Unchecked, 1.1s Time] [2022-07-13 22:58:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-13 22:58:25,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 320. [2022-07-13 22:58:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 220 states have (on average 1.2181818181818183) internal successors, (268), 221 states have internal predecessors, (268), 81 states have call successors, (81), 17 states have call predecessors, (81), 18 states have return successors, (107), 81 states have call predecessors, (107), 80 states have call successors, (107) [2022-07-13 22:58:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 456 transitions. [2022-07-13 22:58:25,547 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 456 transitions. Word has length 100 [2022-07-13 22:58:25,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:25,548 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 456 transitions. [2022-07-13 22:58:25,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-07-13 22:58:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 456 transitions. [2022-07-13 22:58:25,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-13 22:58:25,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:25,549 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 22:58:25,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-13 22:58:25,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 22:58:25,763 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:25,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:25,764 INFO L85 PathProgramCache]: Analyzing trace with hash -430654057, now seen corresponding path program 1 times [2022-07-13 22:58:25,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:25,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315328092] [2022-07-13 22:58:25,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:25,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:58:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:58:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:58:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:58:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 22:58:25,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:25,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315328092] [2022-07-13 22:58:25,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315328092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:25,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:25,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 22:58:26,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392597838] [2022-07-13 22:58:26,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:26,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:58:26,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:26,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:58:26,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:58:26,001 INFO L87 Difference]: Start difference. First operand 320 states and 456 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 22:58:26,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:26,447 INFO L93 Difference]: Finished difference Result 331 states and 473 transitions. [2022-07-13 22:58:26,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:58:26,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2022-07-13 22:58:26,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:26,449 INFO L225 Difference]: With dead ends: 331 [2022-07-13 22:58:26,449 INFO L226 Difference]: Without dead ends: 289 [2022-07-13 22:58:26,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:58:26,450 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 84 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:26,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 885 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:58:26,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-13 22:58:26,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2022-07-13 22:58:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 197 states have (on average 1.2030456852791878) internal successors, (237), 199 states have internal predecessors, (237), 69 states have call successors, (69), 17 states have call predecessors, (69), 18 states have return successors, (86), 68 states have call predecessors, (86), 67 states have call successors, (86) [2022-07-13 22:58:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 392 transitions. [2022-07-13 22:58:26,466 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 392 transitions. Word has length 102 [2022-07-13 22:58:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:26,466 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 392 transitions. [2022-07-13 22:58:26,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 22:58:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 392 transitions. [2022-07-13 22:58:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-13 22:58:26,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:26,468 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 22:58:26,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 22:58:26,468 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:26,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:26,468 INFO L85 PathProgramCache]: Analyzing trace with hash 704139607, now seen corresponding path program 1 times [2022-07-13 22:58:26,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:26,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048967477] [2022-07-13 22:58:26,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:26,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:58:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:58:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:58:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:58:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:58:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:58:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:58:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:58:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:58:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-13 22:58:26,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:26,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048967477] [2022-07-13 22:58:26,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048967477] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:58:26,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:58:26,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-13 22:58:26,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5400921] [2022-07-13 22:58:26,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:58:26,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 22:58:26,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:26,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 22:58:26,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:58:26,981 INFO L87 Difference]: Start difference. First operand 285 states and 392 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-13 22:58:27,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:27,806 INFO L93 Difference]: Finished difference Result 295 states and 406 transitions. [2022-07-13 22:58:27,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:58:27,806 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2022-07-13 22:58:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:27,807 INFO L225 Difference]: With dead ends: 295 [2022-07-13 22:58:27,807 INFO L226 Difference]: Without dead ends: 230 [2022-07-13 22:58:27,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2022-07-13 22:58:27,808 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 177 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:27,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 928 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 22:58:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-13 22:58:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 167. [2022-07-13 22:58:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 118 states have (on average 1.1864406779661016) internal successors, (140), 120 states have internal predecessors, (140), 33 states have call successors, (33), 14 states have call predecessors, (33), 15 states have return successors, (36), 32 states have call predecessors, (36), 32 states have call successors, (36) [2022-07-13 22:58:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 209 transitions. [2022-07-13 22:58:27,820 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 209 transitions. Word has length 102 [2022-07-13 22:58:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:27,820 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 209 transitions. [2022-07-13 22:58:27,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-13 22:58:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 209 transitions. [2022-07-13 22:58:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-13 22:58:27,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:58:27,821 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 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, 1, 1, 1, 1] [2022-07-13 22:58:27,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 22:58:27,821 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:58:27,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:58:27,822 INFO L85 PathProgramCache]: Analyzing trace with hash 523668838, now seen corresponding path program 1 times [2022-07-13 22:58:27,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:58:27,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564386525] [2022-07-13 22:58:27,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:27,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:58:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:58:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:27,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:58:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:58:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:58:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:58:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 22:58:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:58:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:58:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:58:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:58:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:58:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:58:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:58:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:58:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-13 22:58:28,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:58:28,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564386525] [2022-07-13 22:58:28,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564386525] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:58:28,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124641905] [2022-07-13 22:58:28,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:58:28,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:58:28,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:58:28,245 INFO L229 MonitoredProcess]: Starting monitored process 10 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:28,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 22:58:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:58:28,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 2725 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 22:58:28,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:58:28,759 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-13 22:58:28,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:58:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-13 22:58:28,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124641905] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:58:28,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:58:28,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 24 [2022-07-13 22:58:28,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379751287] [2022-07-13 22:58:28,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:58:28,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 22:58:28,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:58:28,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 22:58:28,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:58:28,877 INFO L87 Difference]: Start difference. First operand 167 states and 209 transitions. Second operand has 24 states, 21 states have (on average 3.857142857142857) internal successors, (81), 18 states have internal predecessors, (81), 10 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 10 states have call successors, (23) [2022-07-13 22:58:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:58:29,329 INFO L93 Difference]: Finished difference Result 185 states and 223 transitions. [2022-07-13 22:58:29,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 22:58:29,330 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 3.857142857142857) internal successors, (81), 18 states have internal predecessors, (81), 10 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 10 states have call successors, (23) Word has length 118 [2022-07-13 22:58:29,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:58:29,330 INFO L225 Difference]: With dead ends: 185 [2022-07-13 22:58:29,330 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 22:58:29,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2022-07-13 22:58:29,332 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 64 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:58:29,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 274 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:58:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 22:58:29,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 22:58:29,332 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:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 22:58:29,332 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2022-07-13 22:58:29,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:58:29,332 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 22:58:29,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 3.857142857142857) internal successors, (81), 18 states have internal predecessors, (81), 10 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 10 states have call successors, (23) [2022-07-13 22:58:29,333 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 22:58:29,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 22:58:29,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 22:58:29,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 22:58:29,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 22:58:29,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 22:58:33,034 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (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))) [2022-07-13 22:58:33,034 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:33,034 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2022-07-13 22:58:33,034 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-07-13 22:58:33,035 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (= |old(#length)| |#length|) (or (<= |ensure_string_is_allocated_bounded_length_~len~1#1| (+ (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) 15)) .cse0) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse0 (<= (* 18446744073709551616 (div (+ 18446744073709551615 |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) (<= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| (+ 15 (* 18446744073709551616 (div (+ (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 18446744073709551616))))) (= |old(#valid)| |#valid|))) [2022-07-13 22:58:33,035 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-07-13 22:58:33,035 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2022-07-13 22:58:33,035 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-07-13 22:58:33,035 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-13 22:58:33,035 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:33,036 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-07-13 22:58:33,036 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-07-13 22:58:33,036 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-13 22:58:33,036 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-07-13 22:58:33,036 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:33,036 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:33,036 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-07-13 22:58:33,036 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-07-13 22:58:33,036 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-07-13 22:58:33,036 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:33,036 INFO L902 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2022-07-13 22:58:33,036 INFO L899 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2022-07-13 22:58:33,036 INFO L899 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2022-07-13 22:58:33,036 INFO L902 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2022-07-13 22:58:33,036 INFO L899 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2022-07-13 22:58:33,036 INFO L899 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2022-07-13 22:58:33,036 INFO L902 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2022-07-13 22:58:33,036 INFO L899 garLoopResultBuilder]: For program point L7364-6(line 7364) no Hoare annotation was computed. [2022-07-13 22:58:33,036 INFO L899 garLoopResultBuilder]: For program point L7364-4(line 7364) no Hoare annotation was computed. [2022-07-13 22:58:33,036 INFO L899 garLoopResultBuilder]: For program point L7364-3(line 7364) no Hoare annotation was computed. [2022-07-13 22:58:33,036 INFO L899 garLoopResultBuilder]: For program point L7364-8(line 7364) no Hoare annotation was computed. [2022-07-13 22:58:33,037 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7359 7365) the Hoare annotation is: true [2022-07-13 22:58:33,037 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7359 7365) no Hoare annotation was computed. [2022-07-13 22:58:33,037 INFO L899 garLoopResultBuilder]: For program point L7361-3(line 7361) no Hoare annotation was computed. [2022-07-13 22:58:33,037 INFO L899 garLoopResultBuilder]: For program point L7361-1(line 7361) no Hoare annotation was computed. [2022-07-13 22:58:33,037 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7359 7365) no Hoare annotation was computed. [2022-07-13 22:58:33,037 INFO L899 garLoopResultBuilder]: For program point L7361(lines 7361 7364) no Hoare annotation was computed. [2022-07-13 22:58:33,037 INFO L899 garLoopResultBuilder]: For program point L7361-7(lines 7361 7364) no Hoare annotation was computed. [2022-07-13 22:58:33,037 INFO L899 garLoopResultBuilder]: For program point L7361-6(lines 7361 7362) no Hoare annotation was computed. [2022-07-13 22:58:33,037 INFO L899 garLoopResultBuilder]: For program point L7361-4(lines 7361 7362) no Hoare annotation was computed. [2022-07-13 22:58:33,037 INFO L899 garLoopResultBuilder]: For program point L7361-11(lines 7361 7364) no Hoare annotation was computed. [2022-07-13 22:58:33,037 INFO L899 garLoopResultBuilder]: For program point L7361-9(lines 7361 7364) no Hoare annotation was computed. [2022-07-13 22:58:33,037 INFO L899 garLoopResultBuilder]: For program point L7364-2(line 7364) no Hoare annotation was computed. [2022-07-13 22:58:33,037 INFO L899 garLoopResultBuilder]: For program point L7364(line 7364) no Hoare annotation was computed. [2022-07-13 22:58:33,037 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-13 22:58:33,037 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-13 22:58:33,037 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-13 22:58:33,037 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-13 22:58:33,038 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-13 22:58:33,038 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-13 22:58:33,038 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-13 22:58:33,038 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-07-13 22:58:33,038 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-07-13 22:58:33,038 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-07-13 22:58:33,038 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-07-13 22:58:33,038 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-07-13 22:58:33,038 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-07-13 22:58:33,038 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-07-13 22:58:33,038 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-07-13 22:58:33,038 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-07-13 22:58:33,038 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-07-13 22:58:33,038 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-13 22:58:33,038 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-13 22:58:33,039 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-13 22:58:33,039 INFO L895 garLoopResultBuilder]: At program point L9408(line 9408) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-13 22:58:33,039 INFO L899 garLoopResultBuilder]: For program point L9408-1(line 9408) no Hoare annotation was computed. [2022-07-13 22:58:33,039 INFO L895 garLoopResultBuilder]: At program point L9408-2(lines 9386 9409) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-13 22:58:33,039 INFO L899 garLoopResultBuilder]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2022-07-13 22:58:33,039 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 22:58:33,039 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 22:58:33,039 INFO L895 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-07-13 22:58:33,039 INFO L902 garLoopResultBuilder]: At program point L9558(line 9558) the Hoare annotation is: true [2022-07-13 22:58:33,039 INFO L899 garLoopResultBuilder]: For program point L6610-3(lines 6610 6612) no Hoare annotation was computed. [2022-07-13 22:58:33,041 INFO L899 garLoopResultBuilder]: For program point L6610-1(lines 6610 6612) no Hoare annotation was computed. [2022-07-13 22:58:33,041 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-07-13 22:58:33,041 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-07-13 22:58:33,041 INFO L895 garLoopResultBuilder]: At program point L9551(line 9551) the Hoare annotation is: false [2022-07-13 22:58:33,041 INFO L899 garLoopResultBuilder]: For program point L9551-1(line 9551) no Hoare annotation was computed. [2022-07-13 22:58:33,041 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-07-13 22:58:33,041 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-07-13 22:58:33,041 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-07-13 22:58:33,041 INFO L899 garLoopResultBuilder]: For program point L6612-1(line 6612) no Hoare annotation was computed. [2022-07-13 22:58:33,042 INFO L895 garLoopResultBuilder]: At program point L6612(line 6612) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-07-13 22:58:33,042 INFO L895 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2022-07-13 22:58:33,042 INFO L899 garLoopResultBuilder]: For program point L9544-1(line 9544) no Hoare annotation was computed. [2022-07-13 22:58:33,042 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-07-13 22:58:33,042 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-07-13 22:58:33,042 INFO L899 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2022-07-13 22:58:33,042 INFO L895 garLoopResultBuilder]: At program point L6613(line 6613) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_#t~mem475#1| (select (select |#memory_int| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (+ |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 16)))) [2022-07-13 22:58:33,042 INFO L899 garLoopResultBuilder]: For program point L9388(line 9388) no Hoare annotation was computed. [2022-07-13 22:58:33,042 INFO L895 garLoopResultBuilder]: At program point L9388-2(line 9388) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-13 22:58:33,043 INFO L895 garLoopResultBuilder]: At program point L9553(line 9553) the Hoare annotation is: false [2022-07-13 22:58:33,043 INFO L895 garLoopResultBuilder]: At program point L9553-1(line 9553) the Hoare annotation is: false [2022-07-13 22:58:33,043 INFO L899 garLoopResultBuilder]: For program point L9553-2(line 9553) no Hoare annotation was computed. [2022-07-13 22:58:33,043 INFO L899 garLoopResultBuilder]: For program point L9388-3(line 9388) no Hoare annotation was computed. [2022-07-13 22:58:33,043 INFO L895 garLoopResultBuilder]: At program point L9388-4(line 9388) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-13 22:58:33,043 INFO L899 garLoopResultBuilder]: For program point L9388-5(line 9388) no Hoare annotation was computed. [2022-07-13 22:58:33,043 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 22:58:33,043 INFO L899 garLoopResultBuilder]: For program point L9389(line 9389) no Hoare annotation was computed. [2022-07-13 22:58:33,044 INFO L895 garLoopResultBuilder]: At program point L9389-2(line 9389) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-13 22:58:33,044 INFO L895 garLoopResultBuilder]: At program point L9546(line 9546) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-07-13 22:58:33,044 INFO L899 garLoopResultBuilder]: For program point L9389-3(line 9389) no Hoare annotation was computed. [2022-07-13 22:58:33,044 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-07-13 22:58:33,044 INFO L899 garLoopResultBuilder]: For program point L9538(lines 9538 9557) no Hoare annotation was computed. [2022-07-13 22:58:33,044 INFO L895 garLoopResultBuilder]: At program point L9546-1(line 9546) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse7 (select .cse8 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse7 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse7) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|) .cse4 .cse5 .cse6) (and (<= 0 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1352#1|) .cse4 (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1352#1| 0) .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse7 (* 18446744073709551616 (div (+ (* (- 1) .cse7) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 .cse6 (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-13 22:58:33,044 INFO L895 garLoopResultBuilder]: At program point L9389-4(line 9389) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-13 22:58:33,044 INFO L899 garLoopResultBuilder]: For program point L9546-2(line 9546) no Hoare annotation was computed. [2022-07-13 22:58:33,045 INFO L899 garLoopResultBuilder]: For program point L9389-5(line 9389) no Hoare annotation was computed. [2022-07-13 22:58:33,045 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-07-13 22:58:33,045 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 22:58:33,045 INFO L899 garLoopResultBuilder]: For program point L9390(lines 9390 9398) no Hoare annotation was computed. [2022-07-13 22:58:33,045 INFO L902 garLoopResultBuilder]: At program point L9539(line 9539) the Hoare annotation is: true [2022-07-13 22:58:33,045 INFO L899 garLoopResultBuilder]: For program point L9539-1(lines 9539 9540) no Hoare annotation was computed. [2022-07-13 22:58:33,045 INFO L902 garLoopResultBuilder]: At program point L9539-2(line 9539) the Hoare annotation is: true [2022-07-13 22:58:33,045 INFO L899 garLoopResultBuilder]: For program point L9539-3(line 9539) no Hoare annotation was computed. [2022-07-13 22:58:33,045 INFO L899 garLoopResultBuilder]: For program point L9539-5(lines 9539 9540) no Hoare annotation was computed. [2022-07-13 22:58:33,045 INFO L895 garLoopResultBuilder]: At program point L9556(line 9556) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (<= 1 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1361#1|) (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1361#1| 1)) [2022-07-13 22:58:33,046 INFO L899 garLoopResultBuilder]: For program point L9556-1(line 9556) no Hoare annotation was computed. [2022-07-13 22:58:33,046 INFO L899 garLoopResultBuilder]: For program point L9399(lines 9399 9407) no Hoare annotation was computed. [2022-07-13 22:58:33,046 INFO L895 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse1) 18446744073709551616)) .cse1)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse1 (+ .cse6 (* 18446744073709551616 (div (+ (* (- 1) .cse6) 18446744073709551615 (* 18446744073709551616 (div .cse1 18446744073709551616))) 18446744073709551616)))) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-13 22:58:33,046 INFO L899 garLoopResultBuilder]: For program point L9548-1(lines 9548 9549) no Hoare annotation was computed. [2022-07-13 22:58:33,046 INFO L895 garLoopResultBuilder]: At program point L6600(lines 6598 6601) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2022-07-13 22:58:33,046 INFO L899 garLoopResultBuilder]: For program point L9548-3(lines 9548 9549) no Hoare annotation was computed. [2022-07-13 22:58:33,046 INFO L899 garLoopResultBuilder]: For program point L9548-4(lines 9548 9554) no Hoare annotation was computed. [2022-07-13 22:58:33,046 INFO L895 garLoopResultBuilder]: At program point L9548-6(lines 9548 9554) the Hoare annotation is: (let ((.cse5 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse4 (select .cse5 16))) (let ((.cse1 (<= .cse4 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse4) 18446744073709551616))))) (.cse2 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse0 (select .cse5 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse0) 18446744073709551616)) .cse0)) .cse1 .cse2 .cse3) (and .cse1 .cse2 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) (<= .cse0 (+ .cse4 (* 18446744073709551616 (div (+ (* (- 1) .cse4) 18446744073709551615 (* 18446744073709551616 (div .cse0 18446744073709551616))) 18446744073709551616)))) .cse3 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-07-13 22:58:33,047 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-13 22:58:33,047 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-13 22:58:33,047 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-13 22:58:33,047 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-13 22:58:33,047 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-13 22:58:33,047 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-13 22:58:33,049 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:58:33,051 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 22:58:33,072 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:58:33,073 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2022-07-13 22:58:33,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:58:33,075 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2022-07-13 22:58:33,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 10:58:33 BoogieIcfgContainer [2022-07-13 22:58:33,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 22:58:33,087 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 22:58:33,087 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 22:58:33,087 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 22:58:33,088 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:58:02" (3/4) ... [2022-07-13 22:58:33,090 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 22:58:33,094 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-07-13 22:58:33,094 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-13 22:58:33,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2022-07-13 22:58:33,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-13 22:58:33,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-07-13 22:58:33,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-13 22:58:33,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-13 22:58:33,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-13 22:58:33,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-13 22:58:33,095 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-07-13 22:58:33,107 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2022-07-13 22:58:33,112 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 59 nodes and edges [2022-07-13 22:58:33,113 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-07-13 22:58:33,114 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-13 22:58:33,115 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-13 22:58:33,115 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-13 22:58:33,116 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 22:58:33,117 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 22:58:33,142 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && !(\old(max_size) == 16) [2022-07-13 22:58:33,457 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 22:58:33,457 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 22:58:33,458 INFO L158 Benchmark]: Toolchain (without parser) took 33885.33ms. Allocated memory was 96.5MB in the beginning and 446.7MB in the end (delta: 350.2MB). Free memory was 68.6MB in the beginning and 318.1MB in the end (delta: -249.6MB). Peak memory consumption was 319.3MB. Max. memory is 16.1GB. [2022-07-13 22:58:33,458 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 74.4MB in the beginning and 74.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:58:33,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1743.21ms. Allocated memory was 96.5MB in the beginning and 155.2MB in the end (delta: 58.7MB). Free memory was 68.6MB in the beginning and 80.8MB in the end (delta: -12.3MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2022-07-13 22:58:33,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 163.10ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 69.0MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 22:58:33,459 INFO L158 Benchmark]: Boogie Preprocessor took 59.68ms. Allocated memory is still 155.2MB. Free memory was 69.0MB in the beginning and 97.6MB in the end (delta: -28.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 22:58:33,459 INFO L158 Benchmark]: RCFGBuilder took 1131.12ms. Allocated memory is still 155.2MB. Free memory was 97.6MB in the beginning and 58.4MB in the end (delta: 39.2MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. [2022-07-13 22:58:33,459 INFO L158 Benchmark]: TraceAbstraction took 30412.51ms. Allocated memory was 155.2MB in the beginning and 446.7MB in the end (delta: 291.5MB). Free memory was 57.4MB in the beginning and 184.3MB in the end (delta: -126.9MB). Peak memory consumption was 165.6MB. Max. memory is 16.1GB. [2022-07-13 22:58:33,460 INFO L158 Benchmark]: Witness Printer took 370.33ms. Allocated memory is still 446.7MB. Free memory was 184.3MB in the beginning and 318.1MB in the end (delta: -133.8MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. [2022-07-13 22:58:33,461 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.16ms. Allocated memory is still 96.5MB. Free memory was 74.4MB in the beginning and 74.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1743.21ms. Allocated memory was 96.5MB in the beginning and 155.2MB in the end (delta: 58.7MB). Free memory was 68.6MB in the beginning and 80.8MB in the end (delta: -12.3MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 163.10ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 69.0MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.68ms. Allocated memory is still 155.2MB. Free memory was 69.0MB in the beginning and 97.6MB in the end (delta: -28.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1131.12ms. Allocated memory is still 155.2MB. Free memory was 97.6MB in the beginning and 58.4MB in the end (delta: 39.2MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. * TraceAbstraction took 30412.51ms. Allocated memory was 155.2MB in the beginning and 446.7MB in the end (delta: 291.5MB). Free memory was 57.4MB in the beginning and 184.3MB in the end (delta: -126.9MB). Peak memory consumption was 165.6MB. Max. memory is 16.1GB. * Witness Printer took 370.33ms. Allocated memory is still 446.7MB. Free memory was 184.3MB in the beginning and 318.1MB in the end (delta: -133.8MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.3s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2209 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2075 mSDsluCounter, 12241 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1245 IncrementalHoareTripleChecker+Unchecked, 9461 mSDsCounter, 723 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9212 IncrementalHoareTripleChecker+Invalid, 11180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 723 mSolverCounterUnsat, 2780 mSDtfsCounter, 9212 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1994 GetRequests, 1659 SyntacticMatches, 31 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2063 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=13, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 175 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 440 PreInvPairs, 484 NumberOfFragments, 1592 HoareAnnotationTreeSize, 440 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 45 FomulaSimplificationsInter, 2964 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 2596 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2983 ConstructedInterpolants, 101 QuantifiedInterpolants, 16167 SizeOfPredicates, 78 NumberOfNonLiveVariables, 23635 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 31 InterpolantComputations, 14 PerfectInterpolantSequences, 1856/2033 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: 6598]: Loop Invariant Derived loop invariant: ((str == 0 && str == 0) && !(buf == 0)) && buf == 0 - InvariantResult [Line: 9558]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9386]: Loop Invariant [2022-07-13 22:58:33,471 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:58:33,471 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2022-07-13 22:58:33,472 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-13 22:58:33,472 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR Derived loop invariant: (((((str == 0 && 0 <= 18446744073709551616 * (-1 * unknown-#memory_int-unknown[buf][buf] / 18446744073709551616) + unknown-#memory_int-unknown[buf][buf]) && str == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(buf == 0)) && buf == 0) || ((((((((str == 0 && str == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(buf == 0)) && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR] == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16] + 18446744073709551616 * ((-1 * unknown-#memory_int-unknown[buf][16] + 18446744073709551615 + 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) / 18446744073709551616)) && buf == 0) && buf == buf) && buf == 0) - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: ((!(str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && !(\old(max_size) == 16) RESULT: Ultimate proved your program to be correct! [2022-07-13 22:58:33,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE