./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_trim_pred_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 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_trim_pred_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 2fd96106837ff3ee9325c248fea6969b94a5a1f2cee078fd159398f70369aafc --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 20:58:57,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 20:58:57,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 20:58:57,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 20:58:57,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 20:58:57,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 20:58:57,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 20:58:57,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 20:58:57,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 20:58:57,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 20:58:57,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 20:58:57,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 20:58:57,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 20:58:57,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 20:58:57,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 20:58:57,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 20:58:57,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 20:58:57,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 20:58:57,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 20:58:57,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 20:58:57,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 20:58:57,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 20:58:57,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 20:58:57,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 20:58:57,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 20:58:57,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 20:58:57,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 20:58:57,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 20:58:57,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 20:58:57,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 20:58:57,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 20:58:57,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 20:58:57,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 20:58:57,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 20:58:57,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 20:58:57,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 20:58:57,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 20:58:57,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 20:58:57,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 20:58:57,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 20:58:57,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 20:58:57,270 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-16 20:58:57,299 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 20:58:57,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 20:58:57,300 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 20:58:57,301 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 20:58:57,302 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 20:58:57,302 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 20:58:57,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 20:58:57,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 20:58:57,303 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 20:58:57,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 20:58:57,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 20:58:57,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 20:58:57,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 20:58:57,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 20:58:57,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 20:58:57,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 20:58:57,305 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 20:58:57,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 20:58:57,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 20:58:57,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 20:58:57,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 20:58:57,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:58:57,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 20:58:57,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 20:58:57,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 20:58:57,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 20:58:57,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 20:58:57,308 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 20:58:57,308 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 20:58:57,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 20:58:57,308 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 20:58:57,309 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 -> 2fd96106837ff3ee9325c248fea6969b94a5a1f2cee078fd159398f70369aafc [2021-11-16 20:58:57,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 20:58:57,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 20:58:57,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 20:58:57,553 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 20:58:57,555 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 20:58:57,556 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_trim_pred_harness.i [2021-11-16 20:58:57,610 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101388ff7/4fb17bb945d54d2984efac1d3c4742fd/FLAG03ff02666 [2021-11-16 20:58:58,241 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 20:58:58,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_trim_pred_harness.i [2021-11-16 20:58:58,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101388ff7/4fb17bb945d54d2984efac1d3c4742fd/FLAG03ff02666 [2021-11-16 20:58:58,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101388ff7/4fb17bb945d54d2984efac1d3c4742fd [2021-11-16 20:58:58,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 20:58:58,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 20:58:58,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 20:58:58,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 20:58:58,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 20:58:58,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:58:58" (1/1) ... [2021-11-16 20:58:58,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e4a2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:58, skipping insertion in model container [2021-11-16 20:58:58,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:58:58" (1/1) ... [2021-11-16 20:58:58,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 20:58:58,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 20:58:58,741 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_trim_pred_harness.i[4499,4512] [2021-11-16 20:58:58,749 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_trim_pred_harness.i[4559,4572] [2021-11-16 20:58:58,768 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:58:58,774 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:58:59,337 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,339 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,339 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,340 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,341 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,358 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,359 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,360 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,362 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,583 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:58:59,584 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:58:59,585 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:58:59,586 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:58:59,589 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:58:59,589 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:58:59,591 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:58:59,591 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:58:59,591 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:58:59,592 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:58:59,694 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:58:59,823 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,823 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,885 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:58:59,919 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 20:58:59,930 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_trim_pred_harness.i[4499,4512] [2021-11-16 20:58:59,930 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_trim_pred_harness.i[4559,4572] [2021-11-16 20:58:59,931 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:58:59,932 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:58:59,956 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,956 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,957 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,957 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,957 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,962 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,962 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,963 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,963 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:59,988 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:58:59,991 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:58:59,991 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:58:59,992 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:58:59,993 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:58:59,993 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:58:59,993 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:58:59,994 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:58:59,994 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:58:59,996 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:59:00,023 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:59:00,101 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:59:00,102 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:59:00,133 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:59:00,328 INFO L208 MainTranslator]: Completed translation [2021-11-16 20:59:00,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:59:00 WrapperNode [2021-11-16 20:59:00,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 20:59:00,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 20:59:00,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 20:59:00,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 20:59:00,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:59:00" (1/1) ... [2021-11-16 20:59:00,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:59:00" (1/1) ... [2021-11-16 20:59:00,503 INFO L137 Inliner]: procedures = 692, calls = 2622, calls flagged for inlining = 62, calls inlined = 10, statements flattened = 890 [2021-11-16 20:59:00,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 20:59:00,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 20:59:00,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 20:59:00,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 20:59:00,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:59:00" (1/1) ... [2021-11-16 20:59:00,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:59:00" (1/1) ... [2021-11-16 20:59:00,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:59:00" (1/1) ... [2021-11-16 20:59:00,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:59:00" (1/1) ... [2021-11-16 20:59:00,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:59:00" (1/1) ... [2021-11-16 20:59:00,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:59:00" (1/1) ... [2021-11-16 20:59:00,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:59:00" (1/1) ... [2021-11-16 20:59:00,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 20:59:00,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 20:59:00,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 20:59:00,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 20:59:00,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:59:00" (1/1) ... [2021-11-16 20:59:00,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:59:00,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:00,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-16 20:59:00,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-16 20:59:00,677 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2021-11-16 20:59:00,678 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2021-11-16 20:59:00,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 20:59:00,678 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 20:59:00,678 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 20:59:00,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 20:59:00,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 20:59:00,680 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 20:59:00,680 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_left_trim_pred [2021-11-16 20:59:00,680 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_left_trim_pred [2021-11-16 20:59:00,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 20:59:00,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 20:59:00,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 20:59:00,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 20:59:00,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 20:59:00,682 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 20:59:00,682 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 20:59:00,682 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2021-11-16 20:59:00,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2021-11-16 20:59:00,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 20:59:00,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 20:59:00,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 20:59:00,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 20:59:00,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 20:59:00,684 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~uint8_t~0~TO~int [2021-11-16 20:59:00,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~uint8_t~0~TO~int [2021-11-16 20:59:00,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 20:59:00,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 20:59:00,921 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 20:59:00,922 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 20:59:02,134 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 20:59:02,140 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 20:59:02,140 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-16 20:59:02,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:59:02 BoogieIcfgContainer [2021-11-16 20:59:02,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 20:59:02,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 20:59:02,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 20:59:02,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 20:59:02,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:58:58" (1/3) ... [2021-11-16 20:59:02,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb22334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:59:02, skipping insertion in model container [2021-11-16 20:59:02,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:59:00" (2/3) ... [2021-11-16 20:59:02,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb22334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:59:02, skipping insertion in model container [2021-11-16 20:59:02,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:59:02" (3/3) ... [2021-11-16 20:59:02,148 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_trim_pred_harness.i [2021-11-16 20:59:02,152 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 20:59:02,153 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 20:59:02,188 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 20:59:02,193 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-16 20:59:02,193 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 20:59:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 78 states have internal predecessors, (95), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2021-11-16 20:59:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-16 20:59:02,220 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:02,221 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:59:02,221 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:02,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash -484495775, now seen corresponding path program 1 times [2021-11-16 20:59:02,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:02,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620525964] [2021-11-16 20:59:02,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:02,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:02,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:02,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:02,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:02,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 20:59:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:02,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 20:59:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:02,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-16 20:59:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:02,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-16 20:59:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:02,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:59:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:02,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 20:59:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:02,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 20:59:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:02,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-16 20:59:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-11-16 20:59:02,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:02,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620525964] [2021-11-16 20:59:02,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620525964] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:02,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:59:02,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-16 20:59:02,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604648103] [2021-11-16 20:59:02,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:02,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-16 20:59:02,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:02,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-16 20:59:02,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 20:59:02,825 INFO L87 Difference]: Start difference. First operand has 124 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 78 states have internal predecessors, (95), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 20:59:02,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:02,858 INFO L93 Difference]: Finished difference Result 244 states and 355 transitions. [2021-11-16 20:59:02,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-16 20:59:02,860 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2021-11-16 20:59:02,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:02,867 INFO L225 Difference]: With dead ends: 244 [2021-11-16 20:59:02,867 INFO L226 Difference]: Without dead ends: 115 [2021-11-16 20:59:02,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-16 20:59:02,873 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:02,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:59:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-16 20:59:02,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-11-16 20:59:02,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 71 states have internal predecessors, (82), 37 states have call successors, (37), 8 states have call predecessors, (37), 7 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2021-11-16 20:59:02,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2021-11-16 20:59:02,913 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 79 [2021-11-16 20:59:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:02,914 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2021-11-16 20:59:02,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 20:59:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2021-11-16 20:59:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-16 20:59:02,920 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:02,921 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:59:02,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-16 20:59:02,921 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:02,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1850978430, now seen corresponding path program 1 times [2021-11-16 20:59:02,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:02,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757903332] [2021-11-16 20:59:02,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:02,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:03,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:03,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:03,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:03,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-16 20:59:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:03,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 20:59:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:03,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-16 20:59:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:03,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-16 20:59:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:03,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:59:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:03,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 20:59:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:03,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 20:59:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:03,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-16 20:59:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-11-16 20:59:03,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:03,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757903332] [2021-11-16 20:59:03,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757903332] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:03,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169140369] [2021-11-16 20:59:03,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:03,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:03,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:03,236 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) [2021-11-16 20:59:03,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-16 20:59:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:03,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 2514 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 20:59:03,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-16 20:59:04,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:59:04,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169140369] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:04,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:59:04,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2021-11-16 20:59:04,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040795184] [2021-11-16 20:59:04,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:04,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:59:04,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:04,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:59:04,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:59:04,031 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 20:59:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:04,251 INFO L93 Difference]: Finished difference Result 213 states and 298 transitions. [2021-11-16 20:59:04,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:59:04,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 81 [2021-11-16 20:59:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:04,261 INFO L225 Difference]: With dead ends: 213 [2021-11-16 20:59:04,261 INFO L226 Difference]: Without dead ends: 118 [2021-11-16 20:59:04,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-16 20:59:04,269 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 171 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:04,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 296 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:59:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-16 20:59:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-11-16 20:59:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 74 states have internal predecessors, (84), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (45), 35 states have call predecessors, (45), 35 states have call successors, (45) [2021-11-16 20:59:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2021-11-16 20:59:04,299 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 81 [2021-11-16 20:59:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:04,300 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2021-11-16 20:59:04,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 20:59:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2021-11-16 20:59:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-16 20:59:04,306 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:04,307 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:59:04,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-16 20:59:04,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:04,524 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:04,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1473940729, now seen corresponding path program 1 times [2021-11-16 20:59:04,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:04,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48907919] [2021-11-16 20:59:04,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:04,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:59:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 20:59:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:59:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-16 20:59:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 20:59:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-16 20:59:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 20:59:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,934 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-11-16 20:59:04,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:04,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48907919] [2021-11-16 20:59:04,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48907919] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:04,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955669622] [2021-11-16 20:59:04,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:04,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:04,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:04,939 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) [2021-11-16 20:59:04,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-16 20:59:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:05,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 2519 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 20:59:05,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-16 20:59:05,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:59:05,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955669622] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:05,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:59:05,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2021-11-16 20:59:05,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32690451] [2021-11-16 20:59:05,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:05,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 20:59:05,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:05,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 20:59:05,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:59:05,646 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-16 20:59:05,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:05,919 INFO L93 Difference]: Finished difference Result 208 states and 295 transitions. [2021-11-16 20:59:05,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 20:59:05,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 83 [2021-11-16 20:59:05,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:05,921 INFO L225 Difference]: With dead ends: 208 [2021-11-16 20:59:05,921 INFO L226 Difference]: Without dead ends: 118 [2021-11-16 20:59:05,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-11-16 20:59:05,923 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 189 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:05,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 481 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:59:05,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-16 20:59:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-11-16 20:59:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 74 states have internal predecessors, (84), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (43), 35 states have call predecessors, (43), 35 states have call successors, (43) [2021-11-16 20:59:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2021-11-16 20:59:05,935 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 83 [2021-11-16 20:59:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:05,935 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2021-11-16 20:59:05,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-16 20:59:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2021-11-16 20:59:05,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-16 20:59:05,936 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:05,937 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 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] [2021-11-16 20:59:05,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-16 20:59:06,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-11-16 20:59:06,142 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:06,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:06,142 INFO L85 PathProgramCache]: Analyzing trace with hash -346545804, now seen corresponding path program 2 times [2021-11-16 20:59:06,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:06,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896459495] [2021-11-16 20:59:06,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:06,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:06,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:06,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:06,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:06,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:06,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:59:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:06,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:59:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:06,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 20:59:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:06,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-16 20:59:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:06,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 20:59:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:06,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 20:59:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:06,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-16 20:59:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-11-16 20:59:06,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:06,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896459495] [2021-11-16 20:59:06,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896459495] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:06,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907837882] [2021-11-16 20:59:06,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 20:59:06,527 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:06,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:06,528 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) [2021-11-16 20:59:06,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-16 20:59:07,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 20:59:07,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 20:59:07,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-16 20:59:07,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-11-16 20:59:07,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:59:07,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907837882] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:07,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:59:07,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2021-11-16 20:59:07,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063669999] [2021-11-16 20:59:07,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:07,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:59:07,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:07,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:59:07,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-11-16 20:59:07,804 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-16 20:59:08,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:08,109 INFO L93 Difference]: Finished difference Result 201 states and 281 transitions. [2021-11-16 20:59:08,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 20:59:08,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 85 [2021-11-16 20:59:08,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:08,111 INFO L225 Difference]: With dead ends: 201 [2021-11-16 20:59:08,111 INFO L226 Difference]: Without dead ends: 118 [2021-11-16 20:59:08,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2021-11-16 20:59:08,113 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 196 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:08,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 642 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:59:08,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-16 20:59:08,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-11-16 20:59:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 74 states have internal predecessors, (84), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (41), 35 states have call predecessors, (41), 35 states have call successors, (41) [2021-11-16 20:59:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 162 transitions. [2021-11-16 20:59:08,124 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 162 transitions. Word has length 85 [2021-11-16 20:59:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:08,125 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 162 transitions. [2021-11-16 20:59:08,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-16 20:59:08,125 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 162 transitions. [2021-11-16 20:59:08,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-16 20:59:08,126 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:08,126 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:59:08,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-16 20:59:08,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:08,352 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:08,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash 625417492, now seen corresponding path program 1 times [2021-11-16 20:59:08,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:08,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264964832] [2021-11-16 20:59:08,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:08,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:59:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:59:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 20:59:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-16 20:59:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 20:59:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 20:59:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:59:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,659 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-11-16 20:59:08,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:08,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264964832] [2021-11-16 20:59:08,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264964832] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:08,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:59:08,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 20:59:08,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586122752] [2021-11-16 20:59:08,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:08,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 20:59:08,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:08,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 20:59:08,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:59:08,661 INFO L87 Difference]: Start difference. First operand 118 states and 162 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-16 20:59:08,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:08,715 INFO L93 Difference]: Finished difference Result 130 states and 185 transitions. [2021-11-16 20:59:08,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:59:08,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 89 [2021-11-16 20:59:08,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:08,717 INFO L225 Difference]: With dead ends: 130 [2021-11-16 20:59:08,717 INFO L226 Difference]: Without dead ends: 128 [2021-11-16 20:59:08,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:59:08,718 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 16 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:08,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 1074 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:59:08,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-11-16 20:59:08,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2021-11-16 20:59:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.1538461538461537) internal successors, (90), 81 states have internal predecessors, (90), 38 states have call successors, (38), 9 states have call predecessors, (38), 10 states have return successors, (54), 36 states have call predecessors, (54), 36 states have call successors, (54) [2021-11-16 20:59:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 182 transitions. [2021-11-16 20:59:08,729 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 182 transitions. Word has length 89 [2021-11-16 20:59:08,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:08,730 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 182 transitions. [2021-11-16 20:59:08,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-16 20:59:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 182 transitions. [2021-11-16 20:59:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-16 20:59:08,731 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:08,732 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:59:08,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-16 20:59:08,732 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:08,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:08,732 INFO L85 PathProgramCache]: Analyzing trace with hash 852132828, now seen corresponding path program 1 times [2021-11-16 20:59:08,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:08,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564706961] [2021-11-16 20:59:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:08,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:59:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:59:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 20:59:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-16 20:59:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 20:59:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 20:59:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:08,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:59:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-11-16 20:59:09,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:09,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564706961] [2021-11-16 20:59:09,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564706961] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:09,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:59:09,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 20:59:09,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082170698] [2021-11-16 20:59:09,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:09,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:59:09,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:09,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:59:09,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:59:09,043 INFO L87 Difference]: Start difference. First operand 127 states and 182 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 20:59:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:10,033 INFO L93 Difference]: Finished difference Result 225 states and 333 transitions. [2021-11-16 20:59:10,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:59:10,034 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2021-11-16 20:59:10,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:10,036 INFO L225 Difference]: With dead ends: 225 [2021-11-16 20:59:10,036 INFO L226 Difference]: Without dead ends: 148 [2021-11-16 20:59:10,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:59:10,037 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 36 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:10,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 660 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-16 20:59:10,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-16 20:59:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 134. [2021-11-16 20:59:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 82 states have (on average 1.170731707317073) internal successors, (96), 86 states have internal predecessors, (96), 41 states have call successors, (41), 9 states have call predecessors, (41), 10 states have return successors, (58), 38 states have call predecessors, (58), 39 states have call successors, (58) [2021-11-16 20:59:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 195 transitions. [2021-11-16 20:59:10,050 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 195 transitions. Word has length 93 [2021-11-16 20:59:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:10,050 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 195 transitions. [2021-11-16 20:59:10,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 20:59:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 195 transitions. [2021-11-16 20:59:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-16 20:59:10,052 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:10,052 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 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] [2021-11-16 20:59:10,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-16 20:59:10,052 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:10,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:10,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1211514462, now seen corresponding path program 1 times [2021-11-16 20:59:10,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:10,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369643594] [2021-11-16 20:59:10,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:10,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:59:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:59:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 20:59:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-16 20:59:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 20:59:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 20:59:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 20:59:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-11-16 20:59:10,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:10,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369643594] [2021-11-16 20:59:10,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369643594] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:10,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:59:10,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-16 20:59:10,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774026462] [2021-11-16 20:59:10,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:10,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-16 20:59:10,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:10,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-16 20:59:10,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 20:59:10,208 INFO L87 Difference]: Start difference. First operand 134 states and 195 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 20:59:10,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:10,221 INFO L93 Difference]: Finished difference Result 223 states and 324 transitions. [2021-11-16 20:59:10,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-16 20:59:10,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2021-11-16 20:59:10,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:10,223 INFO L225 Difference]: With dead ends: 223 [2021-11-16 20:59:10,223 INFO L226 Difference]: Without dead ends: 135 [2021-11-16 20:59:10,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-16 20:59:10,224 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:10,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:59:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-11-16 20:59:10,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-11-16 20:59:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 87 states have internal predecessors, (96), 41 states have call successors, (41), 9 states have call predecessors, (41), 10 states have return successors, (58), 38 states have call predecessors, (58), 39 states have call successors, (58) [2021-11-16 20:59:10,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 195 transitions. [2021-11-16 20:59:10,234 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 195 transitions. Word has length 96 [2021-11-16 20:59:10,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:10,234 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 195 transitions. [2021-11-16 20:59:10,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-16 20:59:10,234 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 195 transitions. [2021-11-16 20:59:10,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-16 20:59:10,235 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:10,236 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:59:10,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-16 20:59:10,236 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:10,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:10,237 INFO L85 PathProgramCache]: Analyzing trace with hash -247569564, now seen corresponding path program 1 times [2021-11-16 20:59:10,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:10,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473079366] [2021-11-16 20:59:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:10,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:59:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:59:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 20:59:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-16 20:59:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 20:59:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 20:59:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-16 20:59:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:59:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-11-16 20:59:10,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:10,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473079366] [2021-11-16 20:59:10,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473079366] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:10,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104279661] [2021-11-16 20:59:10,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:10,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:10,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:10,522 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) [2021-11-16 20:59:10,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-16 20:59:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:10,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 2574 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-16 20:59:10,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 37 proven. 16 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-11-16 20:59:12,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:59:12,628 INFO L388 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 [2021-11-16 20:59:12,680 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-11-16 20:59:12,681 INFO L388 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 [2021-11-16 20:59:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-16 20:59:12,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104279661] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 20:59:12,718 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 20:59:12,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 12] total 24 [2021-11-16 20:59:12,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649139341] [2021-11-16 20:59:12,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 20:59:12,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-16 20:59:12,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:12,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-16 20:59:12,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2021-11-16 20:59:12,721 INFO L87 Difference]: Start difference. First operand 135 states and 195 transitions. Second operand has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 22 states have internal predecessors, (110), 9 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) [2021-11-16 20:59:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:16,192 INFO L93 Difference]: Finished difference Result 361 states and 544 transitions. [2021-11-16 20:59:16,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-16 20:59:16,193 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 22 states have internal predecessors, (110), 9 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) Word has length 99 [2021-11-16 20:59:16,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:16,195 INFO L225 Difference]: With dead ends: 361 [2021-11-16 20:59:16,195 INFO L226 Difference]: Without dead ends: 258 [2021-11-16 20:59:16,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 191 SyntacticMatches, 23 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=238, Invalid=1742, Unknown=0, NotChecked=0, Total=1980 [2021-11-16 20:59:16,197 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 133 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:16,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 2451 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1824 Invalid, 0 Unknown, 212 Unchecked, 2.9s Time] [2021-11-16 20:59:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-16 20:59:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 202. [2021-11-16 20:59:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 125 states have (on average 1.136) internal successors, (142), 129 states have internal predecessors, (142), 62 states have call successors, (62), 13 states have call predecessors, (62), 14 states have return successors, (84), 59 states have call predecessors, (84), 60 states have call successors, (84) [2021-11-16 20:59:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 288 transitions. [2021-11-16 20:59:16,215 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 288 transitions. Word has length 99 [2021-11-16 20:59:16,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:16,215 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 288 transitions. [2021-11-16 20:59:16,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 22 states have internal predecessors, (110), 9 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) [2021-11-16 20:59:16,216 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 288 transitions. [2021-11-16 20:59:16,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-16 20:59:16,217 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:16,217 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 4, 3, 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] [2021-11-16 20:59:16,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-16 20:59:16,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:16,436 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:16,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:16,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1338258892, now seen corresponding path program 1 times [2021-11-16 20:59:16,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:16,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82204668] [2021-11-16 20:59:16,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:16,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-16 20:59:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-16 20:59:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:59:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:59:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 20:59:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 20:59:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-16 20:59:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-16 20:59:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-16 20:59:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 20:59:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-11-16 20:59:16,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:16,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82204668] [2021-11-16 20:59:16,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82204668] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:16,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:59:16,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-16 20:59:16,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424494823] [2021-11-16 20:59:16,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:16,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 20:59:16,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:16,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 20:59:16,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:59:16,661 INFO L87 Difference]: Start difference. First operand 202 states and 288 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-16 20:59:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:16,708 INFO L93 Difference]: Finished difference Result 280 states and 398 transitions. [2021-11-16 20:59:16,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:59:16,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2021-11-16 20:59:16,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:16,710 INFO L225 Difference]: With dead ends: 280 [2021-11-16 20:59:16,710 INFO L226 Difference]: Without dead ends: 202 [2021-11-16 20:59:16,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-16 20:59:16,712 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 18 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:16,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 523 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:59:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-16 20:59:16,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-11-16 20:59:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 125 states have (on average 1.136) internal successors, (142), 129 states have internal predecessors, (142), 62 states have call successors, (62), 13 states have call predecessors, (62), 14 states have return successors, (81), 59 states have call predecessors, (81), 60 states have call successors, (81) [2021-11-16 20:59:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 285 transitions. [2021-11-16 20:59:16,731 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 285 transitions. Word has length 105 [2021-11-16 20:59:16,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:16,732 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 285 transitions. [2021-11-16 20:59:16,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-16 20:59:16,732 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 285 transitions. [2021-11-16 20:59:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-16 20:59:16,733 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:16,734 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2021-11-16 20:59:16,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-16 20:59:16,734 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:16,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:16,734 INFO L85 PathProgramCache]: Analyzing trace with hash 762751521, now seen corresponding path program 1 times [2021-11-16 20:59:16,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:16,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156461818] [2021-11-16 20:59:16,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:16,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:59:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:59:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 20:59:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-16 20:59:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 20:59:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 20:59:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:59:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-16 20:59:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-16 20:59:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-11-16 20:59:16,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:16,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156461818] [2021-11-16 20:59:16,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156461818] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:16,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:59:16,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-16 20:59:16,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486129883] [2021-11-16 20:59:16,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:16,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 20:59:16,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:16,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 20:59:16,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-16 20:59:16,985 INFO L87 Difference]: Start difference. First operand 202 states and 285 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-16 20:59:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:17,047 INFO L93 Difference]: Finished difference Result 210 states and 293 transitions. [2021-11-16 20:59:17,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:59:17,047 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 103 [2021-11-16 20:59:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:17,049 INFO L225 Difference]: With dead ends: 210 [2021-11-16 20:59:17,049 INFO L226 Difference]: Without dead ends: 208 [2021-11-16 20:59:17,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:59:17,050 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 16 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:17,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 1082 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:59:17,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-16 20:59:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2021-11-16 20:59:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 128 states have (on average 1.1328125) internal successors, (145), 132 states have internal predecessors, (145), 63 states have call successors, (63), 14 states have call predecessors, (63), 15 states have return successors, (82), 60 states have call predecessors, (82), 61 states have call successors, (82) [2021-11-16 20:59:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 290 transitions. [2021-11-16 20:59:17,071 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 290 transitions. Word has length 103 [2021-11-16 20:59:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:17,071 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 290 transitions. [2021-11-16 20:59:17,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2021-11-16 20:59:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 290 transitions. [2021-11-16 20:59:17,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-16 20:59:17,074 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:17,074 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:59:17,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-16 20:59:17,075 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:17,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:17,075 INFO L85 PathProgramCache]: Analyzing trace with hash -912199724, now seen corresponding path program 2 times [2021-11-16 20:59:17,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:17,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936785236] [2021-11-16 20:59:17,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:17,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-16 20:59:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-16 20:59:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:59:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:59:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 20:59:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-16 20:59:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-16 20:59:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-16 20:59:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-16 20:59:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-11-16 20:59:17,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:17,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936785236] [2021-11-16 20:59:17,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936785236] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:17,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327316598] [2021-11-16 20:59:17,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 20:59:17,358 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:17,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:17,360 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) [2021-11-16 20:59:17,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-16 20:59:19,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 20:59:19,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 20:59:19,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 2598 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-16 20:59:19,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 75 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-16 20:59:20,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:59:20,837 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-11-16 20:59:20,838 INFO L388 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 20 treesize of output 19 [2021-11-16 20:59:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-11-16 20:59:20,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327316598] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 20:59:20,869 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 20:59:20,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 25 [2021-11-16 20:59:20,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416660453] [2021-11-16 20:59:20,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 20:59:20,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-16 20:59:20,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:20,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-16 20:59:20,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2021-11-16 20:59:20,871 INFO L87 Difference]: Start difference. First operand 207 states and 290 transitions. Second operand has 25 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 24 states have internal predecessors, (104), 8 states have call successors, (28), 3 states have call predecessors, (28), 8 states have return successors, (27), 6 states have call predecessors, (27), 8 states have call successors, (27) [2021-11-16 20:59:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:24,262 INFO L93 Difference]: Finished difference Result 400 states and 590 transitions. [2021-11-16 20:59:24,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-16 20:59:24,263 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 24 states have internal predecessors, (104), 8 states have call successors, (28), 3 states have call predecessors, (28), 8 states have return successors, (27), 6 states have call predecessors, (27), 8 states have call successors, (27) Word has length 107 [2021-11-16 20:59:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:24,265 INFO L225 Difference]: With dead ends: 400 [2021-11-16 20:59:24,265 INFO L226 Difference]: Without dead ends: 269 [2021-11-16 20:59:24,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=290, Invalid=2062, Unknown=0, NotChecked=0, Total=2352 [2021-11-16 20:59:24,267 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 130 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 2400 SdHoareTripleChecker+Invalid, 2329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:24,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 2400 Invalid, 2329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2007 Invalid, 0 Unknown, 240 Unchecked, 2.8s Time] [2021-11-16 20:59:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-11-16 20:59:24,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2021-11-16 20:59:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 139 states have (on average 1.1223021582733812) internal successors, (156), 144 states have internal predecessors, (156), 64 states have call successors, (64), 16 states have call predecessors, (64), 17 states have return successors, (95), 60 states have call predecessors, (95), 62 states have call successors, (95) [2021-11-16 20:59:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 315 transitions. [2021-11-16 20:59:24,282 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 315 transitions. Word has length 107 [2021-11-16 20:59:24,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:24,282 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 315 transitions. [2021-11-16 20:59:24,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 24 states have internal predecessors, (104), 8 states have call successors, (28), 3 states have call predecessors, (28), 8 states have return successors, (27), 6 states have call predecessors, (27), 8 states have call successors, (27) [2021-11-16 20:59:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 315 transitions. [2021-11-16 20:59:24,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-16 20:59:24,284 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:24,284 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 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] [2021-11-16 20:59:24,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-16 20:59:24,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-16 20:59:24,491 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:24,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:24,492 INFO L85 PathProgramCache]: Analyzing trace with hash 411830111, now seen corresponding path program 1 times [2021-11-16 20:59:24,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:24,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007759007] [2021-11-16 20:59:24,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:24,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:24,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:24,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:24,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:24,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:24,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:59:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:24,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-16 20:59:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:24,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-16 20:59:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:24,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 20:59:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:24,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-16 20:59:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:24,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 20:59:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:24,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-16 20:59:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:24,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 20:59:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:24,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-16 20:59:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2021-11-16 20:59:24,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:24,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007759007] [2021-11-16 20:59:24,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007759007] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:24,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263823630] [2021-11-16 20:59:24,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:24,939 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:24,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:24,941 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) [2021-11-16 20:59:24,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-16 20:59:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:25,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 2607 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-16 20:59:25,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-16 20:59:25,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:59:25,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263823630] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:25,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:59:25,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2021-11-16 20:59:25,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518350240] [2021-11-16 20:59:25,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:25,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:59:25,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:25,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:59:25,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-11-16 20:59:25,611 INFO L87 Difference]: Start difference. First operand 221 states and 315 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-11-16 20:59:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:25,742 INFO L93 Difference]: Finished difference Result 358 states and 508 transitions. [2021-11-16 20:59:25,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:59:25,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2021-11-16 20:59:25,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:25,744 INFO L225 Difference]: With dead ends: 358 [2021-11-16 20:59:25,744 INFO L226 Difference]: Without dead ends: 221 [2021-11-16 20:59:25,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2021-11-16 20:59:25,746 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 12 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:25,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1136 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:59:25,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-11-16 20:59:25,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2021-11-16 20:59:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 139 states have (on average 1.1223021582733812) internal successors, (156), 144 states have internal predecessors, (156), 64 states have call successors, (64), 16 states have call predecessors, (64), 17 states have return successors, (93), 60 states have call predecessors, (93), 62 states have call successors, (93) [2021-11-16 20:59:25,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 313 transitions. [2021-11-16 20:59:25,761 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 313 transitions. Word has length 110 [2021-11-16 20:59:25,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:25,761 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 313 transitions. [2021-11-16 20:59:25,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-11-16 20:59:25,761 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 313 transitions. [2021-11-16 20:59:25,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-16 20:59:25,763 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:25,764 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 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, 1, 1, 1] [2021-11-16 20:59:25,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-16 20:59:25,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:25,988 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:25,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:25,988 INFO L85 PathProgramCache]: Analyzing trace with hash -712076360, now seen corresponding path program 1 times [2021-11-16 20:59:25,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:25,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132909463] [2021-11-16 20:59:25,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:25,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:59:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-16 20:59:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-16 20:59:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 20:59:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-16 20:59:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-16 20:59:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-16 20:59:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-16 20:59:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-16 20:59:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2021-11-16 20:59:26,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:26,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132909463] [2021-11-16 20:59:26,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132909463] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:26,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554877178] [2021-11-16 20:59:26,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:26,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:26,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:26,395 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) [2021-11-16 20:59:26,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-16 20:59:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:26,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 2617 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-16 20:59:26,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:26,973 INFO L388 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 27 treesize of output 15 [2021-11-16 20:59:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-11-16 20:59:27,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:59:27,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554877178] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:27,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:59:27,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 16 [2021-11-16 20:59:27,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753191472] [2021-11-16 20:59:27,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:27,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:59:27,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:27,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:59:27,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-11-16 20:59:27,127 INFO L87 Difference]: Start difference. First operand 221 states and 313 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-11-16 20:59:28,819 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 20:59:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:29,477 INFO L93 Difference]: Finished difference Result 400 states and 602 transitions. [2021-11-16 20:59:29,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 20:59:29,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2021-11-16 20:59:29,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:29,479 INFO L225 Difference]: With dead ends: 400 [2021-11-16 20:59:29,479 INFO L226 Difference]: Without dead ends: 272 [2021-11-16 20:59:29,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2021-11-16 20:59:29,481 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 110 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:29,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 899 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 429 Invalid, 0 Unknown, 78 Unchecked, 2.2s Time] [2021-11-16 20:59:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-16 20:59:29,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 225. [2021-11-16 20:59:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 142 states have (on average 1.1126760563380282) internal successors, (158), 147 states have internal predecessors, (158), 64 states have call successors, (64), 17 states have call predecessors, (64), 18 states have return successors, (93), 60 states have call predecessors, (93), 62 states have call successors, (93) [2021-11-16 20:59:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 315 transitions. [2021-11-16 20:59:29,495 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 315 transitions. Word has length 112 [2021-11-16 20:59:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:29,496 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 315 transitions. [2021-11-16 20:59:29,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2021-11-16 20:59:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 315 transitions. [2021-11-16 20:59:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-16 20:59:29,498 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:29,498 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-16 20:59:29,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-16 20:59:29,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:29,715 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:29,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:29,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1160869054, now seen corresponding path program 1 times [2021-11-16 20:59:29,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:29,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026687720] [2021-11-16 20:59:29,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:29,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:29,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:29,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:29,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:29,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 20:59:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:29,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 20:59:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:29,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-16 20:59:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:29,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 20:59:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:29,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-16 20:59:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:29,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-16 20:59:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:29,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-16 20:59:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:29,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-16 20:59:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:29,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-16 20:59:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-11-16 20:59:30,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:30,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026687720] [2021-11-16 20:59:30,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026687720] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:30,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95371996] [2021-11-16 20:59:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:30,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:30,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:30,007 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) [2021-11-16 20:59:30,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-16 20:59:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:30,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 2630 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-16 20:59:30,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-16 20:59:30,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:59:30,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95371996] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:30,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:59:30,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2021-11-16 20:59:30,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55076980] [2021-11-16 20:59:30,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:30,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:59:30,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:30,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:59:30,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:59:30,658 INFO L87 Difference]: Start difference. First operand 225 states and 315 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-11-16 20:59:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:30,785 INFO L93 Difference]: Finished difference Result 382 states and 538 transitions. [2021-11-16 20:59:30,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:59:30,786 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 115 [2021-11-16 20:59:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:30,787 INFO L225 Difference]: With dead ends: 382 [2021-11-16 20:59:30,787 INFO L226 Difference]: Without dead ends: 220 [2021-11-16 20:59:30,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:59:30,789 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 12 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:30,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1127 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:59:30,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-11-16 20:59:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2021-11-16 20:59:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 138 states have (on average 1.108695652173913) internal successors, (153), 142 states have internal predecessors, (153), 64 states have call successors, (64), 17 states have call predecessors, (64), 17 states have return successors, (90), 60 states have call predecessors, (90), 62 states have call successors, (90) [2021-11-16 20:59:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 307 transitions. [2021-11-16 20:59:30,803 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 307 transitions. Word has length 115 [2021-11-16 20:59:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:30,803 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 307 transitions. [2021-11-16 20:59:30,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-11-16 20:59:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 307 transitions. [2021-11-16 20:59:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-16 20:59:30,805 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:30,805 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:59:30,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-16 20:59:31,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-16 20:59:31,019 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:31,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:31,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1390891817, now seen corresponding path program 2 times [2021-11-16 20:59:31,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:31,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178439019] [2021-11-16 20:59:31,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:31,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:31,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 20:59:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:31,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 20:59:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:31,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 20:59:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:31,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-16 20:59:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:31,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 20:59:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:31,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-16 20:59:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:31,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 20:59:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:31,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 20:59:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:31,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 20:59:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 20:59:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:31,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-11-16 20:59:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:31,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 20:59:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-11-16 20:59:31,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:31,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178439019] [2021-11-16 20:59:31,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178439019] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:31,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957053331] [2021-11-16 20:59:31,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 20:59:31,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:31,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:31,618 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) [2021-11-16 20:59:31,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-16 20:59:34,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 20:59:34,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 20:59:34,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 2640 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-16 20:59:34,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:36,421 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_10| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_15|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_10|)) 0))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_10| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_15|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_10|)) 0)))) is different from true [2021-11-16 20:59:38,494 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_11| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_16|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_11|)) 0))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_11| Int)) (not (= 0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_16|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.offset_BEFORE_CALL_11|)))))) is different from true [2021-11-16 20:59:40,616 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_11 Int) (v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_15 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_15) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_11)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_11 Int) (v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_15 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_15) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_11)) 0)))) is different from true [2021-11-16 20:59:42,749 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_12 Int) (v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_16 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_16) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_12)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_12 Int) (v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_16 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_16) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_12)) 0)))) is different from true [2021-11-16 20:59:44,784 WARN L860 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_12 Int) (v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_16 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_16) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_12)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_12 Int) (v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_16 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_16) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_12)) 0)))) (let ((.cse0 (+ c_aws_byte_cursor_left_trim_pred_~source.offset 8))) (or (not (= (select (select |c_#memory_$Pointer$.base| c_aws_byte_cursor_left_trim_pred_~source.base) .cse0) 0)) (not (= (select (select |c_#memory_$Pointer$.offset| c_aws_byte_cursor_left_trim_pred_~source.base) .cse0) 0))))) is different from true [2021-11-16 20:59:46,814 WARN L860 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_17 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_13 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_17) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_13)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_17 Int) (v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_13 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_17) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_13)) 0)))) (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_12 Int) (v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_16 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_16) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_12)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_12 Int) (v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_16 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_16) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_12)) 0))))) is different from true [2021-11-16 20:59:48,944 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_14 Int) (v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_18 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_18) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_14)) 0))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_14 Int) (v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_18 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_18) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_14)) 0)))) is different from true [2021-11-16 20:59:51,030 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_15 Int) (v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_19 Int)) (not (= 0 (select (select |c_#memory_$Pointer$.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_19) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_15))))) (exists ((v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_15 Int) (v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_19 Int)) (not (= (select (select |c_#memory_$Pointer$.offset| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_19) (+ 8 v_aws_byte_cursor_left_trim_pred_~source.offset_BEFORE_CALL_15)) 0)))) is different from true [2021-11-16 21:00:00,907 WARN L227 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 21:00:07,955 WARN L227 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 21:00:15,020 WARN L227 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 21:00:21,097 WARN L227 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-16 21:00:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 73 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 47 not checked. [2021-11-16 21:00:21,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:00:23,818 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-11-16 21:00:23,818 INFO L388 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 35 [2021-11-16 21:00:23,824 INFO L354 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-11-16 21:00:23,824 INFO L388 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 19 [2021-11-16 21:00:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 32 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-11-16 21:00:23,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957053331] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 21:00:23,900 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 21:00:23,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 13] total 37 [2021-11-16 21:00:23,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412058711] [2021-11-16 21:00:23,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 21:00:23,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-16 21:00:23,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:00:23,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-16 21:00:23,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=707, Unknown=14, NotChecked=488, Total=1332 [2021-11-16 21:00:23,902 INFO L87 Difference]: Start difference. First operand 220 states and 307 transitions. Second operand has 37 states, 37 states have (on average 3.7027027027027026) internal successors, (137), 35 states have internal predecessors, (137), 8 states have call successors, (34), 10 states have call predecessors, (34), 11 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) [2021-11-16 21:00:25,185 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:00:50,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:00:50,686 INFO L93 Difference]: Finished difference Result 549 states and 842 transitions. [2021-11-16 21:00:50,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-16 21:00:50,687 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.7027027027027026) internal successors, (137), 35 states have internal predecessors, (137), 8 states have call successors, (34), 10 states have call predecessors, (34), 11 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) Word has length 117 [2021-11-16 21:00:50,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:00:50,689 INFO L225 Difference]: With dead ends: 549 [2021-11-16 21:00:50,690 INFO L226 Difference]: Without dead ends: 400 [2021-11-16 21:00:50,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 230 SyntacticMatches, 15 SemanticMatches, 48 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 70.4s TimeCoverageRelationStatistics Valid=283, Invalid=1443, Unknown=28, NotChecked=696, Total=2450 [2021-11-16 21:00:50,694 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 244 mSDsluCounter, 2366 mSDsCounter, 0 mSdLazyCounter, 2778 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 2613 SdHoareTripleChecker+Invalid, 7266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4378 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2021-11-16 21:00:50,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 2613 Invalid, 7266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2778 Invalid, 0 Unknown, 4378 Unchecked, 4.8s Time] [2021-11-16 21:00:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-11-16 21:00:50,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 284. [2021-11-16 21:00:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 184 states have (on average 1.1032608695652173) internal successors, (203), 191 states have internal predecessors, (203), 74 states have call successors, (74), 25 states have call predecessors, (74), 25 states have return successors, (103), 67 states have call predecessors, (103), 72 states have call successors, (103) [2021-11-16 21:00:50,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 380 transitions. [2021-11-16 21:00:50,715 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 380 transitions. Word has length 117 [2021-11-16 21:00:50,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:00:50,716 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 380 transitions. [2021-11-16 21:00:50,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.7027027027027026) internal successors, (137), 35 states have internal predecessors, (137), 8 states have call successors, (34), 10 states have call predecessors, (34), 11 states have return successors, (31), 7 states have call predecessors, (31), 8 states have call successors, (31) [2021-11-16 21:00:50,716 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 380 transitions. [2021-11-16 21:00:50,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-16 21:00:50,718 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:00:50,718 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2021-11-16 21:00:50,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-16 21:00:50,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-16 21:00:50,943 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:00:50,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:00:50,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2072779801, now seen corresponding path program 1 times [2021-11-16 21:00:50,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:00:50,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611249700] [2021-11-16 21:00:50,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:00:50,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:00:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:00:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:00:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 21:00:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:00:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 21:00:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 21:00:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:00:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 21:00:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-16 21:00:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-16 21:00:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-16 21:00:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-16 21:00:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 21:00:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-16 21:00:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 21:00:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2021-11-16 21:00:51,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:00:51,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611249700] [2021-11-16 21:00:51,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611249700] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:00:51,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977618928] [2021-11-16 21:00:51,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:00:51,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:00:51,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:00:51,399 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) [2021-11-16 21:00:51,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-16 21:00:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:51,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 2667 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:00:51,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:00:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-11-16 21:00:52,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:00:52,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977618928] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:00:52,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:00:52,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2021-11-16 21:00:52,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294321896] [2021-11-16 21:00:52,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:00:52,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 21:00:52,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:00:52,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 21:00:52,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:00:52,155 INFO L87 Difference]: Start difference. First operand 284 states and 380 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 21:00:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:00:52,299 INFO L93 Difference]: Finished difference Result 495 states and 701 transitions. [2021-11-16 21:00:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-16 21:00:52,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2021-11-16 21:00:52,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:00:52,301 INFO L225 Difference]: With dead ends: 495 [2021-11-16 21:00:52,302 INFO L226 Difference]: Without dead ends: 277 [2021-11-16 21:00:52,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-16 21:00:52,304 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 3 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 21:00:52,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 392 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2021-11-16 21:00:52,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-11-16 21:00:52,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2021-11-16 21:00:52,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 177 states have (on average 1.0847457627118644) internal successors, (192), 183 states have internal predecessors, (192), 74 states have call successors, (74), 25 states have call predecessors, (74), 24 states have return successors, (102), 67 states have call predecessors, (102), 72 states have call successors, (102) [2021-11-16 21:00:52,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 368 transitions. [2021-11-16 21:00:52,320 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 368 transitions. Word has length 129 [2021-11-16 21:00:52,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:00:52,321 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 368 transitions. [2021-11-16 21:00:52,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2021-11-16 21:00:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 368 transitions. [2021-11-16 21:00:52,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-16 21:00:52,323 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:00:52,323 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:00:52,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-16 21:00:52,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-16 21:00:52,543 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:00:52,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:00:52,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1043560132, now seen corresponding path program 1 times [2021-11-16 21:00:52,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:00:52,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760969505] [2021-11-16 21:00:52,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:00:52,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:00:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:52,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:00:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:52,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:00:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:52,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 21:00:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:52,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:00:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:52,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 21:00:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:52,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 21:00:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:52,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:00:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:52,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:00:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:52,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-16 21:00:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:52,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 21:00:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:52,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-16 21:00:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:52,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-16 21:00:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:52,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-16 21:00:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:52,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-16 21:00:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-16 21:00:52,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:00:52,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760969505] [2021-11-16 21:00:52,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760969505] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:00:52,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:00:52,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-16 21:00:52,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101474935] [2021-11-16 21:00:52,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:00:52,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 21:00:52,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:00:52,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 21:00:52,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:00:52,879 INFO L87 Difference]: Start difference. First operand 276 states and 368 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2021-11-16 21:00:54,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:00:54,888 INFO L93 Difference]: Finished difference Result 284 states and 376 transitions. [2021-11-16 21:00:54,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-16 21:00:54,889 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2021-11-16 21:00:54,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:00:54,891 INFO L225 Difference]: With dead ends: 284 [2021-11-16 21:00:54,891 INFO L226 Difference]: Without dead ends: 282 [2021-11-16 21:00:54,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2021-11-16 21:00:54,892 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 74 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-16 21:00:54,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 1444 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-16 21:00:54,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-11-16 21:00:54,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2021-11-16 21:00:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 180 states have (on average 1.0833333333333333) internal successors, (195), 186 states have internal predecessors, (195), 75 states have call successors, (75), 26 states have call predecessors, (75), 25 states have return successors, (103), 68 states have call predecessors, (103), 73 states have call successors, (103) [2021-11-16 21:00:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 373 transitions. [2021-11-16 21:00:54,917 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 373 transitions. Word has length 130 [2021-11-16 21:00:54,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:00:54,918 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 373 transitions. [2021-11-16 21:00:54,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2021-11-16 21:00:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 373 transitions. [2021-11-16 21:00:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-11-16 21:00:54,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:00:54,921 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2021-11-16 21:00:54,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-16 21:00:54,921 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:00:54,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:00:54,922 INFO L85 PathProgramCache]: Analyzing trace with hash 292719925, now seen corresponding path program 1 times [2021-11-16 21:00:54,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:00:54,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383064543] [2021-11-16 21:00:54,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:00:54,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:00:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:00:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:00:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 21:00:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:00:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 21:00:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 21:00:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:00:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 21:00:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-16 21:00:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-16 21:00:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-16 21:00:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-16 21:00:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 21:00:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-16 21:00:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 21:00:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2021-11-16 21:00:55,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:00:55,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383064543] [2021-11-16 21:00:55,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383064543] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:00:55,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536669213] [2021-11-16 21:00:55,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:00:55,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:00:55,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:00:55,356 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) [2021-11-16 21:00:55,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-16 21:00:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:00:55,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 2684 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-16 21:00:55,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:00:55,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-16 21:00:56,026 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-16 21:00:56,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-16 21:00:56,917 INFO L354 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2021-11-16 21:00:56,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 25 treesize of output 29 [2021-11-16 21:00:56,965 INFO L388 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 22 treesize of output 21 [2021-11-16 21:00:59,178 INFO L354 Elim1Store]: treesize reduction 256, result has 23.1 percent of original size [2021-11-16 21:00:59,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 87 treesize of output 139 [2021-11-16 21:00:59,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:00:59,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:00:59,994 INFO L354 Elim1Store]: treesize reduction 69, result has 16.9 percent of original size [2021-11-16 21:00:59,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 65 [2021-11-16 21:01:00,080 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-16 21:01:00,896 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-16 21:01:00,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 46 [2021-11-16 21:01:00,923 INFO L354 Elim1Store]: treesize reduction 89, result has 13.6 percent of original size [2021-11-16 21:01:00,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 108 treesize of output 88 [2021-11-16 21:02:10,032 INFO L354 Elim1Store]: treesize reduction 2307, result has 0.0 percent of original size [2021-11-16 21:02:10,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 248 treesize of output 1 [2021-11-16 21:02:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 114 proven. 19 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-11-16 21:02:10,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:02:21,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536669213] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:02:21,596 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 21:02:21,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 31 [2021-11-16 21:02:21,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266977989] [2021-11-16 21:02:21,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 21:02:21,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-16 21:02:21,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:02:21,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-16 21:02:21,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1048, Unknown=17, NotChecked=0, Total=1190 [2021-11-16 21:02:21,598 INFO L87 Difference]: Start difference. First operand 281 states and 373 transitions. Second operand has 31 states, 29 states have (on average 4.620689655172414) internal successors, (134), 26 states have internal predecessors, (134), 10 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (30), 8 states have call predecessors, (30), 10 states have call successors, (30) [2021-11-16 21:02:22,647 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:02:24,008 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:02:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:02:48,506 INFO L93 Difference]: Finished difference Result 567 states and 771 transitions. [2021-11-16 21:02:48,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-16 21:02:48,506 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 4.620689655172414) internal successors, (134), 26 states have internal predecessors, (134), 10 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (30), 8 states have call predecessors, (30), 10 states have call successors, (30) Word has length 132 [2021-11-16 21:02:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:02:48,510 INFO L225 Difference]: With dead ends: 567 [2021-11-16 21:02:48,510 INFO L226 Difference]: Without dead ends: 387 [2021-11-16 21:02:48,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 223 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 80.4s TimeCoverageRelationStatistics Valid=294, Invalid=2653, Unknown=23, NotChecked=0, Total=2970 [2021-11-16 21:02:48,512 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 206 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 1707 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 3141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1265 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2021-11-16 21:02:48,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 1473 Invalid, 3141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1707 Invalid, 0 Unknown, 1265 Unchecked, 9.7s Time] [2021-11-16 21:02:48,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-11-16 21:02:48,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 334. [2021-11-16 21:02:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 221 states have (on average 1.0995475113122173) internal successors, (243), 227 states have internal predecessors, (243), 80 states have call successors, (80), 31 states have call predecessors, (80), 32 states have return successors, (114), 75 states have call predecessors, (114), 78 states have call successors, (114) [2021-11-16 21:02:48,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 437 transitions. [2021-11-16 21:02:48,534 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 437 transitions. Word has length 132 [2021-11-16 21:02:48,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:02:48,534 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 437 transitions. [2021-11-16 21:02:48,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 4.620689655172414) internal successors, (134), 26 states have internal predecessors, (134), 10 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (30), 8 states have call predecessors, (30), 10 states have call successors, (30) [2021-11-16 21:02:48,535 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 437 transitions. [2021-11-16 21:02:48,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-16 21:02:48,536 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:02:48,537 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2021-11-16 21:02:48,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-16 21:02:48,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-16 21:02:48,759 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:02:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:02:48,760 INFO L85 PathProgramCache]: Analyzing trace with hash 460361129, now seen corresponding path program 1 times [2021-11-16 21:02:48,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:02:48,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789416083] [2021-11-16 21:02:48,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:02:48,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:02:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:49,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:02:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:49,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:02:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:49,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 21:02:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:50,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:02:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:50,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 21:02:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:50,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 21:02:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:50,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:02:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:50,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:02:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:50,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-16 21:02:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:50,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 21:02:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:50,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-16 21:02:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:50,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-16 21:02:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:50,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-16 21:02:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:50,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-16 21:02:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:50,612 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-16 21:02:50,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:02:50,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789416083] [2021-11-16 21:02:50,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789416083] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:02:50,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033541955] [2021-11-16 21:02:50,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:02:50,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:02:50,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:02:50,615 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) [2021-11-16 21:02:50,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-16 21:02:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:50,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 2685 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-16 21:02:50,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:02:51,878 INFO L388 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 18 treesize of output 14 [2021-11-16 21:02:53,790 INFO L388 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 [2021-11-16 21:02:53,800 INFO L388 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 22 treesize of output 14 [2021-11-16 21:02:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-16 21:02:54,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:02:54,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033541955] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:02:54,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:02:54,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [17] total 31 [2021-11-16 21:02:54,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974267723] [2021-11-16 21:02:54,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:02:54,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-16 21:02:54,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:02:54,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-16 21:02:54,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2021-11-16 21:02:54,261 INFO L87 Difference]: Start difference. First operand 334 states and 437 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2021-11-16 21:02:55,817 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:02:57,228 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:02:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:02:59,545 INFO L93 Difference]: Finished difference Result 543 states and 741 transitions. [2021-11-16 21:02:59,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-16 21:02:59,546 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 131 [2021-11-16 21:02:59,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:02:59,548 INFO L225 Difference]: With dead ends: 543 [2021-11-16 21:02:59,548 INFO L226 Difference]: Without dead ends: 367 [2021-11-16 21:02:59,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2021-11-16 21:02:59,550 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 266 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 556 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2021-11-16 21:02:59,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 715 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 513 Invalid, 0 Unknown, 556 Unchecked, 4.8s Time] [2021-11-16 21:02:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-11-16 21:02:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 334. [2021-11-16 21:02:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 221 states have (on average 1.0950226244343892) internal successors, (242), 227 states have internal predecessors, (242), 80 states have call successors, (80), 31 states have call predecessors, (80), 32 states have return successors, (114), 75 states have call predecessors, (114), 78 states have call successors, (114) [2021-11-16 21:02:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 436 transitions. [2021-11-16 21:02:59,573 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 436 transitions. Word has length 131 [2021-11-16 21:02:59,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:02:59,573 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 436 transitions. [2021-11-16 21:02:59,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 12 states have internal predecessors, (67), 6 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2021-11-16 21:02:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 436 transitions. [2021-11-16 21:02:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-16 21:02:59,575 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:02:59,575 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:02:59,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-16 21:02:59,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:02:59,793 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:02:59,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:02:59,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2134105364, now seen corresponding path program 1 times [2021-11-16 21:02:59,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:02:59,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231230390] [2021-11-16 21:02:59,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:02:59,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:02:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:59,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:02:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:59,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:02:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:59,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:02:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:59,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:02:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:59,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:02:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:59,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 21:02:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:02:59,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:02:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:00,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-16 21:03:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:00,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:03:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:00,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:03:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:00,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:03:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:00,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:03:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:00,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:03:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:00,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:03:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:00,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:03:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:00,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 21:03:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:00,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-16 21:03:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:00,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-16 21:03:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:00,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-16 21:03:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2021-11-16 21:03:00,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:03:00,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231230390] [2021-11-16 21:03:00,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231230390] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:03:00,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354512763] [2021-11-16 21:03:00,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:03:00,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:03:00,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:03:00,274 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) [2021-11-16 21:03:00,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-16 21:03:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:00,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 2691 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:03:00,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:03:01,396 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 94 proven. 84 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-11-16 21:03:01,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:03:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2021-11-16 21:03:02,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354512763] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 21:03:02,118 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 21:03:02,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2021-11-16 21:03:02,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158550951] [2021-11-16 21:03:02,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 21:03:02,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-16 21:03:02,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:03:02,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-16 21:03:02,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-16 21:03:02,120 INFO L87 Difference]: Start difference. First operand 334 states and 436 transitions. Second operand has 15 states, 12 states have (on average 8.166666666666666) internal successors, (98), 14 states have internal predecessors, (98), 10 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (40), 7 states have call predecessors, (40), 10 states have call successors, (40) [2021-11-16 21:03:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:03:04,443 INFO L93 Difference]: Finished difference Result 431 states and 579 transitions. [2021-11-16 21:03:04,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:03:04,444 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 8.166666666666666) internal successors, (98), 14 states have internal predecessors, (98), 10 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (40), 7 states have call predecessors, (40), 10 states have call successors, (40) Word has length 139 [2021-11-16 21:03:04,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:03:04,445 INFO L225 Difference]: With dead ends: 431 [2021-11-16 21:03:04,446 INFO L226 Difference]: Without dead ends: 334 [2021-11-16 21:03:04,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2021-11-16 21:03:04,447 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 223 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-16 21:03:04,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 764 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-16 21:03:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-16 21:03:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2021-11-16 21:03:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 221 states have (on average 1.0950226244343892) internal successors, (242), 227 states have internal predecessors, (242), 80 states have call successors, (80), 31 states have call predecessors, (80), 32 states have return successors, (110), 75 states have call predecessors, (110), 78 states have call successors, (110) [2021-11-16 21:03:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 432 transitions. [2021-11-16 21:03:04,470 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 432 transitions. Word has length 139 [2021-11-16 21:03:04,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:03:04,470 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 432 transitions. [2021-11-16 21:03:04,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 8.166666666666666) internal successors, (98), 14 states have internal predecessors, (98), 10 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (40), 7 states have call predecessors, (40), 10 states have call successors, (40) [2021-11-16 21:03:04,470 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 432 transitions. [2021-11-16 21:03:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-16 21:03:04,472 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:03:04,473 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2021-11-16 21:03:04,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-16 21:03:04,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-11-16 21:03:04,687 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:03:04,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:03:04,688 INFO L85 PathProgramCache]: Analyzing trace with hash -32643708, now seen corresponding path program 1 times [2021-11-16 21:03:04,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:03:04,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68482867] [2021-11-16 21:03:04,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:03:04,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:03:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:06,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:03:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:06,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:03:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:06,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 21:03:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:06,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:03:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:06,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 21:03:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:06,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 21:03:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:06,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:03:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:06,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 21:03:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:06,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-16 21:03:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:06,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-16 21:03:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:06,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-16 21:03:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:06,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 21:03:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:06,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 21:03:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:06,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-16 21:03:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:06,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-16 21:03:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-11-16 21:03:06,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:03:06,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68482867] [2021-11-16 21:03:06,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68482867] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:03:06,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778780090] [2021-11-16 21:03:06,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:03:06,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:03:06,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:03:06,825 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) [2021-11-16 21:03:06,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-16 21:03:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:03:07,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 2706 conjuncts, 87 conjunts are in the unsatisfiable core [2021-11-16 21:03:07,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:03:07,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-16 21:03:07,763 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-16 21:03:07,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-16 21:03:08,107 INFO L388 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 25 treesize of output 21 [2021-11-16 21:03:09,503 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-11-16 21:03:09,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-11-16 21:03:09,689 INFO L388 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 40 treesize of output 20 [2021-11-16 21:03:23,032 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-11-16 21:03:23,032 INFO L388 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 1 case distinctions, treesize of input 48 treesize of output 24 [2021-11-16 21:04:47,616 INFO L354 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2021-11-16 21:04:47,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 50 [2021-11-16 21:04:47,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:04:47,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:04:47,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 17 [2021-11-16 21:04:47,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:04:47,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-16 21:04:47,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2021-11-16 21:04:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 50 proven. 83 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-11-16 21:04:51,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:04:53,697 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-11-16 21:04:53,697 INFO L388 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 19 treesize of output 18 [2021-11-16 21:04:56,015 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= c_aws_byte_cursor_left_trim_pred_~source.base |aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_aws_byte_cursor_left_trim_pred_~source.offset |c_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) |c_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| v_DerPreprocessor_2)) (.cse1 (+ |c_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| 8))) (store .cse0 .cse1 (select .cse0 .cse1)))) c_aws_byte_cursor_left_trim_pred_~source.base) (+ c_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)))) is different from false [2021-11-16 21:04:56,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778780090] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:04:56,162 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 21:04:56,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 42 [2021-11-16 21:04:56,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710383510] [2021-11-16 21:04:56,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 21:04:56,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-16 21:04:56,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:04:56,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-16 21:04:56,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2318, Unknown=4, NotChecked=98, Total=2652 [2021-11-16 21:04:56,164 INFO L87 Difference]: Start difference. First operand 334 states and 432 transitions. Second operand has 42 states, 42 states have (on average 3.142857142857143) internal successors, (132), 36 states have internal predecessors, (132), 16 states have call successors, (32), 10 states have call predecessors, (32), 8 states have return successors, (29), 16 states have call predecessors, (29), 15 states have call successors, (29) [2021-11-16 21:04:58,837 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:05:02,055 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:05:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:26,070 INFO L93 Difference]: Finished difference Result 564 states and 721 transitions. [2021-11-16 21:05:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-11-16 21:05:26,070 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.142857142857143) internal successors, (132), 36 states have internal predecessors, (132), 16 states have call successors, (32), 10 states have call predecessors, (32), 8 states have return successors, (29), 16 states have call predecessors, (29), 15 states have call successors, (29) Word has length 138 [2021-11-16 21:05:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:26,072 INFO L225 Difference]: With dead ends: 564 [2021-11-16 21:05:26,072 INFO L226 Difference]: Without dead ends: 469 [2021-11-16 21:05:26,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 148 SyntacticMatches, 22 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 119.6s TimeCoverageRelationStatistics Valid=563, Invalid=6239, Unknown=8, NotChecked=162, Total=6972 [2021-11-16 21:05:26,075 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 141 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 145 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 3368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1035 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:26,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 1652 Invalid, 3368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2186 Invalid, 2 Unknown, 1035 Unchecked, 15.3s Time] [2021-11-16 21:05:26,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2021-11-16 21:05:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 455. [2021-11-16 21:05:26,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 312 states have (on average 1.0897435897435896) internal successors, (340), 319 states have internal predecessors, (340), 96 states have call successors, (96), 47 states have call predecessors, (96), 46 states have return successors, (127), 88 states have call predecessors, (127), 94 states have call successors, (127) [2021-11-16 21:05:26,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 563 transitions. [2021-11-16 21:05:26,104 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 563 transitions. Word has length 138 [2021-11-16 21:05:26,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:26,105 INFO L470 AbstractCegarLoop]: Abstraction has 455 states and 563 transitions. [2021-11-16 21:05:26,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.142857142857143) internal successors, (132), 36 states have internal predecessors, (132), 16 states have call successors, (32), 10 states have call predecessors, (32), 8 states have return successors, (29), 16 states have call predecessors, (29), 15 states have call successors, (29) [2021-11-16 21:05:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 563 transitions. [2021-11-16 21:05:26,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-16 21:05:26,107 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:26,107 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:05:26,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-16 21:05:26,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:26,324 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:26,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:26,324 INFO L85 PathProgramCache]: Analyzing trace with hash 121582132, now seen corresponding path program 1 times [2021-11-16 21:05:26,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:26,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047916224] [2021-11-16 21:05:26,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:26,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:05:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:05:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:05:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:05:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:05:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 21:05:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:05:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-16 21:05:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:05:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:05:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:05:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:05:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:05:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:05:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 21:05:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 21:05:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-16 21:05:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-16 21:05:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-11-16 21:05:26,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:26,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047916224] [2021-11-16 21:05:26,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047916224] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:05:26,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:05:26,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 21:05:26,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888216859] [2021-11-16 21:05:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:05:26,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:05:26,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:26,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:05:26,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:05:26,978 INFO L87 Difference]: Start difference. First operand 455 states and 563 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2021-11-16 21:05:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:28,546 INFO L93 Difference]: Finished difference Result 465 states and 574 transitions. [2021-11-16 21:05:28,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:05:28,547 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (20), 3 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 143 [2021-11-16 21:05:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:28,550 INFO L225 Difference]: With dead ends: 465 [2021-11-16 21:05:28,550 INFO L226 Difference]: Without dead ends: 463 [2021-11-16 21:05:28,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:05:28,551 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 50 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:28,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 862 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-16 21:05:28,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-11-16 21:05:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 461. [2021-11-16 21:05:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 315 states have (on average 1.0888888888888888) internal successors, (343), 322 states have internal predecessors, (343), 98 states have call successors, (98), 48 states have call predecessors, (98), 47 states have return successors, (129), 90 states have call predecessors, (129), 96 states have call successors, (129) [2021-11-16 21:05:28,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 570 transitions. [2021-11-16 21:05:28,579 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 570 transitions. Word has length 143 [2021-11-16 21:05:28,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:28,579 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 570 transitions. [2021-11-16 21:05:28,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2021-11-16 21:05:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 570 transitions. [2021-11-16 21:05:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-16 21:05:28,582 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:28,582 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:05:28,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-16 21:05:28,582 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:28,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:28,583 INFO L85 PathProgramCache]: Analyzing trace with hash 386312444, now seen corresponding path program 1 times [2021-11-16 21:05:28,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:28,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130617781] [2021-11-16 21:05:28,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:28,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:28,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:05:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:28,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:05:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:28,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:05:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:28,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:05:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:28,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:05:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:28,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 21:05:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:28,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:05:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:28,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-16 21:05:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:29,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:29,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:05:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:29,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:05:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:29,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:05:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:29,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:05:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:29,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:05:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:29,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:05:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:29,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 21:05:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:29,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 21:05:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:29,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-16 21:05:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:29,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-16 21:05:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2021-11-16 21:05:29,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:29,596 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130617781] [2021-11-16 21:05:29,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130617781] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:05:29,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:05:29,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-16 21:05:29,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743972223] [2021-11-16 21:05:29,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:05:29,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-16 21:05:29,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:29,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-16 21:05:29,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-16 21:05:29,597 INFO L87 Difference]: Start difference. First operand 461 states and 570 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-16 21:05:31,952 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:05:34,778 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:05:39,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:39,621 INFO L93 Difference]: Finished difference Result 610 states and 808 transitions. [2021-11-16 21:05:39,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 21:05:39,621 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 3 states have call successors, (19) Word has length 147 [2021-11-16 21:05:39,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:39,624 INFO L225 Difference]: With dead ends: 610 [2021-11-16 21:05:39,624 INFO L226 Difference]: Without dead ends: 501 [2021-11-16 21:05:39,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-16 21:05:39,626 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 94 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:39,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 589 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1086 Invalid, 1 Unknown, 0 Unchecked, 9.7s Time] [2021-11-16 21:05:39,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-11-16 21:05:39,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 477. [2021-11-16 21:05:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 324 states have (on average 1.0925925925925926) internal successors, (354), 331 states have internal predecessors, (354), 104 states have call successors, (104), 48 states have call predecessors, (104), 48 states have return successors, (132), 97 states have call predecessors, (132), 102 states have call successors, (132) [2021-11-16 21:05:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 590 transitions. [2021-11-16 21:05:39,670 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 590 transitions. Word has length 147 [2021-11-16 21:05:39,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:39,671 INFO L470 AbstractCegarLoop]: Abstraction has 477 states and 590 transitions. [2021-11-16 21:05:39,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-16 21:05:39,671 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 590 transitions. [2021-11-16 21:05:39,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-11-16 21:05:39,674 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:39,674 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 6, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:05:39,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-16 21:05:39,674 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:39,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:39,675 INFO L85 PathProgramCache]: Analyzing trace with hash 542080828, now seen corresponding path program 1 times [2021-11-16 21:05:39,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:39,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938906525] [2021-11-16 21:05:39,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:39,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:05:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:05:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:05:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:05:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:05:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 21:05:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:05:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-16 21:05:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:05:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:05:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:05:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:05:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:05:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:05:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 21:05:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 21:05:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-16 21:05:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-16 21:05:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2021-11-16 21:05:39,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:39,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938906525] [2021-11-16 21:05:39,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938906525] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:05:39,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:05:39,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-16 21:05:39,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866004375] [2021-11-16 21:05:39,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:05:39,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 21:05:39,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:05:39,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 21:05:39,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 21:05:39,950 INFO L87 Difference]: Start difference. First operand 477 states and 590 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-16 21:05:41,988 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:05:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:05:42,563 INFO L93 Difference]: Finished difference Result 550 states and 694 transitions. [2021-11-16 21:05:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-16 21:05:42,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2021-11-16 21:05:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:05:42,566 INFO L225 Difference]: With dead ends: 550 [2021-11-16 21:05:42,566 INFO L226 Difference]: Without dead ends: 480 [2021-11-16 21:05:42,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-16 21:05:42,568 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 34 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 36 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-16 21:05:42,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 269 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 113 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2021-11-16 21:05:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-11-16 21:05:42,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2021-11-16 21:05:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 327 states have (on average 1.091743119266055) internal successors, (357), 334 states have internal predecessors, (357), 104 states have call successors, (104), 48 states have call predecessors, (104), 48 states have return successors, (132), 97 states have call predecessors, (132), 102 states have call successors, (132) [2021-11-16 21:05:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 593 transitions. [2021-11-16 21:05:42,598 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 593 transitions. Word has length 150 [2021-11-16 21:05:42,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:05:42,599 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 593 transitions. [2021-11-16 21:05:42,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-16 21:05:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 593 transitions. [2021-11-16 21:05:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-16 21:05:42,601 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:05:42,601 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:05:42,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-16 21:05:42,602 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:05:42,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:05:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1517452615, now seen corresponding path program 1 times [2021-11-16 21:05:42,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:05:42,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137892382] [2021-11-16 21:05:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:42,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:05:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:05:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:42,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:05:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:42,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 21:05:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:42,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:05:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:42,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 21:05:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:42,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 21:05:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:42,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:05:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:42,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 21:05:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:42,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-16 21:05:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:42,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-16 21:05:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:42,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-16 21:05:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:43,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 21:05:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:43,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 21:05:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:43,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-16 21:05:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:43,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-16 21:05:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:43,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-16 21:05:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:43,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 21:05:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 38 proven. 21 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-11-16 21:05:43,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:05:43,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137892382] [2021-11-16 21:05:43,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137892382] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:05:43,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754175004] [2021-11-16 21:05:43,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:05:43,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:05:43,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:05:43,360 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:05:43,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-16 21:05:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:05:43,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 2726 conjuncts, 66 conjunts are in the unsatisfiable core [2021-11-16 21:05:43,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:05:43,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-16 21:05:44,390 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-16 21:05:44,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-16 21:05:46,826 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-16 21:05:46,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2021-11-16 21:05:46,974 INFO L388 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 22 treesize of output 21 [2021-11-16 21:05:49,670 INFO L354 Elim1Store]: treesize reduction 256, result has 23.1 percent of original size [2021-11-16 21:05:49,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 87 treesize of output 139 [2021-11-16 21:05:51,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:51,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:51,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:51,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 42 [2021-11-16 21:05:51,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:51,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:05:51,488 INFO L354 Elim1Store]: treesize reduction 69, result has 16.9 percent of original size [2021-11-16 21:05:51,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 66 [2021-11-16 21:05:51,962 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-16 21:05:51,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 32 [2021-11-16 21:05:52,071 INFO L354 Elim1Store]: treesize reduction 89, result has 13.6 percent of original size [2021-11-16 21:05:52,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 100 treesize of output 80 [2021-11-16 21:07:37,225 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_save_byte_from_array_~storage#1.base| Int) (|v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_30| Int)) (and (not (= |ULTIMATE.start_save_byte_from_array_~storage#1.base| |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_30|)) (let ((.cse0 (not (= (mod (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_trim_pred_~source#1.base_BEFORE_CALL_30|) 0) 18446744073709551616) 0)))) (or (and .cse0 (exists ((|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int)) (<= (mod (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|) |ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) 9223372036854775807))) (and .cse0 (exists ((v_arrayElimIndex_4 Int) (|ULTIMATE.start_save_byte_from_array_~array#1.base| Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int)) (let ((.cse1 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (and (< 9223372036854775807 (mod (select .cse1 |ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616)) (= (select .cse1 (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8)) (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ v_arrayElimIndex_4 (- 18446744073709551616)))))))) (and .cse0 (exists ((v_arrayElimIndex_4 Int) (|ULTIMATE.start_save_byte_from_array_~array#1.base| Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|)) (.cse5 (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse2 (select .cse4 .cse5)) (.cse3 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|))) (and (= .cse2 (select .cse3 v_arrayElimIndex_4)) (<= (mod (select .cse4 |ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) 9223372036854775807) (or (= .cse2 (select .cse3 (+ v_arrayElimIndex_4 (- 18446744073709551616)))) (not (= v_arrayElimIndex_4 .cse5)) (not (= |ULTIMATE.start_save_byte_from_array_~storage#1.base| |ULTIMATE.start_save_byte_from_array_~array#1.base|)))))))))))) is different from true [2021-11-16 21:07:59,788 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_31 Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.base| Int)) (and (let ((.cse0 (not (= (mod (select (select |c_#memory_int| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_31) 0) 18446744073709551616) 0)))) (or (and .cse0 (exists ((|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int)) (<= (mod (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|) |ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) 9223372036854775807))) (and (exists ((v_arrayElimIndex_4 Int) (|ULTIMATE.start_save_byte_from_array_~array#1.base| Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int)) (let ((.cse1 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (and (< 9223372036854775807 (mod (select .cse1 |ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616)) (= (select .cse1 (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8)) (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ v_arrayElimIndex_4 (- 18446744073709551616))))))) .cse0) (and .cse0 (exists ((v_arrayElimIndex_4 Int) (|ULTIMATE.start_save_byte_from_array_~array#1.base| Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|)) (.cse5 (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse2 (select .cse4 .cse5)) (.cse3 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|))) (and (= .cse2 (select .cse3 v_arrayElimIndex_4)) (<= (mod (select .cse4 |ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) 9223372036854775807) (or (= .cse2 (select .cse3 (+ v_arrayElimIndex_4 (- 18446744073709551616)))) (not (= v_arrayElimIndex_4 .cse5)) (not (= |ULTIMATE.start_save_byte_from_array_~storage#1.base| |ULTIMATE.start_save_byte_from_array_~array#1.base|)))))))))) (not (= |ULTIMATE.start_save_byte_from_array_~storage#1.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_31)))) is different from true [2021-11-16 21:08:44,968 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_32 Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.base| Int)) (and (let ((.cse0 (not (= 0 (mod (select (select |c_#memory_int| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_32) 0) 18446744073709551616))))) (or (and .cse0 (exists ((v_arrayElimIndex_4 Int) (|ULTIMATE.start_save_byte_from_array_~array#1.base| Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|)) (.cse4 (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (let ((.cse1 (select .cse3 .cse4)) (.cse2 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|))) (and (= .cse1 (select .cse2 v_arrayElimIndex_4)) (<= (mod (select .cse3 |ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) 9223372036854775807) (or (= .cse1 (select .cse2 (+ v_arrayElimIndex_4 (- 18446744073709551616)))) (not (= v_arrayElimIndex_4 .cse4)) (not (= |ULTIMATE.start_save_byte_from_array_~storage#1.base| |ULTIMATE.start_save_byte_from_array_~array#1.base|)))))))) (and .cse0 (exists ((v_arrayElimIndex_4 Int) (|ULTIMATE.start_save_byte_from_array_~array#1.base| Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int)) (let ((.cse5 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (and (< 9223372036854775807 (mod (select .cse5 |ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616)) (= (select .cse5 (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8)) (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ v_arrayElimIndex_4 (- 18446744073709551616)))))))) (and .cse0 (exists ((|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int)) (<= (mod (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|) |ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) 9223372036854775807))))) (not (= |ULTIMATE.start_save_byte_from_array_~storage#1.base| v_aws_byte_cursor_left_trim_pred_~source.base_BEFORE_CALL_32)))) is different from true [2021-11-16 21:10:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 82 proven. 48 refuted. 0 times theorem prover too weak. 7 trivial. 77 not checked. [2021-11-16 21:10:52,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:11:04,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754175004] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:11:04,238 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 21:11:04,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 26] total 34 [2021-11-16 21:11:04,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037668238] [2021-11-16 21:11:04,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 21:11:04,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-16 21:11:04,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:11:04,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-16 21:11:04,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1115, Unknown=18, NotChecked=210, Total=1482 [2021-11-16 21:11:04,239 INFO L87 Difference]: Start difference. First operand 480 states and 593 transitions. Second operand has 34 states, 34 states have (on average 5.029411764705882) internal successors, (171), 30 states have internal predecessors, (171), 10 states have call successors, (37), 13 states have call predecessors, (37), 14 states have return successors, (34), 10 states have call predecessors, (34), 10 states have call successors, (34) [2021-11-16 21:11:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:11:41,695 INFO L93 Difference]: Finished difference Result 661 states and 840 transitions. [2021-11-16 21:11:41,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-16 21:11:41,696 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.029411764705882) internal successors, (171), 30 states have internal predecessors, (171), 10 states have call successors, (37), 13 states have call predecessors, (37), 14 states have return successors, (34), 10 states have call predecessors, (34), 10 states have call successors, (34) Word has length 149 [2021-11-16 21:11:41,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:11:41,699 INFO L225 Difference]: With dead ends: 661 [2021-11-16 21:11:41,699 INFO L226 Difference]: Without dead ends: 534 [2021-11-16 21:11:41,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 244 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 151.8s TimeCoverageRelationStatistics Valid=394, Invalid=3016, Unknown=24, NotChecked=348, Total=3782 [2021-11-16 21:11:41,702 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 118 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1294 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-16 21:11:41,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 1233 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 684 Invalid, 0 Unknown, 1294 Unchecked, 3.7s Time] [2021-11-16 21:11:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-11-16 21:11:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 504. [2021-11-16 21:11:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 344 states have (on average 1.0872093023255813) internal successors, (374), 352 states have internal predecessors, (374), 107 states have call successors, (107), 51 states have call predecessors, (107), 52 states have return successors, (138), 100 states have call predecessors, (138), 105 states have call successors, (138) [2021-11-16 21:11:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 619 transitions. [2021-11-16 21:11:41,738 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 619 transitions. Word has length 149 [2021-11-16 21:11:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:11:41,739 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 619 transitions. [2021-11-16 21:11:41,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.029411764705882) internal successors, (171), 30 states have internal predecessors, (171), 10 states have call successors, (37), 13 states have call predecessors, (37), 14 states have return successors, (34), 10 states have call predecessors, (34), 10 states have call successors, (34) [2021-11-16 21:11:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 619 transitions. [2021-11-16 21:11:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-16 21:11:41,741 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:11:41,741 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:11:41,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-16 21:11:41,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:11:41,955 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:11:41,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:11:41,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1095383274, now seen corresponding path program 1 times [2021-11-16 21:11:41,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:11:41,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955988865] [2021-11-16 21:11:41,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:11:41,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:11:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:11:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:11:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:11:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:11:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:11:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 21:11:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:11:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-16 21:11:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:11:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:11:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:11:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:11:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:11:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:11:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:11:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 21:11:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 21:11:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-16 21:11:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-16 21:11:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-16 21:11:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-16 21:11:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2021-11-16 21:11:42,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:11:42,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955988865] [2021-11-16 21:11:42,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955988865] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:11:42,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:11:42,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 21:11:42,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060173309] [2021-11-16 21:11:42,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:11:42,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 21:11:42,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:11:42,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 21:11:42,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-16 21:11:42,309 INFO L87 Difference]: Start difference. First operand 504 states and 619 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 21:11:43,370 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:11:44,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:11:44,198 INFO L93 Difference]: Finished difference Result 567 states and 702 transitions. [2021-11-16 21:11:44,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:11:44,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 155 [2021-11-16 21:11:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:11:44,202 INFO L225 Difference]: With dead ends: 567 [2021-11-16 21:11:44,202 INFO L226 Difference]: Without dead ends: 504 [2021-11-16 21:11:44,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:11:44,203 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 51 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-16 21:11:44,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 353 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-16 21:11:44,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-11-16 21:11:44,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2021-11-16 21:11:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 344 states have (on average 1.0872093023255813) internal successors, (374), 352 states have internal predecessors, (374), 107 states have call successors, (107), 51 states have call predecessors, (107), 52 states have return successors, (136), 100 states have call predecessors, (136), 105 states have call successors, (136) [2021-11-16 21:11:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 617 transitions. [2021-11-16 21:11:44,235 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 617 transitions. Word has length 155 [2021-11-16 21:11:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:11:44,236 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 617 transitions. [2021-11-16 21:11:44,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 21:11:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 617 transitions. [2021-11-16 21:11:44,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-16 21:11:44,238 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:11:44,238 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 7, 7, 7, 7, 7, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:11:44,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-16 21:11:44,238 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:11:44,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:11:44,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1970085808, now seen corresponding path program 1 times [2021-11-16 21:11:44,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:11:44,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973873246] [2021-11-16 21:11:44,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:11:44,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:11:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:44,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:11:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:44,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:11:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:44,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 21:11:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:44,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:11:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:44,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 21:11:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:44,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-16 21:11:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:44,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-16 21:11:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:44,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 21:11:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:44,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 21:11:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:45,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-16 21:11:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:45,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:11:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:45,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:11:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:45,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:11:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:45,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:11:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:45,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:11:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:45,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:11:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:45,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:11:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:45,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-16 21:11:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:45,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-16 21:11:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:45,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 21:11:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:45,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-16 21:11:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:45,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-11-16 21:11:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2021-11-16 21:11:45,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:11:45,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973873246] [2021-11-16 21:11:45,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973873246] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:11:45,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727638816] [2021-11-16 21:11:45,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:11:45,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:11:45,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:11:45,495 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:11:45,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-16 21:11:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:46,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 2785 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-16 21:11:46,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:11:47,767 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-16 21:11:47,767 INFO L388 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 55 treesize of output 31 [2021-11-16 21:11:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2021-11-16 21:11:47,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:11:47,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727638816] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:11:47,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:11:47,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 24 [2021-11-16 21:11:47,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036763575] [2021-11-16 21:11:47,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:11:47,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-16 21:11:47,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:11:47,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-16 21:11:47,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2021-11-16 21:11:47,989 INFO L87 Difference]: Start difference. First operand 504 states and 617 transitions. Second operand has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 5 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (22), 4 states have call predecessors, (22), 5 states have call successors, (22) [2021-11-16 21:11:49,211 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-16 21:11:50,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:11:50,795 INFO L93 Difference]: Finished difference Result 616 states and 784 transitions. [2021-11-16 21:11:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-16 21:11:50,796 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 5 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (22), 4 states have call predecessors, (22), 5 states have call successors, (22) Word has length 167 [2021-11-16 21:11:50,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:11:50,799 INFO L225 Difference]: With dead ends: 616 [2021-11-16 21:11:50,799 INFO L226 Difference]: Without dead ends: 523 [2021-11-16 21:11:50,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 199 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2021-11-16 21:11:50,801 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 65 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-16 21:11:50,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 887 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 291 Invalid, 0 Unknown, 68 Unchecked, 2.2s Time] [2021-11-16 21:11:50,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-11-16 21:11:50,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 508. [2021-11-16 21:11:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 347 states have (on average 1.07492795389049) internal successors, (373), 354 states have internal predecessors, (373), 107 states have call successors, (107), 52 states have call predecessors, (107), 53 states have return successors, (136), 101 states have call predecessors, (136), 105 states have call successors, (136) [2021-11-16 21:11:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 616 transitions. [2021-11-16 21:11:50,835 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 616 transitions. Word has length 167 [2021-11-16 21:11:50,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:11:50,835 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 616 transitions. [2021-11-16 21:11:50,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 11 states have internal predecessors, (74), 5 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (22), 4 states have call predecessors, (22), 5 states have call successors, (22) [2021-11-16 21:11:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 616 transitions. [2021-11-16 21:11:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-16 21:11:50,838 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:11:50,838 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:11:50,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-11-16 21:11:51,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-16 21:11:51,051 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:11:51,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:11:51,052 INFO L85 PathProgramCache]: Analyzing trace with hash -23336005, now seen corresponding path program 1 times [2021-11-16 21:11:51,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:11:51,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057917339] [2021-11-16 21:11:51,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:11:51,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:11:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:11:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:11:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-16 21:11:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:11:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:11:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 21:11:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:11:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-16 21:11:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:11:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:11:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-16 21:11:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:11:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 21:11:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 21:11:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 21:11:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-16 21:11:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-16 21:11:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-16 21:11:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-16 21:11:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-16 21:11:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-16 21:11:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2021-11-16 21:11:51,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:11:51,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057917339] [2021-11-16 21:11:51,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057917339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:11:51,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 21:11:51,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 21:11:51,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778355171] [2021-11-16 21:11:51,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:11:51,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 21:11:51,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:11:51,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 21:11:51,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-16 21:11:51,538 INFO L87 Difference]: Start difference. First operand 508 states and 616 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2021-11-16 21:11:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:11:53,482 INFO L93 Difference]: Finished difference Result 518 states and 627 transitions. [2021-11-16 21:11:53,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-16 21:11:53,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 157 [2021-11-16 21:11:53,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:11:53,485 INFO L225 Difference]: With dead ends: 518 [2021-11-16 21:11:53,485 INFO L226 Difference]: Without dead ends: 516 [2021-11-16 21:11:53,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-16 21:11:53,486 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 50 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-16 21:11:53,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 855 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-16 21:11:53,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-11-16 21:11:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 514. [2021-11-16 21:11:53,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 350 states have (on average 1.0742857142857143) internal successors, (376), 357 states have internal predecessors, (376), 109 states have call successors, (109), 53 states have call predecessors, (109), 54 states have return successors, (138), 103 states have call predecessors, (138), 107 states have call successors, (138) [2021-11-16 21:11:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 623 transitions. [2021-11-16 21:11:53,520 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 623 transitions. Word has length 157 [2021-11-16 21:11:53,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:11:53,520 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 623 transitions. [2021-11-16 21:11:53,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2021-11-16 21:11:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 623 transitions. [2021-11-16 21:11:53,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-16 21:11:53,523 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:11:53,523 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:11:53,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-16 21:11:53,523 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:11:53,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:11:53,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1857876136, now seen corresponding path program 1 times [2021-11-16 21:11:53,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:11:53,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139156440] [2021-11-16 21:11:53,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:11:53,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:11:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:11:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:11:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 21:11:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:11:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 21:11:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 21:11:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:11:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 21:11:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-16 21:11:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-16 21:11:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-16 21:11:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 21:11:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 21:11:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-16 21:11:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-16 21:11:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 21:11:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-16 21:11:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2021-11-16 21:11:53,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:11:53,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139156440] [2021-11-16 21:11:53,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139156440] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:11:53,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112730224] [2021-11-16 21:11:53,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:11:53,951 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:11:53,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:11:53,955 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:11:53,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-16 21:11:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:54,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 2743 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 21:11:54,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:11:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-11-16 21:11:54,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 21:11:54,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112730224] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 21:11:54,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 21:11:54,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2021-11-16 21:11:54,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59831586] [2021-11-16 21:11:54,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 21:11:54,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 21:11:54,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:11:54,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 21:11:54,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-16 21:11:54,976 INFO L87 Difference]: Start difference. First operand 514 states and 623 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-16 21:11:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:11:55,790 INFO L93 Difference]: Finished difference Result 868 states and 1065 transitions. [2021-11-16 21:11:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 21:11:55,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 155 [2021-11-16 21:11:55,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:11:55,793 INFO L225 Difference]: With dead ends: 868 [2021-11-16 21:11:55,793 INFO L226 Difference]: Without dead ends: 507 [2021-11-16 21:11:55,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-16 21:11:55,795 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 15 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-16 21:11:55,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 517 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 44 Unchecked, 0.6s Time] [2021-11-16 21:11:55,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-11-16 21:11:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2021-11-16 21:11:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 347 states have (on average 1.063400576368876) internal successors, (369), 354 states have internal predecessors, (369), 105 states have call successors, (105), 52 states have call predecessors, (105), 54 states have return successors, (130), 100 states have call predecessors, (130), 103 states have call successors, (130) [2021-11-16 21:11:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 604 transitions. [2021-11-16 21:11:55,844 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 604 transitions. Word has length 155 [2021-11-16 21:11:55,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:11:55,845 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 604 transitions. [2021-11-16 21:11:55,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-16 21:11:55,845 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 604 transitions. [2021-11-16 21:11:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-16 21:11:55,847 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:11:55,847 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 21:11:55,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-16 21:11:56,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-16 21:11:56,067 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:11:56,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:11:56,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1886376426, now seen corresponding path program 1 times [2021-11-16 21:11:56,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:11:56,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062515751] [2021-11-16 21:11:56,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:11:56,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:11:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-16 21:11:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-16 21:11:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-16 21:11:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:11:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-16 21:11:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-16 21:11:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 21:11:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 21:11:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-16 21:11:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-16 21:11:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-16 21:11:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 21:11:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 21:11:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-16 21:11:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-16 21:11:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 21:11:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:57,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-16 21:11:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 40 proven. 20 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2021-11-16 21:11:58,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:11:58,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062515751] [2021-11-16 21:11:58,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062515751] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:11:58,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111805672] [2021-11-16 21:11:58,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:11:58,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:11:58,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:11:58,422 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-16 21:11:58,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-16 21:11:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:11:58,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 2748 conjuncts, 83 conjunts are in the unsatisfiable core [2021-11-16 21:11:58,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:11:58,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-16 21:11:59,565 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-16 21:11:59,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-16 21:11:59,941 INFO L388 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 25 treesize of output 21 [2021-11-16 21:12:01,398 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-11-16 21:12:01,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2021-11-16 21:12:01,600 INFO L388 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 40 treesize of output 20 [2021-11-16 21:12:15,235 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-11-16 21:12:15,236 INFO L388 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 1 case distinctions, treesize of input 48 treesize of output 24 Killed by 15