./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_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 376fa3967c5a16dbeae94f1517cf176a2f53d2660c6b5c3d2eeb4fd9f827337c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 09:36:32,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:36:32,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:36:32,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:36:32,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:36:32,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:36:32,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:36:32,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:36:32,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:36:32,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:36:32,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:36:32,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:36:32,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:36:32,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:36:32,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:36:32,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:36:32,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:36:32,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:36:32,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:36:32,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:36:32,304 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:36:32,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:36:32,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:36:32,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:36:32,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:36:32,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:36:32,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:36:32,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:36:32,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:36:32,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:36:32,313 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:36:32,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:36:32,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:36:32,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:36:32,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:36:32,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:36:32,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:36:32,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:36:32,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:36:32,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:36:32,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:36:32,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:36:32,321 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 09:36:32,350 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:36:32,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:36:32,352 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:36:32,352 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:36:32,353 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:36:32,353 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:36:32,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:36:32,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:36:32,354 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:36:32,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:36:32,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 09:36:32,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:36:32,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:36:32,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:36:32,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:36:32,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:36:32,355 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:36:32,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:36:32,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:36:32,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:36:32,356 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:36:32,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:36:32,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:36:32,357 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:36:32,357 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:36:32,357 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 09:36:32,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 09:36:32,357 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:36:32,357 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:36:32,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:36:32,358 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 -> 376fa3967c5a16dbeae94f1517cf176a2f53d2660c6b5c3d2eeb4fd9f827337c [2022-07-21 09:36:32,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:36:32,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:36:32,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:36:32,623 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:36:32,624 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:36:32,625 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i [2022-07-21 09:36:32,682 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe03cbbca/1b632c49783d460db306e60653d530e6/FLAG21f98099e [2022-07-21 09:36:33,326 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:36:33,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i [2022-07-21 09:36:33,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe03cbbca/1b632c49783d460db306e60653d530e6/FLAG21f98099e [2022-07-21 09:36:33,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe03cbbca/1b632c49783d460db306e60653d530e6 [2022-07-21 09:36:33,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:36:33,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:36:33,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:36:33,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:36:33,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:36:33,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:36:33" (1/1) ... [2022-07-21 09:36:33,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@406ce02c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:36:33, skipping insertion in model container [2022-07-21 09:36:33,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:36:33" (1/1) ... [2022-07-21 09:36:33,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:36:33,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:36:33,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i[4492,4505] [2022-07-21 09:36:33,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i[4552,4565] [2022-07-21 09:36:34,532 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:34,533 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:34,534 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:34,535 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:34,536 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:34,552 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:34,553 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:34,555 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:34,556 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:34,809 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-21 09:36:34,810 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-21 09:36:34,810 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-21 09:36:34,811 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-21 09:36:34,812 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-21 09:36:34,812 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-21 09:36:34,812 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-21 09:36:34,813 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-21 09:36:34,813 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-21 09:36:34,814 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-21 09:36:34,894 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-21 09:36:34,946 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:34,946 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:34,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:36:35,021 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:36:35,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i[4492,4505] [2022-07-21 09:36:35,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i[4552,4565] [2022-07-21 09:36:35,057 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:35,057 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:35,057 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:35,059 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:35,060 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:35,063 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:35,065 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:35,066 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:35,067 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:35,092 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-21 09:36:35,093 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-21 09:36:35,093 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-21 09:36:35,094 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-21 09:36:35,094 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-21 09:36:35,095 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-21 09:36:35,095 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-21 09:36:35,096 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-21 09:36:35,096 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-21 09:36:35,096 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-21 09:36:35,114 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-21 09:36:35,175 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:35,179 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:36:35,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:36:35,440 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:36:35,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:36:35 WrapperNode [2022-07-21 09:36:35,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:36:35,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:36:35,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:36:35,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:36:35,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:36:35" (1/1) ... [2022-07-21 09:36:35,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:36:35" (1/1) ... [2022-07-21 09:36:35,613 INFO L137 Inliner]: procedures = 691, calls = 2650, calls flagged for inlining = 60, calls inlined = 6, statements flattened = 873 [2022-07-21 09:36:35,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:36:35,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:36:35,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:36:35,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:36:35,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:36:35" (1/1) ... [2022-07-21 09:36:35,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:36:35" (1/1) ... [2022-07-21 09:36:35,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:36:35" (1/1) ... [2022-07-21 09:36:35,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:36:35" (1/1) ... [2022-07-21 09:36:35,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:36:35" (1/1) ... [2022-07-21 09:36:35,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:36:35" (1/1) ... [2022-07-21 09:36:35,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:36:35" (1/1) ... [2022-07-21 09:36:35,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:36:35,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:36:35,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:36:35,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:36:35,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:36:35" (1/1) ... [2022-07-21 09:36:35,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:36:35,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:36:35,732 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-21 09:36:35,764 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-21 09:36:35,775 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-21 09:36:35,775 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-21 09:36:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-21 09:36:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:36:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-21 09:36:35,776 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-21 09:36:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 09:36:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_bounded [2022-07-21 09:36:35,777 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_bounded [2022-07-21 09:36:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 09:36:35,777 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 09:36:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 09:36:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:36:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2022-07-21 09:36:35,779 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2022-07-21 09:36:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 09:36:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:36:35,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:36:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-21 09:36:35,780 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-21 09:36:35,780 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-21 09:36:35,780 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-21 09:36:35,780 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 09:36:35,780 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 09:36:35,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 09:36:35,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 09:36:35,781 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2022-07-21 09:36:35,781 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2022-07-21 09:36:35,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 09:36:35,782 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-21 09:36:35,782 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-21 09:36:35,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 09:36:35,782 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-07-21 09:36:35,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-07-21 09:36:35,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 09:36:36,114 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:36:36,118 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:36:36,814 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:36:36,819 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:36:36,819 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 09:36:36,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:36:36 BoogieIcfgContainer [2022-07-21 09:36:36,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:36:36,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:36:36,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:36:36,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:36:36,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:36:33" (1/3) ... [2022-07-21 09:36:36,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1522bc0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:36:36, skipping insertion in model container [2022-07-21 09:36:36,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:36:35" (2/3) ... [2022-07-21 09:36:36,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1522bc0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:36:36, skipping insertion in model container [2022-07-21 09:36:36,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:36:36" (3/3) ... [2022-07-21 09:36:36,825 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_eq_harness.i [2022-07-21 09:36:36,834 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:36:36,834 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:36:36,870 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:36:36,873 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@4dbdc64, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ee0301b [2022-07-21 09:36:36,874 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 09:36:36,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 82 states have internal predecessors, (100), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-07-21 09:36:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-21 09:36:36,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:36:36,886 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 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] [2022-07-21 09:36:36,886 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:36:36,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:36:36,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1846687754, now seen corresponding path program 1 times [2022-07-21 09:36:36,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:36:36,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582737247] [2022-07-21 09:36:36,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:36:36,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:36:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:36:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:36:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:36:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:36:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:36:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:36:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 09:36:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:36:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 09:36:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 09:36:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 09:36:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 09:36:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:36:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 09:36:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:36:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:36:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 09:36:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-21 09:36:37,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:36:37,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582737247] [2022-07-21 09:36:37,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582737247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:36:37,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:36:37,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:36:37,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526426271] [2022-07-21 09:36:37,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:36:37,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:36:37,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:36:37,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:36:37,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:36:37,578 INFO L87 Difference]: Start difference. First operand has 134 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 82 states have internal predecessors, (100), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 09:36:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:36:37,843 INFO L93 Difference]: Finished difference Result 267 states and 385 transitions. [2022-07-21 09:36:37,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 09:36:37,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 102 [2022-07-21 09:36:37,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:36:37,852 INFO L225 Difference]: With dead ends: 267 [2022-07-21 09:36:37,852 INFO L226 Difference]: Without dead ends: 131 [2022-07-21 09:36:37,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:36:37,857 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 102 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:36:37,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 196 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 09:36:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-21 09:36:37,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2022-07-21 09:36:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 77 states have internal predecessors, (92), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-07-21 09:36:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 171 transitions. [2022-07-21 09:36:37,891 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 171 transitions. Word has length 102 [2022-07-21 09:36:37,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:36:37,891 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 171 transitions. [2022-07-21 09:36:37,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 09:36:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 171 transitions. [2022-07-21 09:36:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-21 09:36:37,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:36:37,894 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 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] [2022-07-21 09:36:37,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 09:36:37,895 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:36:37,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:36:37,895 INFO L85 PathProgramCache]: Analyzing trace with hash -192509010, now seen corresponding path program 1 times [2022-07-21 09:36:37,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:36:37,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888951910] [2022-07-21 09:36:37,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:36:37,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:36:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:36:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:36:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:36:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:36:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:36:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:36:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 09:36:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:36:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 09:36:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 09:36:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 09:36:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 09:36:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 09:36:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 09:36:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:36:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:36:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 09:36:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-21 09:36:38,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:36:38,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888951910] [2022-07-21 09:36:38,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888951910] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:36:38,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655759260] [2022-07-21 09:36:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:36:38,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:36:38,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:36:38,205 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-21 09:36:38,206 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-21 09:36:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:38,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 2662 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 09:36:38,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:36:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-21 09:36:38,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:36:38,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655759260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:36:38,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:36:38,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-21 09:36:38,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943330106] [2022-07-21 09:36:38,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:36:38,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:36:38,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:36:38,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:36:38,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-21 09:36:38,877 INFO L87 Difference]: Start difference. First operand 128 states and 171 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-21 09:36:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:36:39,116 INFO L93 Difference]: Finished difference Result 252 states and 341 transitions. [2022-07-21 09:36:39,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:36:39,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 102 [2022-07-21 09:36:39,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:36:39,119 INFO L225 Difference]: With dead ends: 252 [2022-07-21 09:36:39,119 INFO L226 Difference]: Without dead ends: 131 [2022-07-21 09:36:39,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:36:39,120 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 186 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:36:39,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 337 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 09:36:39,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-21 09:36:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-21 09:36:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 78 states have (on average 1.205128205128205) internal successors, (94), 80 states have internal predecessors, (94), 40 states have call successors, (40), 11 states have call predecessors, (40), 12 states have return successors, (45), 39 states have call predecessors, (45), 39 states have call successors, (45) [2022-07-21 09:36:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 179 transitions. [2022-07-21 09:36:39,132 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 179 transitions. Word has length 102 [2022-07-21 09:36:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:36:39,133 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 179 transitions. [2022-07-21 09:36:39,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-21 09:36:39,133 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 179 transitions. [2022-07-21 09:36:39,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-21 09:36:39,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:36:39,135 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 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] [2022-07-21 09:36:39,160 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-21 09:36:39,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:36:39,357 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:36:39,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:36:39,357 INFO L85 PathProgramCache]: Analyzing trace with hash -49851437, now seen corresponding path program 1 times [2022-07-21 09:36:39,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:36:39,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866966204] [2022-07-21 09:36:39,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:36:39,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:36:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:36:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:36:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:36:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:36:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:36:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:36:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:36:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:36:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 09:36:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:36:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:36:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 09:36:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 09:36:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 09:36:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:36:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:36:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:36:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-21 09:36:39,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:36:39,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866966204] [2022-07-21 09:36:39,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866966204] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:36:39,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620407897] [2022-07-21 09:36:39,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:36:39,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:36:39,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:36:39,715 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-21 09:36:39,716 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-21 09:36:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 2667 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 09:36:40,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:36:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-21 09:36:40,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:36:40,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620407897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:36:40,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:36:40,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-21 09:36:40,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968202769] [2022-07-21 09:36:40,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:36:40,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:36:40,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:36:40,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:36:40,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-07-21 09:36:40,202 INFO L87 Difference]: Start difference. First operand 131 states and 179 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-21 09:36:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:36:40,408 INFO L93 Difference]: Finished difference Result 212 states and 290 transitions. [2022-07-21 09:36:40,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:36:40,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 104 [2022-07-21 09:36:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:36:40,411 INFO L225 Difference]: With dead ends: 212 [2022-07-21 09:36:40,411 INFO L226 Difference]: Without dead ends: 131 [2022-07-21 09:36:40,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2022-07-21 09:36:40,412 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 206 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:36:40,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 537 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 09:36:40,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-21 09:36:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-21 09:36:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 78 states have (on average 1.205128205128205) internal successors, (94), 80 states have internal predecessors, (94), 40 states have call successors, (40), 11 states have call predecessors, (40), 12 states have return successors, (43), 39 states have call predecessors, (43), 39 states have call successors, (43) [2022-07-21 09:36:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 177 transitions. [2022-07-21 09:36:40,422 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 177 transitions. Word has length 104 [2022-07-21 09:36:40,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:36:40,422 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 177 transitions. [2022-07-21 09:36:40,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-21 09:36:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 177 transitions. [2022-07-21 09:36:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-21 09:36:40,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:36:40,424 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 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-21 09:36:40,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-21 09:36:40,644 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,SelfDestructingSolverStorable2 [2022-07-21 09:36:40,645 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:36:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:36:40,645 INFO L85 PathProgramCache]: Analyzing trace with hash 160212765, now seen corresponding path program 2 times [2022-07-21 09:36:40,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:36:40,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619289537] [2022-07-21 09:36:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:36:40,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:36:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:36:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:36:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:36:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:36:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:36:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:36:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:36:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:36:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 09:36:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:36:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:36:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:36:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 09:36:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:36:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:36:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:36:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 09:36:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-21 09:36:40,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:36:40,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619289537] [2022-07-21 09:36:40,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619289537] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:36:40,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979607416] [2022-07-21 09:36:40,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 09:36:40,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:36:40,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:36:40,966 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-21 09:36:40,967 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-21 09:36:41,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 09:36:41,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:36:41,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 2314 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 09:36:41,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:36:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-21 09:36:41,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:36:41,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979607416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:36:41,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:36:41,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-07-21 09:36:41,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754875041] [2022-07-21 09:36:41,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:36:41,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:36:41,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:36:41,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:36:41,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:36:41,360 INFO L87 Difference]: Start difference. First operand 131 states and 177 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-21 09:36:41,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:36:41,418 INFO L93 Difference]: Finished difference Result 143 states and 196 transitions. [2022-07-21 09:36:41,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:36:41,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2022-07-21 09:36:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:36:41,421 INFO L225 Difference]: With dead ends: 143 [2022-07-21 09:36:41,421 INFO L226 Difference]: Without dead ends: 141 [2022-07-21 09:36:41,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-21 09:36:41,422 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 16 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:36:41,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1166 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 09:36:41,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-21 09:36:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2022-07-21 09:36:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 87 states have internal predecessors, (100), 41 states have call successors, (41), 12 states have call predecessors, (41), 14 states have return successors, (52), 40 states have call predecessors, (52), 40 states have call successors, (52) [2022-07-21 09:36:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 193 transitions. [2022-07-21 09:36:41,432 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 193 transitions. Word has length 108 [2022-07-21 09:36:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:36:41,432 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 193 transitions. [2022-07-21 09:36:41,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-21 09:36:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 193 transitions. [2022-07-21 09:36:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-21 09:36:41,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:36:41,434 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:36:41,470 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-21 09:36:41,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:36:41,654 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:36:41,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:36:41,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1574940187, now seen corresponding path program 1 times [2022-07-21 09:36:41,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:36:41,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50045764] [2022-07-21 09:36:41,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:36:41,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:36:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:36:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:36:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:36:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:36:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:36:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:36:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:36:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:36:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 09:36:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:36:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:36:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:36:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 09:36:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:36:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:36:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:36:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 09:36:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-21 09:36:41,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:36:41,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50045764] [2022-07-21 09:36:41,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50045764] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:36:41,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010356888] [2022-07-21 09:36:41,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:36:41,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:36:41,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:36:41,924 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-21 09:36:41,925 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-21 09:36:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:42,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 2689 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 09:36:42,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:36:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-21 09:36:42,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:36:42,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010356888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:36:42,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:36:42,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-21 09:36:42,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574043503] [2022-07-21 09:36:42,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:36:42,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:36:42,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:36:42,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:36:42,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:36:42,418 INFO L87 Difference]: Start difference. First operand 140 states and 193 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-21 09:36:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:36:42,609 INFO L93 Difference]: Finished difference Result 245 states and 337 transitions. [2022-07-21 09:36:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:36:42,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 112 [2022-07-21 09:36:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:36:42,611 INFO L225 Difference]: With dead ends: 245 [2022-07-21 09:36:42,611 INFO L226 Difference]: Without dead ends: 137 [2022-07-21 09:36:42,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-07-21 09:36:42,612 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 205 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:36:42,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 540 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:36:42,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-21 09:36:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-07-21 09:36:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (48), 40 states have call predecessors, (48), 40 states have call successors, (48) [2022-07-21 09:36:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 186 transitions. [2022-07-21 09:36:42,620 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 186 transitions. Word has length 112 [2022-07-21 09:36:42,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:36:42,621 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 186 transitions. [2022-07-21 09:36:42,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-21 09:36:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 186 transitions. [2022-07-21 09:36:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-21 09:36:42,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:36:42,622 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 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] [2022-07-21 09:36:42,643 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-21 09:36:42,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:36:42,839 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:36:42,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:36:42,840 INFO L85 PathProgramCache]: Analyzing trace with hash 660367434, now seen corresponding path program 1 times [2022-07-21 09:36:42,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:36:42,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216137941] [2022-07-21 09:36:42,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:36:42,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:36:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:36:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:36:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:36:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:36:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:36:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:36:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:36:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:36:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 09:36:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:36:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:36:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:36:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 09:36:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 09:36:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:36:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:36:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 09:36:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-21 09:36:43,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:36:43,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216137941] [2022-07-21 09:36:43,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216137941] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:36:43,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436215043] [2022-07-21 09:36:43,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:36:43,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:36:43,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:36:43,359 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-21 09:36:43,383 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-21 09:36:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:36:43,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 2694 conjuncts, 129 conjunts are in the unsatisfiable core [2022-07-21 09:36:43,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:36:44,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:36:44,148 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 09:36:44,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-07-21 09:36:44,916 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 09:36:44,916 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 35 treesize of output 15 [2022-07-21 09:36:44,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-21 09:36:44,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-21 09:36:45,131 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 28 proven. 68 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 09:36:45,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:36:58,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2022-07-21 09:36:58,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2022-07-21 09:37:00,410 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 Int) (|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|))) (let ((.cse0 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| (store (store (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| .cse1) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset|) v_ArrVal_401)) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|) 18446744073709551616))) (or (and (not (= .cse0 0)) (<= 0 |c_#StackHeapBarrier|)) (= .cse0 (mod .cse1 18446744073709551616)))))) is different from false [2022-07-21 09:37:00,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436215043] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:37:00,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:37:00,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24] total 34 [2022-07-21 09:37:00,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806636593] [2022-07-21 09:37:00,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:37:00,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-21 09:37:00,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:37:00,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-21 09:37:00,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2269, Unknown=6, NotChecked=96, Total=2550 [2022-07-21 09:37:00,433 INFO L87 Difference]: Start difference. First operand 137 states and 186 transitions. Second operand has 34 states, 29 states have (on average 4.0) internal successors, (116), 30 states have internal predecessors, (116), 13 states have call successors, (35), 8 states have call predecessors, (35), 12 states have return successors, (34), 9 states have call predecessors, (34), 13 states have call successors, (34) [2022-07-21 09:37:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:37:05,561 INFO L93 Difference]: Finished difference Result 402 states and 549 transitions. [2022-07-21 09:37:05,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-07-21 09:37:05,563 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 4.0) internal successors, (116), 30 states have internal predecessors, (116), 13 states have call successors, (35), 8 states have call predecessors, (35), 12 states have return successors, (34), 9 states have call predecessors, (34), 13 states have call successors, (34) Word has length 114 [2022-07-21 09:37:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:37:05,569 INFO L225 Difference]: With dead ends: 402 [2022-07-21 09:37:05,569 INFO L226 Difference]: Without dead ends: 307 [2022-07-21 09:37:05,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 181 SyntacticMatches, 10 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2517 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=853, Invalid=8651, Unknown=6, NotChecked=192, Total=9702 [2022-07-21 09:37:05,573 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 419 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 4773 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 5681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 4773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 601 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:37:05,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1415 Invalid, 5681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 4773 Invalid, 0 Unknown, 601 Unchecked, 3.0s Time] [2022-07-21 09:37:05,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-07-21 09:37:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 266. [2022-07-21 09:37:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 165 states have (on average 1.1696969696969697) internal successors, (193), 169 states have internal predecessors, (193), 73 states have call successors, (73), 24 states have call predecessors, (73), 27 states have return successors, (86), 72 states have call predecessors, (86), 71 states have call successors, (86) [2022-07-21 09:37:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 352 transitions. [2022-07-21 09:37:05,603 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 352 transitions. Word has length 114 [2022-07-21 09:37:05,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:37:05,604 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 352 transitions. [2022-07-21 09:37:05,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 4.0) internal successors, (116), 30 states have internal predecessors, (116), 13 states have call successors, (35), 8 states have call predecessors, (35), 12 states have return successors, (34), 9 states have call predecessors, (34), 13 states have call successors, (34) [2022-07-21 09:37:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 352 transitions. [2022-07-21 09:37:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-21 09:37:05,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:37:05,607 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2022-07-21 09:37:05,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-21 09:37:05,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:37:05,844 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:37:05,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:37:05,845 INFO L85 PathProgramCache]: Analyzing trace with hash -448097721, now seen corresponding path program 1 times [2022-07-21 09:37:05,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:37:05,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468924948] [2022-07-21 09:37:05,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:37:05,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:37:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:37:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:37:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:37:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:37:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:37:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:37:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:37:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:37:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 09:37:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:37:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:37:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 09:37:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 09:37:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 09:37:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 09:37:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:37:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:37:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 09:37:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-21 09:37:06,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:37:06,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468924948] [2022-07-21 09:37:06,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468924948] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:37:06,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141002] [2022-07-21 09:37:06,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:37:06,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:37:06,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:37:06,403 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-21 09:37:06,459 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-21 09:37:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:06,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 2751 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 09:37:06,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:37:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-21 09:37:06,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:37:06,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:37:06,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:37:06,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 21 [2022-07-21 09:37:06,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796628566] [2022-07-21 09:37:06,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:37:06,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:37:06,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:37:06,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:37:06,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-07-21 09:37:06,958 INFO L87 Difference]: Start difference. First operand 266 states and 352 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-21 09:37:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:37:07,110 INFO L93 Difference]: Finished difference Result 363 states and 488 transitions. [2022-07-21 09:37:07,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:37:07,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 125 [2022-07-21 09:37:07,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:37:07,113 INFO L225 Difference]: With dead ends: 363 [2022-07-21 09:37:07,113 INFO L226 Difference]: Without dead ends: 276 [2022-07-21 09:37:07,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2022-07-21 09:37:07,115 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 12 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:37:07,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1267 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:37:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-07-21 09:37:07,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 271. [2022-07-21 09:37:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 169 states have (on average 1.165680473372781) internal successors, (197), 174 states have internal predecessors, (197), 73 states have call successors, (73), 24 states have call predecessors, (73), 28 states have return successors, (94), 72 states have call predecessors, (94), 71 states have call successors, (94) [2022-07-21 09:37:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 364 transitions. [2022-07-21 09:37:07,139 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 364 transitions. Word has length 125 [2022-07-21 09:37:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:37:07,140 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 364 transitions. [2022-07-21 09:37:07,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-21 09:37:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 364 transitions. [2022-07-21 09:37:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-21 09:37:07,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:37:07,143 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:37:07,181 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-21 09:37:07,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:37:07,362 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:37:07,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:37:07,362 INFO L85 PathProgramCache]: Analyzing trace with hash -276342452, now seen corresponding path program 1 times [2022-07-21 09:37:07,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:37:07,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024529000] [2022-07-21 09:37:07,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:37:07,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:37:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:07,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:37:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:07,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:37:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:07,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:37:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:07,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:37:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:07,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:37:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:07,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:37:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:07,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:37:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:07,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:37:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:07,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 09:37:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:08,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:37:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:08,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:37:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:08,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 09:37:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:08,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:37:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:08,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 09:37:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:08,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 09:37:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:08,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:37:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:08,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:37:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:08,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 09:37:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-21 09:37:08,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:37:08,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024529000] [2022-07-21 09:37:08,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024529000] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:37:08,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497089171] [2022-07-21 09:37:08,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:37:08,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:37:08,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:37:08,168 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-21 09:37:08,169 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-21 09:37:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:08,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 2756 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 09:37:08,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:37:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-21 09:37:08,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:37:08,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497089171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:37:08,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:37:08,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [22] total 24 [2022-07-21 09:37:08,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622242431] [2022-07-21 09:37:08,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:37:08,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:37:08,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:37:08,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:37:08,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-07-21 09:37:08,687 INFO L87 Difference]: Start difference. First operand 271 states and 364 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 09:37:08,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:37:08,840 INFO L93 Difference]: Finished difference Result 459 states and 630 transitions. [2022-07-21 09:37:08,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 09:37:08,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 127 [2022-07-21 09:37:08,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:37:08,842 INFO L225 Difference]: With dead ends: 459 [2022-07-21 09:37:08,842 INFO L226 Difference]: Without dead ends: 276 [2022-07-21 09:37:08,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-07-21 09:37:08,843 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 15 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:37:08,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 599 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2022-07-21 09:37:08,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-07-21 09:37:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 271. [2022-07-21 09:37:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 169 states have (on average 1.1538461538461537) internal successors, (195), 174 states have internal predecessors, (195), 73 states have call successors, (73), 24 states have call predecessors, (73), 28 states have return successors, (94), 72 states have call predecessors, (94), 71 states have call successors, (94) [2022-07-21 09:37:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 362 transitions. [2022-07-21 09:37:08,855 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 362 transitions. Word has length 127 [2022-07-21 09:37:08,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:37:08,856 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 362 transitions. [2022-07-21 09:37:08,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 09:37:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 362 transitions. [2022-07-21 09:37:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-21 09:37:08,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:37:08,857 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:37:08,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 09:37:09,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:37:09,078 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:37:09,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:37:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash 284357326, now seen corresponding path program 1 times [2022-07-21 09:37:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:37:09,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881056644] [2022-07-21 09:37:09,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:37:09,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:37:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:37:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:37:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:37:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:37:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:37:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:37:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:37:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:37:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 09:37:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:37:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:37:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 09:37:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:37:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 09:37:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 09:37:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:37:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:37:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 09:37:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-21 09:37:09,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:37:09,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881056644] [2022-07-21 09:37:09,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881056644] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:37:09,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454792384] [2022-07-21 09:37:09,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:37:09,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:37:09,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:37:09,752 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-21 09:37:09,754 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-21 09:37:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:10,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 2761 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 09:37:10,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:37:10,408 INFO L356 Elim1Store]: treesize reduction 70, result has 26.3 percent of original size [2022-07-21 09:37:10,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 45 [2022-07-21 09:37:10,500 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 09:37:10,500 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 44 treesize of output 24 [2022-07-21 09:37:10,574 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 76 proven. 8 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-21 09:37:10,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:37:10,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-21 09:37:10,887 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-21 09:37:10,887 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 30 treesize of output 25 [2022-07-21 09:37:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-21 09:37:10,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454792384] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:37:10,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:37:10,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 11] total 31 [2022-07-21 09:37:10,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113683051] [2022-07-21 09:37:10,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:37:10,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-21 09:37:10,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:37:10,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-21 09:37:10,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2022-07-21 09:37:10,908 INFO L87 Difference]: Start difference. First operand 271 states and 362 transitions. Second operand has 31 states, 28 states have (on average 4.357142857142857) internal successors, (122), 29 states have internal predecessors, (122), 15 states have call successors, (45), 7 states have call predecessors, (45), 10 states have return successors, (44), 12 states have call predecessors, (44), 15 states have call successors, (44) [2022-07-21 09:37:17,442 WARN L233 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 40 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 09:37:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:37:23,660 INFO L93 Difference]: Finished difference Result 640 states and 909 transitions. [2022-07-21 09:37:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-21 09:37:23,661 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 4.357142857142857) internal successors, (122), 29 states have internal predecessors, (122), 15 states have call successors, (45), 7 states have call predecessors, (45), 10 states have return successors, (44), 12 states have call predecessors, (44), 15 states have call successors, (44) Word has length 127 [2022-07-21 09:37:23,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:37:23,663 INFO L225 Difference]: With dead ends: 640 [2022-07-21 09:37:23,663 INFO L226 Difference]: Without dead ends: 500 [2022-07-21 09:37:23,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 274 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=362, Invalid=3543, Unknown=1, NotChecked=0, Total=3906 [2022-07-21 09:37:23,664 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 352 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 3485 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 4535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 3485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 748 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:37:23,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1030 Invalid, 4535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 3485 Invalid, 0 Unknown, 748 Unchecked, 2.2s Time] [2022-07-21 09:37:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-07-21 09:37:23,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 341. [2022-07-21 09:37:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 211 states have (on average 1.1516587677725119) internal successors, (243), 215 states have internal predecessors, (243), 97 states have call successors, (97), 29 states have call predecessors, (97), 32 states have return successors, (123), 96 states have call predecessors, (123), 95 states have call successors, (123) [2022-07-21 09:37:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 463 transitions. [2022-07-21 09:37:23,686 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 463 transitions. Word has length 127 [2022-07-21 09:37:23,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:37:23,687 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 463 transitions. [2022-07-21 09:37:23,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 4.357142857142857) internal successors, (122), 29 states have internal predecessors, (122), 15 states have call successors, (45), 7 states have call predecessors, (45), 10 states have return successors, (44), 12 states have call predecessors, (44), 15 states have call successors, (44) [2022-07-21 09:37:23,687 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 463 transitions. [2022-07-21 09:37:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-21 09:37:23,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:37:23,688 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:37:23,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 09:37:23,903 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,SelfDestructingSolverStorable8 [2022-07-21 09:37:23,903 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:37:23,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:37:23,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2040741793, now seen corresponding path program 1 times [2022-07-21 09:37:23,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:37:23,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437853511] [2022-07-21 09:37:23,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:37:23,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:37:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:37:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:37:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:37:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:37:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:37:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 09:37:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 09:37:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 09:37:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 09:37:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 09:37:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 09:37:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 09:37:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 09:37:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 09:37:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:37:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:37:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 09:37:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-21 09:37:24,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:37:24,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437853511] [2022-07-21 09:37:24,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437853511] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:37:24,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168154604] [2022-07-21 09:37:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:37:24,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:37:24,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:37:24,213 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-21 09:37:24,214 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-21 09:37:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:24,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 2728 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 09:37:24,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:37:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-21 09:37:24,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:37:24,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168154604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:37:24,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:37:24,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-21 09:37:24,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625497827] [2022-07-21 09:37:24,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:37:24,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:37:24,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:37:24,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:37:24,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-21 09:37:24,657 INFO L87 Difference]: Start difference. First operand 341 states and 463 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-21 09:37:24,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:37:24,787 INFO L93 Difference]: Finished difference Result 512 states and 695 transitions. [2022-07-21 09:37:24,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:37:24,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 124 [2022-07-21 09:37:24,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:37:24,790 INFO L225 Difference]: With dead ends: 512 [2022-07-21 09:37:24,790 INFO L226 Difference]: Without dead ends: 346 [2022-07-21 09:37:24,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-21 09:37:24,792 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 11 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:37:24,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1253 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:37:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-21 09:37:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 341. [2022-07-21 09:37:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 211 states have (on average 1.1516587677725119) internal successors, (243), 215 states have internal predecessors, (243), 97 states have call successors, (97), 29 states have call predecessors, (97), 32 states have return successors, (121), 96 states have call predecessors, (121), 95 states have call successors, (121) [2022-07-21 09:37:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 461 transitions. [2022-07-21 09:37:24,813 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 461 transitions. Word has length 124 [2022-07-21 09:37:24,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:37:24,813 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 461 transitions. [2022-07-21 09:37:24,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-21 09:37:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 461 transitions. [2022-07-21 09:37:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-21 09:37:24,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:37:24,815 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:37:24,847 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-21 09:37:25,036 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,SelfDestructingSolverStorable9 [2022-07-21 09:37:25,037 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:37:25,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:37:25,037 INFO L85 PathProgramCache]: Analyzing trace with hash -153440338, now seen corresponding path program 2 times [2022-07-21 09:37:25,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:37:25,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427507677] [2022-07-21 09:37:25,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:37:25,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:37:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:37:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:37:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:37:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:37:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:37:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:37:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:37:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:37:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:37:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 09:37:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 09:37:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 09:37:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:37:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 09:37:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 09:37:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:37:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:37:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 09:37:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-07-21 09:37:25,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:37:25,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427507677] [2022-07-21 09:37:25,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427507677] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:37:25,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107336524] [2022-07-21 09:37:25,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 09:37:25,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:37:25,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:37:25,812 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:37:25,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 09:37:26,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 09:37:26,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:37:26,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 2761 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-21 09:37:26,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:37:26,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 09:37:27,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 09:37:27,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-21 09:37:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-21 09:37:27,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:37:27,296 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_961 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|) 18446744073709551616) 0)) is different from false [2022-07-21 09:37:27,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107336524] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:37:27,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:37:27,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2022-07-21 09:37:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89617234] [2022-07-21 09:37:27,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:37:27,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-21 09:37:27,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:37:27,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-21 09:37:27,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=727, Unknown=1, NotChecked=54, Total=870 [2022-07-21 09:37:27,302 INFO L87 Difference]: Start difference. First operand 341 states and 461 transitions. Second operand has 27 states, 23 states have (on average 4.304347826086956) internal successors, (99), 23 states have internal predecessors, (99), 11 states have call successors, (37), 5 states have call predecessors, (37), 8 states have return successors, (36), 9 states have call predecessors, (36), 11 states have call successors, (36) [2022-07-21 09:37:31,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:37:31,773 INFO L93 Difference]: Finished difference Result 695 states and 1014 transitions. [2022-07-21 09:37:31,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 09:37:31,774 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 4.304347826086956) internal successors, (99), 23 states have internal predecessors, (99), 11 states have call successors, (37), 5 states have call predecessors, (37), 8 states have return successors, (36), 9 states have call predecessors, (36), 11 states have call successors, (36) Word has length 127 [2022-07-21 09:37:31,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:37:31,777 INFO L225 Difference]: With dead ends: 695 [2022-07-21 09:37:31,778 INFO L226 Difference]: Without dead ends: 534 [2022-07-21 09:37:31,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 235 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=316, Invalid=2443, Unknown=1, NotChecked=102, Total=2862 [2022-07-21 09:37:31,779 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 442 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 4517 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 5380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 4517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:37:31,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 882 Invalid, 5380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 4517 Invalid, 0 Unknown, 346 Unchecked, 3.6s Time] [2022-07-21 09:37:31,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-07-21 09:37:31,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 400. [2022-07-21 09:37:31,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 240 states have (on average 1.1458333333333333) internal successors, (275), 242 states have internal predecessors, (275), 127 states have call successors, (127), 31 states have call predecessors, (127), 32 states have return successors, (161), 126 states have call predecessors, (161), 125 states have call successors, (161) [2022-07-21 09:37:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 563 transitions. [2022-07-21 09:37:31,808 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 563 transitions. Word has length 127 [2022-07-21 09:37:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:37:31,808 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 563 transitions. [2022-07-21 09:37:31,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 4.304347826086956) internal successors, (99), 23 states have internal predecessors, (99), 11 states have call successors, (37), 5 states have call predecessors, (37), 8 states have return successors, (36), 9 states have call predecessors, (36), 11 states have call successors, (36) [2022-07-21 09:37:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 563 transitions. [2022-07-21 09:37:31,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-21 09:37:31,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:37:31,810 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1] [2022-07-21 09:37:31,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 09:37:32,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-21 09:37:32,030 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:37:32,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:37:32,031 INFO L85 PathProgramCache]: Analyzing trace with hash -2001210328, now seen corresponding path program 2 times [2022-07-21 09:37:32,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:37:32,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090547847] [2022-07-21 09:37:32,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:37:32,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:37:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:37:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:37:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:37:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:37:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:37:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:37:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:37:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 09:37:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:37:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:37:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 09:37:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:37:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 09:37:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:37:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:37:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:37:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 09:37:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-21 09:37:32,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:37:32,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090547847] [2022-07-21 09:37:32,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090547847] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:37:32,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013706661] [2022-07-21 09:37:32,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 09:37:32,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:37:32,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:37:32,462 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:37:32,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 09:37:33,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 09:37:33,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:37:33,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 2738 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-21 09:37:33,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:37:33,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 09:37:33,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:37:33,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-07-21 09:37:34,314 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_10|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_12|) 0)) (not (= |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_12| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_10|)))) is different from true [2022-07-21 09:37:35,137 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_11| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_13| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_11|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_11|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_13|) 0)))) is different from true [2022-07-21 09:37:35,929 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_14| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_12|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_12|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_14|) 0)))) is different from true [2022-07-21 09:37:36,736 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_15| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_15| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_13|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_13|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_15|) 0)))) is different from true [2022-07-21 09:37:36,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-21 09:37:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 0 refuted. 16 times theorem prover too weak. 31 trivial. 11 not checked. [2022-07-21 09:37:36,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:37:41,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2022-07-21 09:37:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-07-21 09:37:41,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013706661] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 09:37:41,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:37:41,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 14] total 31 [2022-07-21 09:37:41,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642610452] [2022-07-21 09:37:41,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:37:41,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:37:41,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:37:41,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:37:41,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=633, Unknown=4, NotChecked=212, Total=930 [2022-07-21 09:37:41,276 INFO L87 Difference]: Start difference. First operand 400 states and 563 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 7 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-07-21 09:37:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:37:41,808 INFO L93 Difference]: Finished difference Result 630 states and 938 transitions. [2022-07-21 09:37:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:37:41,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 7 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) Word has length 126 [2022-07-21 09:37:41,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:37:41,812 INFO L225 Difference]: With dead ends: 630 [2022-07-21 09:37:41,812 INFO L226 Difference]: Without dead ends: 517 [2022-07-21 09:37:41,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 262 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=97, Invalid=785, Unknown=4, NotChecked=236, Total=1122 [2022-07-21 09:37:41,818 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 86 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:37:41,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1369 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 397 Invalid, 0 Unknown, 165 Unchecked, 0.4s Time] [2022-07-21 09:37:41,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-07-21 09:37:41,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 426. [2022-07-21 09:37:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 252 states have (on average 1.1428571428571428) internal successors, (288), 257 states have internal predecessors, (288), 138 states have call successors, (138), 32 states have call predecessors, (138), 35 states have return successors, (181), 136 states have call predecessors, (181), 136 states have call successors, (181) [2022-07-21 09:37:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 607 transitions. [2022-07-21 09:37:41,855 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 607 transitions. Word has length 126 [2022-07-21 09:37:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:37:41,857 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 607 transitions. [2022-07-21 09:37:41,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 7 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-07-21 09:37:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 607 transitions. [2022-07-21 09:37:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-21 09:37:41,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:37:41,887 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2022-07-21 09:37:41,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 09:37:42,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-21 09:37:42,108 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:37:42,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:37:42,108 INFO L85 PathProgramCache]: Analyzing trace with hash -966185318, now seen corresponding path program 1 times [2022-07-21 09:37:42,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:37:42,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101305425] [2022-07-21 09:37:42,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:37:42,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:37:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:37:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:37:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:37:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:37:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:37:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:37:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:37:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 09:37:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:37:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:37:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 09:37:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:37:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 09:37:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:37:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:37:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:37:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 09:37:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,447 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-07-21 09:37:42,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:37:42,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101305425] [2022-07-21 09:37:42,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101305425] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:37:42,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588851156] [2022-07-21 09:37:42,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:37:42,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:37:42,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:37:42,450 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:37:42,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 09:37:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:42,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 2741 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-21 09:37:42,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:37:43,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:37:43,120 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 09:37:43,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 37 [2022-07-21 09:37:43,599 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 09:37:43,599 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 40 treesize of output 20 [2022-07-21 09:37:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 46 proven. 42 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-21 09:37:43,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:37:45,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-21 09:37:45,595 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-21 09:37:45,595 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 31 treesize of output 26 [2022-07-21 09:37:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-07-21 09:37:45,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588851156] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:37:45,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:37:45,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 13] total 31 [2022-07-21 09:37:45,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177348704] [2022-07-21 09:37:45,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:37:45,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-21 09:37:45,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:37:45,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-21 09:37:45,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=842, Unknown=1, NotChecked=0, Total=930 [2022-07-21 09:37:45,615 INFO L87 Difference]: Start difference. First operand 426 states and 607 transitions. Second operand has 31 states, 28 states have (on average 4.428571428571429) internal successors, (124), 29 states have internal predecessors, (124), 16 states have call successors, (45), 7 states have call predecessors, (45), 8 states have return successors, (44), 13 states have call predecessors, (44), 16 states have call successors, (44) [2022-07-21 09:37:48,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:37:48,136 INFO L93 Difference]: Finished difference Result 684 states and 976 transitions. [2022-07-21 09:37:48,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-21 09:37:48,137 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 4.428571428571429) internal successors, (124), 29 states have internal predecessors, (124), 16 states have call successors, (45), 7 states have call predecessors, (45), 8 states have return successors, (44), 13 states have call predecessors, (44), 16 states have call successors, (44) Word has length 127 [2022-07-21 09:37:48,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:37:48,142 INFO L225 Difference]: With dead ends: 684 [2022-07-21 09:37:48,142 INFO L226 Difference]: Without dead ends: 572 [2022-07-21 09:37:48,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 257 SyntacticMatches, 15 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=324, Invalid=2645, Unknown=1, NotChecked=0, Total=2970 [2022-07-21 09:37:48,145 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 174 mSDsluCounter, 2254 mSDsCounter, 0 mSdLazyCounter, 2916 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 3622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 634 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:37:48,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 2482 Invalid, 3622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2916 Invalid, 0 Unknown, 634 Unchecked, 1.6s Time] [2022-07-21 09:37:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-07-21 09:37:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 477. [2022-07-21 09:37:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 295 states have (on average 1.1423728813559322) internal successors, (337), 302 states have internal predecessors, (337), 138 states have call successors, (138), 38 states have call predecessors, (138), 43 states have return successors, (176), 136 states have call predecessors, (176), 136 states have call successors, (176) [2022-07-21 09:37:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 651 transitions. [2022-07-21 09:37:48,199 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 651 transitions. Word has length 127 [2022-07-21 09:37:48,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:37:48,200 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 651 transitions. [2022-07-21 09:37:48,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 4.428571428571429) internal successors, (124), 29 states have internal predecessors, (124), 16 states have call successors, (45), 7 states have call predecessors, (45), 8 states have return successors, (44), 13 states have call predecessors, (44), 16 states have call successors, (44) [2022-07-21 09:37:48,201 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 651 transitions. [2022-07-21 09:37:48,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-21 09:37:48,203 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:37:48,203 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2022-07-21 09:37:48,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-21 09:37:48,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 09:37:48,424 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:37:48,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:37:48,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1375009543, now seen corresponding path program 1 times [2022-07-21 09:37:48,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:37:48,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130508690] [2022-07-21 09:37:48,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:37:48,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:37:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:37:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:37:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:37:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:37:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:37:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:37:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:37:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 09:37:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:37:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 09:37:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 09:37:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 09:37:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 09:37:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:37:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:37:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:37:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 09:37:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-21 09:37:48,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:37:48,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130508690] [2022-07-21 09:37:48,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130508690] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:37:48,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19290443] [2022-07-21 09:37:48,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:37:48,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:37:48,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:37:48,856 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:37:48,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-21 09:37:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:37:49,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 2742 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-21 09:37:49,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:37:50,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:37:50,083 INFO L356 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2022-07-21 09:37:50,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 40 [2022-07-21 09:37:50,087 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 17 treesize of output 13 [2022-07-21 09:37:50,090 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 17 treesize of output 13 [2022-07-21 09:37:50,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-07-21 09:37:50,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2022-07-21 09:37:50,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-21 09:37:50,180 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 09:37:50,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-21 09:37:50,242 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 09:37:50,242 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 35 treesize of output 19 [2022-07-21 09:37:50,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-21 09:37:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-21 09:37:50,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:37:51,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-21 09:37:51,100 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-21 09:37:51,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-21 09:37:51,316 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 09:37:51,316 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 51 treesize of output 54 [2022-07-21 09:37:51,325 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 09:37:51,325 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 42 [2022-07-21 09:37:51,414 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-21 09:37:51,415 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 30 treesize of output 29 [2022-07-21 09:37:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-21 09:37:51,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19290443] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:37:51,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:37:51,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 15] total 42 [2022-07-21 09:37:51,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746624211] [2022-07-21 09:37:51,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:37:51,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-21 09:37:51,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:37:51,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-21 09:37:51,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1530, Unknown=0, NotChecked=0, Total=1722 [2022-07-21 09:37:51,460 INFO L87 Difference]: Start difference. First operand 477 states and 651 transitions. Second operand has 42 states, 40 states have (on average 3.8) internal successors, (152), 40 states have internal predecessors, (152), 14 states have call successors, (46), 8 states have call predecessors, (46), 12 states have return successors, (45), 12 states have call predecessors, (45), 14 states have call successors, (45) [2022-07-21 09:38:17,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:38:17,371 INFO L93 Difference]: Finished difference Result 1107 states and 1594 transitions. [2022-07-21 09:38:17,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-07-21 09:38:17,372 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 3.8) internal successors, (152), 40 states have internal predecessors, (152), 14 states have call successors, (46), 8 states have call predecessors, (46), 12 states have return successors, (45), 12 states have call predecessors, (45), 14 states have call successors, (45) Word has length 127 [2022-07-21 09:38:17,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:38:17,375 INFO L225 Difference]: With dead ends: 1107 [2022-07-21 09:38:17,375 INFO L226 Difference]: Without dead ends: 894 [2022-07-21 09:38:17,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 261 SyntacticMatches, 5 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3182 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=1385, Invalid=9524, Unknown=11, NotChecked=0, Total=10920 [2022-07-21 09:38:17,379 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 617 mSDsluCounter, 4278 mSDsCounter, 0 mSdLazyCounter, 12687 mSolverCounterSat, 770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 4648 SdHoareTripleChecker+Invalid, 14468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 770 IncrementalHoareTripleChecker+Valid, 12687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1011 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:38:17,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 4648 Invalid, 14468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [770 Valid, 12687 Invalid, 0 Unknown, 1011 Unchecked, 7.9s Time] [2022-07-21 09:38:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2022-07-21 09:38:17,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 573. [2022-07-21 09:38:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 343 states have (on average 1.1399416909620992) internal successors, (391), 349 states have internal predecessors, (391), 180 states have call successors, (180), 45 states have call predecessors, (180), 49 states have return successors, (233), 178 states have call predecessors, (233), 177 states have call successors, (233) [2022-07-21 09:38:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 804 transitions. [2022-07-21 09:38:17,427 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 804 transitions. Word has length 127 [2022-07-21 09:38:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:38:17,427 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 804 transitions. [2022-07-21 09:38:17,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 3.8) internal successors, (152), 40 states have internal predecessors, (152), 14 states have call successors, (46), 8 states have call predecessors, (46), 12 states have return successors, (45), 12 states have call predecessors, (45), 14 states have call successors, (45) [2022-07-21 09:38:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 804 transitions. [2022-07-21 09:38:17,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-21 09:38:17,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:38:17,429 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:38:17,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-21 09:38:17,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-21 09:38:17,650 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:38:17,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:38:17,650 INFO L85 PathProgramCache]: Analyzing trace with hash -226410282, now seen corresponding path program 1 times [2022-07-21 09:38:17,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:38:17,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033905543] [2022-07-21 09:38:17,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:38:17,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:38:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:38:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:38:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:38:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:38:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:38:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:38:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:38:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 09:38:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:38:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 09:38:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:38:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 09:38:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 09:38:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:38:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 09:38:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:38:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:38:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-07-21 09:38:17,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:38:17,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033905543] [2022-07-21 09:38:17,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033905543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:38:17,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:38:17,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 09:38:17,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043060633] [2022-07-21 09:38:17,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:38:17,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 09:38:17,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:38:17,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 09:38:17,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:38:17,916 INFO L87 Difference]: Start difference. First operand 573 states and 804 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-21 09:38:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:38:18,442 INFO L93 Difference]: Finished difference Result 591 states and 823 transitions. [2022-07-21 09:38:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:38:18,443 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2022-07-21 09:38:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:38:18,446 INFO L225 Difference]: With dead ends: 591 [2022-07-21 09:38:18,446 INFO L226 Difference]: Without dead ends: 589 [2022-07-21 09:38:18,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-21 09:38:18,450 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 66 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:38:18,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 665 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 09:38:18,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-07-21 09:38:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 587. [2022-07-21 09:38:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 352 states have (on average 1.1363636363636365) internal successors, (400), 358 states have internal predecessors, (400), 182 states have call successors, (182), 48 states have call predecessors, (182), 52 states have return successors, (235), 180 states have call predecessors, (235), 179 states have call successors, (235) [2022-07-21 09:38:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 817 transitions. [2022-07-21 09:38:18,500 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 817 transitions. Word has length 125 [2022-07-21 09:38:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:38:18,501 INFO L495 AbstractCegarLoop]: Abstraction has 587 states and 817 transitions. [2022-07-21 09:38:18,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-21 09:38:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 817 transitions. [2022-07-21 09:38:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-21 09:38:18,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:38:18,507 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:38:18,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 09:38:18,507 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:38:18,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:38:18,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1654758303, now seen corresponding path program 3 times [2022-07-21 09:38:18,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:38:18,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905667316] [2022-07-21 09:38:18,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:38:18,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:38:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:18,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:38:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:18,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:38:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:18,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:38:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:18,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:18,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:38:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:18,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 09:38:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:18,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 09:38:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:18,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 09:38:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:19,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 09:38:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:19,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 09:38:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:19,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 09:38:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:19,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 09:38:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:19,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 09:38:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:19,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 09:38:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:19,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:38:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:19,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:38:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:19,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:38:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:19,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 09:38:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:38:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-21 09:38:19,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:38:19,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905667316] [2022-07-21 09:38:19,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905667316] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:38:19,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747151910] [2022-07-21 09:38:19,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 09:38:19,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:38:19,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:38:19,452 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:38:19,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-21 09:38:20,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 09:38:20,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:38:20,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 2382 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-21 09:38:20,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:38:23,097 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset_BEFORE_CALL_20| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_19|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset_BEFORE_CALL_20|)) 0))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset_BEFORE_CALL_20| Int)) (= (mod (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_19|) |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset_BEFORE_CALL_20|) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset_BEFORE_CALL_20| Int)) (not (= 0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_19|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset_BEFORE_CALL_20|)))))) is different from true [2022-07-21 09:38:35,910 WARN L233 SmtUtils]: Spent 9.00s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 09:38:49,103 WARN L233 SmtUtils]: Spent 13.10s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 09:39:03,946 WARN L233 SmtUtils]: Spent 12.75s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 09:39:16,077 WARN L233 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 09:39:28,222 WARN L233 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 09:39:42,411 WARN L233 SmtUtils]: Spent 12.09s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 09:39:53,429 WARN L233 SmtUtils]: Spent 10.90s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 09:40:06,303 WARN L233 SmtUtils]: Spent 10.78s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 09:40:17,394 WARN L233 SmtUtils]: Spent 11.00s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 09:40:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 44 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-21 09:40:17,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:40:24,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747151910] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:40:24,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:40:24,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18] total 41 [2022-07-21 09:40:24,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197030725] [2022-07-21 09:40:24,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 09:40:24,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-21 09:40:24,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:40:24,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-21 09:40:24,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2581, Unknown=5, NotChecked=102, Total=2862 [2022-07-21 09:40:24,348 INFO L87 Difference]: Start difference. First operand 587 states and 817 transitions. Second operand has 41 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 35 states have internal predecessors, (92), 15 states have call successors, (37), 5 states have call predecessors, (37), 9 states have return successors, (36), 12 states have call predecessors, (36), 15 states have call successors, (36)