./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_read_be64_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_read_be64_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 9b90640eabcf61bf9b6c4e01fcd2a39b8b829676407f71504872cd65ce1f895a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-16 20:58:20,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-16 20:58:20,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-16 20:58:21,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-16 20:58:21,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-16 20:58:21,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-16 20:58:21,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-16 20:58:21,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-16 20:58:21,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-16 20:58:21,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-16 20:58:21,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-16 20:58:21,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-16 20:58:21,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-16 20:58:21,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-16 20:58:21,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-16 20:58:21,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-16 20:58:21,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-16 20:58:21,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-16 20:58:21,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-16 20:58:21,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-16 20:58:21,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-16 20:58:21,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-16 20:58:21,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-16 20:58:21,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-16 20:58:21,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-16 20:58:21,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-16 20:58:21,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-16 20:58:21,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-16 20:58:21,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-16 20:58:21,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-16 20:58:21,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-16 20:58:21,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-16 20:58:21,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-16 20:58:21,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-16 20:58:21,062 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-16 20:58:21,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-16 20:58:21,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-16 20:58:21,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-16 20:58:21,063 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-16 20:58:21,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-16 20:58:21,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-16 20:58:21,065 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:21,098 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-16 20:58:21,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-16 20:58:21,098 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-16 20:58:21,099 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-16 20:58:21,099 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-16 20:58:21,100 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-16 20:58:21,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-16 20:58:21,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-16 20:58:21,101 INFO L138 SettingsManager]: * Use SBE=true [2021-11-16 20:58:21,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-16 20:58:21,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-16 20:58:21,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-16 20:58:21,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-16 20:58:21,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-16 20:58:21,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-16 20:58:21,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-16 20:58:21,103 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-16 20:58:21,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-16 20:58:21,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-16 20:58:21,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-16 20:58:21,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-16 20:58:21,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:58:21,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-16 20:58:21,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-16 20:58:21,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-16 20:58:21,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-16 20:58:21,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-16 20:58:21,105 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-16 20:58:21,105 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-16 20:58:21,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-16 20:58:21,106 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-16 20:58:21,106 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 -> 9b90640eabcf61bf9b6c4e01fcd2a39b8b829676407f71504872cd65ce1f895a [2021-11-16 20:58:21,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-16 20:58:21,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-16 20:58:21,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-16 20:58:21,348 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-16 20:58:21,348 INFO L275 PluginConnector]: CDTParser initialized [2021-11-16 20:58:21,349 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_read_be64_harness.i [2021-11-16 20:58:21,413 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4fafcc31/5be376ab094848598ed004c8eb6363da/FLAGfe46176e3 [2021-11-16 20:58:22,014 INFO L306 CDTParser]: Found 1 translation units. [2021-11-16 20:58:22,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_read_be64_harness.i [2021-11-16 20:58:22,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4fafcc31/5be376ab094848598ed004c8eb6363da/FLAGfe46176e3 [2021-11-16 20:58:22,172 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4fafcc31/5be376ab094848598ed004c8eb6363da [2021-11-16 20:58:22,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-16 20:58:22,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-16 20:58:22,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-16 20:58:22,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-16 20:58:22,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-16 20:58:22,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:58:22" (1/1) ... [2021-11-16 20:58:22,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60188290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:22, skipping insertion in model container [2021-11-16 20:58:22,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:58:22" (1/1) ... [2021-11-16 20:58:22,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-16 20:58:22,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-16 20:58:22,507 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_read_be64_harness.i[4499,4512] [2021-11-16 20:58:22,515 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_read_be64_harness.i[4559,4572] [2021-11-16 20:58:22,537 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:58:22,543 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:58:23,126 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,127 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,127 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,128 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,129 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,139 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,139 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,141 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,141 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,372 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:58:23,373 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:58:23,374 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:58:23,375 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:58:23,376 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:58:23,377 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:58:23,377 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:58:23,378 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:58:23,378 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:58:23,379 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:58:23,484 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:58:23,598 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,601 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,665 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:58:23,720 INFO L203 MainTranslator]: Completed pre-run [2021-11-16 20:58:23,746 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_read_be64_harness.i[4499,4512] [2021-11-16 20:58:23,747 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_read_be64_harness.i[4559,4572] [2021-11-16 20:58:23,749 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-16 20:58:23,750 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-16 20:58:23,770 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,771 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,771 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,772 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,772 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,776 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,777 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,777 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,778 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,799 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-16 20:58:23,800 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-16 20:58:23,800 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-16 20:58:23,801 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-16 20:58:23,801 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-16 20:58:23,802 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-16 20:58:23,802 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-16 20:58:23,802 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-16 20:58:23,803 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-16 20:58:23,803 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-16 20:58:23,818 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-16 20:58:23,891 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,892 WARN L1537 CHandler]: Possible shadowing of function index [2021-11-16 20:58:23,920 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-16 20:58:24,125 INFO L208 MainTranslator]: Completed translation [2021-11-16 20:58:24,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:24 WrapperNode [2021-11-16 20:58:24,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-16 20:58:24,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-16 20:58:24,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-16 20:58:24,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-16 20:58:24,132 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:58:24" (1/1) ... [2021-11-16 20:58:24,223 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:58:24" (1/1) ... [2021-11-16 20:58:24,308 INFO L137 Inliner]: procedures = 693, calls = 2647, calls flagged for inlining = 61, calls inlined = 11, statements flattened = 971 [2021-11-16 20:58:24,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-16 20:58:24,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-16 20:58:24,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-16 20:58:24,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-16 20:58:24,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:24" (1/1) ... [2021-11-16 20:58:24,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:24" (1/1) ... [2021-11-16 20:58:24,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:24" (1/1) ... [2021-11-16 20:58:24,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:24" (1/1) ... [2021-11-16 20:58:24,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:24" (1/1) ... [2021-11-16 20:58:24,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:24" (1/1) ... [2021-11-16 20:58:24,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:24" (1/1) ... [2021-11-16 20:58:24,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-16 20:58:24,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-16 20:58:24,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-16 20:58:24,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-16 20:58:24,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:24" (1/1) ... [2021-11-16 20:58:24,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-16 20:58:24,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:24,416 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:58:24,427 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:58:24,458 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_read [2021-11-16 20:58:24,458 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_read [2021-11-16 20:58:24,458 INFO L130 BoogieDeclarations]: Found specification of procedure htonl [2021-11-16 20:58:24,459 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hton64 [2021-11-16 20:58:24,459 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hton64 [2021-11-16 20:58:24,459 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2021-11-16 20:58:24,459 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2021-11-16 20:58:24,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-16 20:58:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-11-16 20:58:24,461 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-11-16 20:58:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2021-11-16 20:58:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-16 20:58:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-16 20:58:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure aws_ntoh64 [2021-11-16 20:58:24,462 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_ntoh64 [2021-11-16 20:58:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-16 20:58:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-16 20:58:24,463 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-16 20:58:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-16 20:58:24,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-16 20:58:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-16 20:58:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-16 20:58:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-16 20:58:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-16 20:58:24,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-16 20:58:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-11-16 20:58:24,465 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-11-16 20:58:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2021-11-16 20:58:24,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2021-11-16 20:58:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-16 20:58:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-16 20:58:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2021-11-16 20:58:24,466 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2021-11-16 20:58:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-16 20:58:24,466 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-16 20:58:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-16 20:58:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-16 20:58:24,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-16 20:58:24,467 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-11-16 20:58:24,467 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-11-16 20:58:24,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-16 20:58:24,467 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_big_endian [2021-11-16 20:58:24,467 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_big_endian [2021-11-16 20:58:24,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2021-11-16 20:58:24,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-16 20:58:24,742 INFO L236 CfgBuilder]: Building ICFG [2021-11-16 20:58:24,744 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-16 20:58:26,444 INFO L277 CfgBuilder]: Performing block encoding [2021-11-16 20:58:26,452 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-16 20:58:26,452 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-16 20:58:26,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:58:26 BoogieIcfgContainer [2021-11-16 20:58:26,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-16 20:58:26,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-16 20:58:26,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-16 20:58:26,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-16 20:58:26,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:58:22" (1/3) ... [2021-11-16 20:58:26,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6205377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:58:26, skipping insertion in model container [2021-11-16 20:58:26,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:58:24" (2/3) ... [2021-11-16 20:58:26,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6205377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:58:26, skipping insertion in model container [2021-11-16 20:58:26,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:58:26" (3/3) ... [2021-11-16 20:58:26,461 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_read_be64_harness.i [2021-11-16 20:58:26,465 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-16 20:58:26,465 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-16 20:58:26,512 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-16 20:58:26,523 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:58:26,523 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-16 20:58:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 105 states have internal predecessors, (127), 50 states have call successors, (50), 13 states have call predecessors, (50), 13 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-16 20:58:26,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-16 20:58:26,555 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:26,556 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:58:26,556 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:26,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:26,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2071909208, now seen corresponding path program 1 times [2021-11-16 20:58:26,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:26,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219401433] [2021-11-16 20:58:26,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:26,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:58:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:58:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 20:58:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-16 20:58:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:58:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 20:58:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-16 20:58:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:58:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-16 20:58:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-16 20:58:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-16 20:58:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 20:58:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 20:58:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-16 20:58:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-16 20:58:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-16 20:58:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-16 20:58:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-16 20:58:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-11-16 20:58:27,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:27,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219401433] [2021-11-16 20:58:27,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219401433] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:27,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018600810] [2021-11-16 20:58:27,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:27,400 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:27,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:27,407 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:58:27,414 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:58:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:27,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 2700 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 20:58:27,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:58:28,335 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2021-11-16 20:58:28,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:58:28,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018600810] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:28,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:58:28,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2021-11-16 20:58:28,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899968202] [2021-11-16 20:58:28,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:28,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:58:28,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:28,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:58:28,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:58:28,376 INFO L87 Difference]: Start difference. First operand has 169 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 105 states have internal predecessors, (127), 50 states have call successors, (50), 13 states have call predecessors, (50), 13 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2021-11-16 20:58:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:28,654 INFO L93 Difference]: Finished difference Result 334 states and 486 transitions. [2021-11-16 20:58:28,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:58:28,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 135 [2021-11-16 20:58:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:28,672 INFO L225 Difference]: With dead ends: 334 [2021-11-16 20:58:28,672 INFO L226 Difference]: Without dead ends: 166 [2021-11-16 20:58:28,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:58:28,686 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 247 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:28,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 473 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:58:28,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-16 20:58:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-11-16 20:58:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 50 states have call successors, (50), 13 states have call predecessors, (50), 14 states have return successors, (57), 49 states have call predecessors, (57), 49 states have call successors, (57) [2021-11-16 20:58:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 229 transitions. [2021-11-16 20:58:28,750 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 229 transitions. Word has length 135 [2021-11-16 20:58:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:28,751 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 229 transitions. [2021-11-16 20:58:28,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2021-11-16 20:58:28,751 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 229 transitions. [2021-11-16 20:58:28,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-16 20:58:28,760 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:28,760 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:28,807 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:58:28,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-11-16 20:58:28,976 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:28,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:28,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2052663395, now seen corresponding path program 1 times [2021-11-16 20:58:28,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:28,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174319579] [2021-11-16 20:58:28,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:28,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:58:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:58:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 20:58:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-16 20:58:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:58:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:58:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:58:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 20:58:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 20:58:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-16 20:58:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-16 20:58:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 20:58:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-16 20:58:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-16 20:58:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-16 20:58:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 20:58:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-16 20:58:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-16 20:58:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2021-11-16 20:58:29,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:29,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174319579] [2021-11-16 20:58:29,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174319579] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:29,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325620815] [2021-11-16 20:58:29,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:29,410 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:29,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:29,411 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:58:29,442 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:58:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:29,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 2705 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 20:58:29,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:58:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-11-16 20:58:30,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:58:30,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325620815] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:30,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:58:30,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2021-11-16 20:58:30,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645667942] [2021-11-16 20:58:30,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:30,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 20:58:30,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:30,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 20:58:30,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-11-16 20:58:30,282 INFO L87 Difference]: Start difference. First operand 166 states and 229 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2021-11-16 20:58:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:30,564 INFO L93 Difference]: Finished difference Result 288 states and 398 transitions. [2021-11-16 20:58:30,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 20:58:30,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 137 [2021-11-16 20:58:30,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:30,567 INFO L225 Difference]: With dead ends: 288 [2021-11-16 20:58:30,567 INFO L226 Difference]: Without dead ends: 166 [2021-11-16 20:58:30,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2021-11-16 20:58:30,569 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 260 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:30,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 756 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-16 20:58:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-16 20:58:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-11-16 20:58:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 50 states have call successors, (50), 13 states have call predecessors, (50), 14 states have return successors, (55), 49 states have call predecessors, (55), 49 states have call successors, (55) [2021-11-16 20:58:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 227 transitions. [2021-11-16 20:58:30,583 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 227 transitions. Word has length 137 [2021-11-16 20:58:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:30,584 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 227 transitions. [2021-11-16 20:58:30,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2021-11-16 20:58:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 227 transitions. [2021-11-16 20:58:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-16 20:58:30,586 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:30,586 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:30,617 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:58:30,812 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,SelfDestructingSolverStorable1 [2021-11-16 20:58:30,812 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:30,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:30,813 INFO L85 PathProgramCache]: Analyzing trace with hash 702875934, now seen corresponding path program 2 times [2021-11-16 20:58:30,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:30,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721822269] [2021-11-16 20:58:30,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:30,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:58:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:58:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 20:58:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-16 20:58:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:58:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:58:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:58:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 20:58:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 20:58:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-16 20:58:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-16 20:58:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 20:58:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-16 20:58:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-16 20:58:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-11-16 20:58:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-16 20:58:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-16 20:58:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-16 20:58:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2021-11-16 20:58:31,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:31,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721822269] [2021-11-16 20:58:31,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721822269] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:31,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203005500] [2021-11-16 20:58:31,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 20:58:31,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:31,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:31,283 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:58:31,293 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:58:35,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 20:58:35,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 20:58:35,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 2710 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-16 20:58:35,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:58:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-11-16 20:58:36,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:58:36,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203005500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:36,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:58:36,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 13 [2021-11-16 20:58:36,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368900064] [2021-11-16 20:58:36,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:36,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 20:58:36,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:36,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 20:58:36,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:58:36,275 INFO L87 Difference]: Start difference. First operand 166 states and 227 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 5 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (21), 4 states have call predecessors, (21), 5 states have call successors, (21) [2021-11-16 20:58:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:36,440 INFO L93 Difference]: Finished difference Result 282 states and 385 transitions. [2021-11-16 20:58:36,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:58:36,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 5 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (21), 4 states have call predecessors, (21), 5 states have call successors, (21) Word has length 139 [2021-11-16 20:58:36,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:36,444 INFO L225 Difference]: With dead ends: 282 [2021-11-16 20:58:36,444 INFO L226 Difference]: Without dead ends: 166 [2021-11-16 20:58:36,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:58:36,446 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 105 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:36,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 1046 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:58:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-16 20:58:36,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-11-16 20:58:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 50 states have call successors, (50), 13 states have call predecessors, (50), 14 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2021-11-16 20:58:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2021-11-16 20:58:36,460 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 224 transitions. Word has length 139 [2021-11-16 20:58:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:36,460 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 224 transitions. [2021-11-16 20:58:36,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 5 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (21), 4 states have call predecessors, (21), 5 states have call successors, (21) [2021-11-16 20:58:36,461 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 224 transitions. [2021-11-16 20:58:36,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-11-16 20:58:36,462 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:36,462 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 3, 3, 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] [2021-11-16 20:58:36,493 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:58:36,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:36,663 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:36,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:36,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1036609347, now seen corresponding path program 3 times [2021-11-16 20:58:36,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:36,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579758400] [2021-11-16 20:58:36,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:36,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:36,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:58:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:36,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:36,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:58:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:36,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 20:58:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:36,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-16 20:58:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:36,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:58:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:36,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:58:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:36,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:58:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:36,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 20:58:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:36,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 20:58:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:36,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:36,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:36,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-16 20:58:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:36,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-16 20:58:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:36,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 20:58:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-16 20:58:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:37,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-16 20:58:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:37,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-16 20:58:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:37,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-16 20:58:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:37,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-16 20:58:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:37,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-16 20:58:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-11-16 20:58:37,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:37,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579758400] [2021-11-16 20:58:37,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579758400] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:37,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055220560] [2021-11-16 20:58:37,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-16 20:58:37,099 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:37,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:37,104 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:58:37,129 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:58:41,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-16 20:58:41,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 20:58:41,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 2360 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-16 20:58:41,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:58:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-11-16 20:58:42,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:58:42,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055220560] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:42,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:58:42,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2021-11-16 20:58:42,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120588841] [2021-11-16 20:58:42,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:42,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-16 20:58:42,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:42,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-16 20:58:42,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2021-11-16 20:58:42,088 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2021-11-16 20:58:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:42,194 INFO L93 Difference]: Finished difference Result 277 states and 371 transitions. [2021-11-16 20:58:42,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-16 20:58:42,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 141 [2021-11-16 20:58:42,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:42,196 INFO L225 Difference]: With dead ends: 277 [2021-11-16 20:58:42,196 INFO L226 Difference]: Without dead ends: 166 [2021-11-16 20:58:42,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-11-16 20:58:42,198 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 2 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:42,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1196 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:58:42,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-16 20:58:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-11-16 20:58:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 50 states have call successors, (50), 13 states have call predecessors, (50), 14 states have return successors, (51), 49 states have call predecessors, (51), 49 states have call successors, (51) [2021-11-16 20:58:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 223 transitions. [2021-11-16 20:58:42,211 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 223 transitions. Word has length 141 [2021-11-16 20:58:42,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:42,211 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 223 transitions. [2021-11-16 20:58:42,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2021-11-16 20:58:42,212 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 223 transitions. [2021-11-16 20:58:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-16 20:58:42,213 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:42,213 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:42,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-16 20:58:42,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:42,439 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:42,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:42,440 INFO L85 PathProgramCache]: Analyzing trace with hash 197461288, now seen corresponding path program 4 times [2021-11-16 20:58:42,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:42,440 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122426671] [2021-11-16 20:58:42,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:42,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:58:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:58:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 20:58:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-16 20:58:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:58:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:58:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:58:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 20:58:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 20:58:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-16 20:58:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-16 20:58:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 20:58:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-16 20:58:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-16 20:58:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-16 20:58:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-16 20:58:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-16 20:58:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 20:58:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-11-16 20:58:42,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:42,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122426671] [2021-11-16 20:58:42,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122426671] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:42,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366595943] [2021-11-16 20:58:42,871 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-16 20:58:42,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:42,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:42,872 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:58:42,874 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:58:43,325 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-16 20:58:43,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 20:58:43,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 2720 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-16 20:58:43,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:58:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2021-11-16 20:58:43,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:58:43,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366595943] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:43,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:58:43,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2021-11-16 20:58:43,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570661398] [2021-11-16 20:58:43,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:43,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 20:58:43,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:43,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 20:58:43,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2021-11-16 20:58:43,754 INFO L87 Difference]: Start difference. First operand 166 states and 223 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 6 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 6 states have call predecessors, (21), 5 states have call successors, (21) [2021-11-16 20:58:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:44,131 INFO L93 Difference]: Finished difference Result 271 states and 359 transitions. [2021-11-16 20:58:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:58:44,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 6 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 6 states have call predecessors, (21), 5 states have call successors, (21) Word has length 143 [2021-11-16 20:58:44,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:44,133 INFO L225 Difference]: With dead ends: 271 [2021-11-16 20:58:44,133 INFO L226 Difference]: Without dead ends: 166 [2021-11-16 20:58:44,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2021-11-16 20:58:44,134 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 292 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:44,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 984 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-16 20:58:44,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-16 20:58:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-11-16 20:58:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 103 states have internal predecessors, (122), 50 states have call successors, (50), 13 states have call predecessors, (50), 14 states have return successors, (50), 49 states have call predecessors, (50), 49 states have call successors, (50) [2021-11-16 20:58:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 222 transitions. [2021-11-16 20:58:44,145 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 222 transitions. Word has length 143 [2021-11-16 20:58:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:44,146 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 222 transitions. [2021-11-16 20:58:44,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 6 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 6 states have call predecessors, (21), 5 states have call successors, (21) [2021-11-16 20:58:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 222 transitions. [2021-11-16 20:58:44,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-16 20:58:44,148 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:44,148 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-16 20:58:44,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-16 20:58:44,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:44,363 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1175651149, now seen corresponding path program 1 times [2021-11-16 20:58:44,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:44,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494927565] [2021-11-16 20:58:44,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:44,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:58:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:58:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 20:58:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-16 20:58:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:58:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:58:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:58:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 20:58:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 20:58:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-16 20:58:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-16 20:58:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 20:58:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-16 20:58:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-16 20:58:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-16 20:58:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-16 20:58:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-16 20:58:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 20:58:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2021-11-16 20:58:44,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:44,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494927565] [2021-11-16 20:58:44,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494927565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:44,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:58:44,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-16 20:58:44,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626549271] [2021-11-16 20:58:44,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:44,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-16 20:58:44,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:44,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-16 20:58:44,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:58:44,743 INFO L87 Difference]: Start difference. First operand 166 states and 222 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2021-11-16 20:58:47,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:47,500 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2021-11-16 20:58:47,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-16 20:58:47,501 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2021-11-16 20:58:47,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:47,504 INFO L225 Difference]: With dead ends: 185 [2021-11-16 20:58:47,504 INFO L226 Difference]: Without dead ends: 183 [2021-11-16 20:58:47,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-11-16 20:58:47,505 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 138 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:47,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 1119 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-11-16 20:58:47,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-11-16 20:58:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 175. [2021-11-16 20:58:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 107 states have (on average 1.1962616822429906) internal successors, (128), 110 states have internal predecessors, (128), 51 states have call successors, (51), 14 states have call predecessors, (51), 16 states have return successors, (61), 50 states have call predecessors, (61), 50 states have call successors, (61) [2021-11-16 20:58:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 240 transitions. [2021-11-16 20:58:47,518 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 240 transitions. Word has length 145 [2021-11-16 20:58:47,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:47,519 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 240 transitions. [2021-11-16 20:58:47,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2021-11-16 20:58:47,519 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 240 transitions. [2021-11-16 20:58:47,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-16 20:58:47,521 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:47,521 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:47,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-16 20:58:47,521 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:47,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:47,522 INFO L85 PathProgramCache]: Analyzing trace with hash -174149227, now seen corresponding path program 1 times [2021-11-16 20:58:47,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:47,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73784070] [2021-11-16 20:58:47,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:47,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:58:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:58:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 20:58:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-16 20:58:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:58:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:58:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:58:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 20:58:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-16 20:58:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-16 20:58:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-16 20:58:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-16 20:58:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-16 20:58:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-16 20:58:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-16 20:58:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-16 20:58:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-16 20:58:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 20:58:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2021-11-16 20:58:47,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:47,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73784070] [2021-11-16 20:58:47,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73784070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:58:47,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:58:47,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-16 20:58:47,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482175597] [2021-11-16 20:58:47,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:47,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-16 20:58:47,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:47,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-16 20:58:47,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 20:58:47,919 INFO L87 Difference]: Start difference. First operand 175 states and 240 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 20:58:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:49,138 INFO L93 Difference]: Finished difference Result 320 states and 441 transitions. [2021-11-16 20:58:49,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:58:49,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 149 [2021-11-16 20:58:49,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:49,140 INFO L225 Difference]: With dead ends: 320 [2021-11-16 20:58:49,140 INFO L226 Difference]: Without dead ends: 185 [2021-11-16 20:58:49,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-16 20:58:49,142 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 123 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:49,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 551 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-16 20:58:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-11-16 20:58:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2021-11-16 20:58:49,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 110 states have (on average 1.209090909090909) internal successors, (133), 114 states have internal predecessors, (133), 51 states have call successors, (51), 14 states have call predecessors, (51), 17 states have return successors, (62), 50 states have call predecessors, (62), 50 states have call successors, (62) [2021-11-16 20:58:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 246 transitions. [2021-11-16 20:58:49,158 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 246 transitions. Word has length 149 [2021-11-16 20:58:49,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:49,159 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 246 transitions. [2021-11-16 20:58:49,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 20:58:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 246 transitions. [2021-11-16 20:58:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-11-16 20:58:49,160 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:49,161 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:49,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-16 20:58:49,161 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:49,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:49,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1270175042, now seen corresponding path program 1 times [2021-11-16 20:58:49,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:49,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464732510] [2021-11-16 20:58:49,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:49,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:58:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:58:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 20:58:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-16 20:58:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:58:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:58:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:58:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 20:58:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-16 20:58:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:58:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-16 20:58:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-16 20:58:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 20:58:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-16 20:58:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-16 20:58:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-16 20:58:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-16 20:58:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-16 20:58:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:49,651 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2021-11-16 20:58:49,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:49,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464732510] [2021-11-16 20:58:49,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464732510] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:49,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827898426] [2021-11-16 20:58:49,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:49,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:49,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:49,656 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:58:49,658 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:58:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:50,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 2781 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-16 20:58:50,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:58:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-11-16 20:58:50,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:58:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2021-11-16 20:58:50,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827898426] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:50,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-16 20:58:50,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13, 5] total 17 [2021-11-16 20:58:50,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894823450] [2021-11-16 20:58:50,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:58:50,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 20:58:50,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:50,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 20:58:50,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2021-11-16 20:58:50,704 INFO L87 Difference]: Start difference. First operand 179 states and 246 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 20:58:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:50,783 INFO L93 Difference]: Finished difference Result 325 states and 452 transitions. [2021-11-16 20:58:50,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-16 20:58:50,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 150 [2021-11-16 20:58:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:50,785 INFO L225 Difference]: With dead ends: 325 [2021-11-16 20:58:50,785 INFO L226 Difference]: Without dead ends: 185 [2021-11-16 20:58:50,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2021-11-16 20:58:50,787 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 5 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:50,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 428 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:58:50,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-11-16 20:58:50,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2021-11-16 20:58:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 116 states have internal predecessors, (136), 51 states have call successors, (51), 15 states have call predecessors, (51), 17 states have return successors, (62), 50 states have call predecessors, (62), 50 states have call successors, (62) [2021-11-16 20:58:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 249 transitions. [2021-11-16 20:58:50,800 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 249 transitions. Word has length 150 [2021-11-16 20:58:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:50,800 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 249 transitions. [2021-11-16 20:58:50,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 20:58:50,801 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 249 transitions. [2021-11-16 20:58:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-16 20:58:50,803 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:50,803 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:50,835 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:58:51,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:51,028 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:51,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:51,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1521165747, now seen corresponding path program 1 times [2021-11-16 20:58:51,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:51,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714306575] [2021-11-16 20:58:51,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:51,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:58:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:58:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 20:58:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-16 20:58:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:58:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:58:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:58:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-16 20:58:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 20:58:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-16 20:58:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-16 20:58:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-16 20:58:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-16 20:58:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-16 20:58:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 20:58:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-16 20:58:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-16 20:58:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-16 20:58:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2021-11-16 20:58:51,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:51,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714306575] [2021-11-16 20:58:51,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714306575] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:51,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580588642] [2021-11-16 20:58:51,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:51,431 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:51,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:51,432 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:58:51,462 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:58:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:51,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 2792 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-16 20:58:51,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:58:52,169 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 17 treesize of output 9 [2021-11-16 20:58:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 84 proven. 4 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2021-11-16 20:58:52,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 20:58:53,007 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-11-16 20:58:53,007 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:58:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-11-16 20:58:53,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580588642] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-16 20:58:53,049 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-16 20:58:53,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 12] total 25 [2021-11-16 20:58:53,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617567634] [2021-11-16 20:58:53,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-16 20:58:53,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-16 20:58:53,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:58:53,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-16 20:58:53,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-11-16 20:58:53,051 INFO L87 Difference]: Start difference. First operand 182 states and 249 transitions. Second operand has 25 states, 22 states have (on average 5.909090909090909) internal successors, (130), 19 states have internal predecessors, (130), 8 states have call successors, (53), 6 states have call predecessors, (53), 8 states have return successors, (48), 6 states have call predecessors, (48), 7 states have call successors, (48) [2021-11-16 20:58:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:58:57,193 INFO L93 Difference]: Finished difference Result 353 states and 483 transitions. [2021-11-16 20:58:57,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-16 20:58:57,194 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.909090909090909) internal successors, (130), 19 states have internal predecessors, (130), 8 states have call successors, (53), 6 states have call predecessors, (53), 8 states have return successors, (48), 6 states have call predecessors, (48), 7 states have call successors, (48) Word has length 151 [2021-11-16 20:58:57,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:58:57,195 INFO L225 Difference]: With dead ends: 353 [2021-11-16 20:58:57,195 INFO L226 Difference]: Without dead ends: 194 [2021-11-16 20:58:57,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=1456, Unknown=0, NotChecked=0, Total=1640 [2021-11-16 20:58:57,197 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 167 mSDsluCounter, 2017 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-16 20:58:57,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 2193 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2441 Invalid, 0 Unknown, 206 Unchecked, 3.6s Time] [2021-11-16 20:58:57,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-11-16 20:58:57,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 184. [2021-11-16 20:58:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 115 states have (on average 1.208695652173913) internal successors, (139), 118 states have internal predecessors, (139), 51 states have call successors, (51), 15 states have call predecessors, (51), 17 states have return successors, (61), 50 states have call predecessors, (61), 50 states have call successors, (61) [2021-11-16 20:58:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 251 transitions. [2021-11-16 20:58:57,212 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 251 transitions. Word has length 151 [2021-11-16 20:58:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:58:57,213 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 251 transitions. [2021-11-16 20:58:57,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.909090909090909) internal successors, (130), 19 states have internal predecessors, (130), 8 states have call successors, (53), 6 states have call predecessors, (53), 8 states have return successors, (48), 6 states have call predecessors, (48), 7 states have call successors, (48) [2021-11-16 20:58:57,213 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 251 transitions. [2021-11-16 20:58:57,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-16 20:58:57,215 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:58:57,215 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:57,249 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:58:57,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:57,431 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:58:57,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:58:57,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2136881564, now seen corresponding path program 2 times [2021-11-16 20:58:57,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:58:57,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207134475] [2021-11-16 20:58:57,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:58:57,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:58:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:58:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:58:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 20:58:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-16 20:58:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-16 20:58:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-16 20:58:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-16 20:58:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:58:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-16 20:58:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:58:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-16 20:58:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-16 20:58:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-16 20:58:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-16 20:58:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-16 20:58:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-16 20:58:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-16 20:58:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-16 20:58:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-11-16 20:58:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:58:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2021-11-16 20:58:57,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:58:57,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207134475] [2021-11-16 20:58:57,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207134475] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:58:57,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121757613] [2021-11-16 20:58:57,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 20:58:57,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:58:57,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:58:57,938 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:58:57,940 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:00,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 20:59:00,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 20:59:00,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-16 20:59:00,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2021-11-16 20:59:00,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:59:00,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121757613] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:00,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:59:00,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2021-11-16 20:59:00,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896352186] [2021-11-16 20:59:00,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:00,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:59:00,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:00,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:59:00,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:59:00,801 INFO L87 Difference]: Start difference. First operand 184 states and 251 transitions. Second operand has 9 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2021-11-16 20:59:00,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:00,946 INFO L93 Difference]: Finished difference Result 346 states and 483 transitions. [2021-11-16 20:59:00,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:59:00,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 156 [2021-11-16 20:59:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:00,948 INFO L225 Difference]: With dead ends: 346 [2021-11-16 20:59:00,948 INFO L226 Difference]: Without dead ends: 189 [2021-11-16 20:59:00,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-11-16 20:59:00,950 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 12 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:00,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1646 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:59:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-11-16 20:59:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-11-16 20:59:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 123 states have internal predecessors, (143), 51 states have call successors, (51), 15 states have call predecessors, (51), 18 states have return successors, (70), 50 states have call predecessors, (70), 50 states have call successors, (70) [2021-11-16 20:59:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 264 transitions. [2021-11-16 20:59:00,964 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 264 transitions. Word has length 156 [2021-11-16 20:59:00,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:00,965 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 264 transitions. [2021-11-16 20:59:00,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2021-11-16 20:59:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 264 transitions. [2021-11-16 20:59:00,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-16 20:59:00,968 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:00,968 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,000 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:01,186 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,SelfDestructingSolverStorable9 [2021-11-16 20:59:01,186 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:01,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:01,187 INFO L85 PathProgramCache]: Analyzing trace with hash 949277609, now seen corresponding path program 1 times [2021-11-16 20:59:01,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:01,187 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321408849] [2021-11-16 20:59:01,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:01,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:59:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:59:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 20:59:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:59:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:59:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 20:59:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:59:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:59:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-16 20:59:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-16 20:59:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 20:59:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-16 20:59:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-16 20:59:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-16 20:59:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-16 20:59:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-16 20:59:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-16 20:59:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-16 20:59:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:01,559 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2021-11-16 20:59:01,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:01,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321408849] [2021-11-16 20:59:01,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321408849] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:01,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7593931] [2021-11-16 20:59:01,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:01,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:01,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:01,561 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:01,590 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:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:02,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 2853 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-16 20:59:02,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-11-16 20:59:02,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:59:02,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7593931] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:02,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:59:02,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2021-11-16 20:59:02,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979706625] [2021-11-16 20:59:02,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:02,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-16 20:59:02,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:02,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-16 20:59:02,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-16 20:59:02,363 INFO L87 Difference]: Start difference. First operand 189 states and 264 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 20:59:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:03,540 INFO L93 Difference]: Finished difference Result 351 states and 506 transitions. [2021-11-16 20:59:03,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-16 20:59:03,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 158 [2021-11-16 20:59:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:03,542 INFO L225 Difference]: With dead ends: 351 [2021-11-16 20:59:03,542 INFO L226 Difference]: Without dead ends: 189 [2021-11-16 20:59:03,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-16 20:59:03,545 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 17 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:03,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 760 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 48 Unchecked, 1.1s Time] [2021-11-16 20:59:03,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-11-16 20:59:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-11-16 20:59:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 119 states have (on average 1.1932773109243697) internal successors, (142), 123 states have internal predecessors, (142), 51 states have call successors, (51), 15 states have call predecessors, (51), 18 states have return successors, (70), 50 states have call predecessors, (70), 50 states have call successors, (70) [2021-11-16 20:59:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 263 transitions. [2021-11-16 20:59:03,557 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 263 transitions. Word has length 158 [2021-11-16 20:59:03,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:03,557 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 263 transitions. [2021-11-16 20:59:03,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 20:59:03,558 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 263 transitions. [2021-11-16 20:59:03,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-16 20:59:03,559 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:03,559 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,589 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 20:59:03,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:03,774 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:03,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:03,774 INFO L85 PathProgramCache]: Analyzing trace with hash 404405035, now seen corresponding path program 1 times [2021-11-16 20:59:03,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:03,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178542819] [2021-11-16 20:59:03,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:03,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:59:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:59:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 20:59:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:59:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:59:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 20:59:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:59:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:59:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-16 20:59:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-16 20:59:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 20:59:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-16 20:59:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-16 20:59:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-16 20:59:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-16 20:59:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-16 20:59:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-16 20:59:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-16 20:59:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2021-11-16 20:59:04,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:04,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178542819] [2021-11-16 20:59:04,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178542819] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:04,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758151982] [2021-11-16 20:59:04,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:04,286 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:04,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:04,288 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 20:59:04,322 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 20:59:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:04,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 2858 conjuncts, 60 conjunts are in the unsatisfiable core [2021-11-16 20:59:04,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:10,375 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 62 treesize of output 54 [2021-11-16 20:59:10,378 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 51 treesize of output 43 [2021-11-16 20:59:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-11-16 20:59:10,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:59:10,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758151982] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:10,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:59:10,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 25 [2021-11-16 20:59:10,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859223079] [2021-11-16 20:59:10,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:10,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-16 20:59:10,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:10,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-16 20:59:10,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2021-11-16 20:59:10,634 INFO L87 Difference]: Start difference. First operand 189 states and 263 transitions. Second operand has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2021-11-16 20:59:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:13,405 INFO L93 Difference]: Finished difference Result 516 states and 728 transitions. [2021-11-16 20:59:13,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-16 20:59:13,407 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 158 [2021-11-16 20:59:13,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:13,413 INFO L225 Difference]: With dead ends: 516 [2021-11-16 20:59:13,413 INFO L226 Difference]: Without dead ends: 365 [2021-11-16 20:59:13,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 180 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=143, Invalid=913, Unknown=0, NotChecked=0, Total=1056 [2021-11-16 20:59:13,416 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 193 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:13,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 1951 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1131 Invalid, 0 Unknown, 289 Unchecked, 2.3s Time] [2021-11-16 20:59:13,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-11-16 20:59:13,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 354. [2021-11-16 20:59:13,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 225 states have (on average 1.1955555555555555) internal successors, (269), 232 states have internal predecessors, (269), 94 states have call successors, (94), 28 states have call predecessors, (94), 34 states have return successors, (133), 93 states have call predecessors, (133), 92 states have call successors, (133) [2021-11-16 20:59:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 496 transitions. [2021-11-16 20:59:13,437 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 496 transitions. Word has length 158 [2021-11-16 20:59:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:13,438 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 496 transitions. [2021-11-16 20:59:13,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2021-11-16 20:59:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 496 transitions. [2021-11-16 20:59:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-16 20:59:13,440 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:13,440 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,470 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 20:59:13,664 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,SelfDestructingSolverStorable11 [2021-11-16 20:59:13,664 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:13,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1213035415, now seen corresponding path program 1 times [2021-11-16 20:59:13,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:13,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048160021] [2021-11-16 20:59:13,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:13,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:59:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:59:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 20:59:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:59:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:59:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 20:59:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:59:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:59:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-16 20:59:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-16 20:59:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-16 20:59:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-16 20:59:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-16 20:59:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-16 20:59:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-16 20:59:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-16 20:59:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-16 20:59:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-16 20:59:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-11-16 20:59:13,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:13,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048160021] [2021-11-16 20:59:13,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048160021] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:13,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518069319] [2021-11-16 20:59:13,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:13,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:13,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:13,888 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 20:59:13,913 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 20:59:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:14,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 2853 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-16 20:59:14,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-11-16 20:59:14,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:59:14,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518069319] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:14,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:59:14,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2021-11-16 20:59:14,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648119165] [2021-11-16 20:59:14,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:14,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-16 20:59:14,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:14,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-16 20:59:14,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-16 20:59:14,587 INFO L87 Difference]: Start difference. First operand 354 states and 496 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 20:59:14,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:14,616 INFO L93 Difference]: Finished difference Result 545 states and 753 transitions. [2021-11-16 20:59:14,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-16 20:59:14,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 158 [2021-11-16 20:59:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:14,619 INFO L225 Difference]: With dead ends: 545 [2021-11-16 20:59:14,619 INFO L226 Difference]: Without dead ends: 213 [2021-11-16 20:59:14,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-16 20:59:14,622 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 6 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:14,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 643 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-16 20:59:14,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-11-16 20:59:14,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 207. [2021-11-16 20:59:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 135 states have (on average 1.162962962962963) internal successors, (157), 138 states have internal predecessors, (157), 51 states have call successors, (51), 18 states have call predecessors, (51), 20 states have return successors, (61), 50 states have call predecessors, (61), 50 states have call successors, (61) [2021-11-16 20:59:14,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 269 transitions. [2021-11-16 20:59:14,637 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 269 transitions. Word has length 158 [2021-11-16 20:59:14,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:14,637 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 269 transitions. [2021-11-16 20:59:14,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-11-16 20:59:14,638 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 269 transitions. [2021-11-16 20:59:14,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-11-16 20:59:14,639 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:14,639 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,667 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 20:59:14,855 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,SelfDestructingSolverStorable12 [2021-11-16 20:59:14,855 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:14,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:14,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1700037943, now seen corresponding path program 1 times [2021-11-16 20:59:14,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:14,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295936061] [2021-11-16 20:59:14,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:14,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:59:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:59:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-16 20:59:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-16 20:59:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-16 20:59:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-16 20:59:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:59:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-16 20:59:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-11-16 20:59:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-16 20:59:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-16 20:59:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-16 20:59:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-16 20:59:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-16 20:59:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-16 20:59:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-16 20:59:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-16 20:59:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-16 20:59:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-16 20:59:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2021-11-16 20:59:15,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:15,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295936061] [2021-11-16 20:59:15,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295936061] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:15,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-16 20:59:15,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-16 20:59:15,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711403976] [2021-11-16 20:59:15,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:15,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-16 20:59:15,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:15,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-16 20:59:15,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-16 20:59:15,159 INFO L87 Difference]: Start difference. First operand 207 states and 269 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 7 states have internal predecessors, (63), 5 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2021-11-16 20:59:17,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:17,062 INFO L93 Difference]: Finished difference Result 375 states and 498 transitions. [2021-11-16 20:59:17,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-16 20:59:17,063 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 7 states have internal predecessors, (63), 5 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 165 [2021-11-16 20:59:17,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:17,064 INFO L225 Difference]: With dead ends: 375 [2021-11-16 20:59:17,064 INFO L226 Difference]: Without dead ends: 213 [2021-11-16 20:59:17,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:59:17,066 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 199 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:17,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 609 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-16 20:59:17,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-11-16 20:59:17,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 207. [2021-11-16 20:59:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 135 states have (on average 1.1555555555555554) internal successors, (156), 138 states have internal predecessors, (156), 51 states have call successors, (51), 18 states have call predecessors, (51), 20 states have return successors, (61), 50 states have call predecessors, (61), 50 states have call successors, (61) [2021-11-16 20:59:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 268 transitions. [2021-11-16 20:59:17,077 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 268 transitions. Word has length 165 [2021-11-16 20:59:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:17,077 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 268 transitions. [2021-11-16 20:59:17,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 7 states have internal predecessors, (63), 5 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2021-11-16 20:59:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 268 transitions. [2021-11-16 20:59:17,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-11-16 20:59:17,078 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:17,079 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-16 20:59:17,079 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:17,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash 474294576, now seen corresponding path program 1 times [2021-11-16 20:59:17,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:17,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173257191] [2021-11-16 20:59:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:17,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:59:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-16 20:59:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-16 20:59:17,330 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 1 [2021-11-16 20:59:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-11-16 20:59:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-16 20:59:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-16 20:59:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-16 20:59:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 20:59:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-16 20:59:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-16 20:59:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-16 20:59:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-16 20:59:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-16 20:59:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-16 20:59:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-16 20:59:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-16 20:59:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-16 20:59:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-11-16 20:59:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-11-16 20:59:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-11-16 20:59:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2021-11-16 20:59:17,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:17,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173257191] [2021-11-16 20:59:17,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173257191] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:17,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879795722] [2021-11-16 20:59:17,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:17,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:17,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:17,543 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 20:59:17,545 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 20:59:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:18,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 2912 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-16 20:59:18,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-11-16 20:59:18,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-16 20:59:18,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879795722] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-16 20:59:18,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-16 20:59:18,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 14 [2021-11-16 20:59:18,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112146367] [2021-11-16 20:59:18,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-16 20:59:18,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-16 20:59:18,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 20:59:18,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-16 20:59:18,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-11-16 20:59:18,357 INFO L87 Difference]: Start difference. First operand 207 states and 268 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2021-11-16 20:59:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 20:59:18,482 INFO L93 Difference]: Finished difference Result 381 states and 503 transitions. [2021-11-16 20:59:18,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-16 20:59:18,482 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) Word has length 176 [2021-11-16 20:59:18,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 20:59:18,484 INFO L225 Difference]: With dead ends: 381 [2021-11-16 20:59:18,484 INFO L226 Difference]: Without dead ends: 207 [2021-11-16 20:59:18,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 220 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-16 20:59:18,486 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 2 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-16 20:59:18,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1404 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-16 20:59:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-11-16 20:59:18,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-11-16 20:59:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 135 states have (on average 1.1481481481481481) internal successors, (155), 138 states have internal predecessors, (155), 51 states have call successors, (51), 18 states have call predecessors, (51), 20 states have return successors, (61), 50 states have call predecessors, (61), 50 states have call successors, (61) [2021-11-16 20:59:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 267 transitions. [2021-11-16 20:59:18,496 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 267 transitions. Word has length 176 [2021-11-16 20:59:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 20:59:18,496 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 267 transitions. [2021-11-16 20:59:18,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2021-11-16 20:59:18,497 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 267 transitions. [2021-11-16 20:59:18,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-16 20:59:18,498 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 20:59:18,498 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,527 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 20:59:18,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-16 20:59:18,723 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 20:59:18,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 20:59:18,724 INFO L85 PathProgramCache]: Analyzing trace with hash 773981795, now seen corresponding path program 1 times [2021-11-16 20:59:18,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 20:59:18,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356492666] [2021-11-16 20:59:18,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:18,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 20:59:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:18,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 20:59:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:18,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:18,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 20:59:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:18,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:18,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 20:59:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:18,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-16 20:59:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:18,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:18,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-16 20:59:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 20:59:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 20:59:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 20:59:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 20:59:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-16 20:59:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 20:59:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-16 20:59:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 20:59:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-16 20:59:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-16 20:59:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-16 20:59:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-16 20:59:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-16 20:59:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-11-16 20:59:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-11-16 20:59:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-11-16 20:59:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-16 20:59:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2021-11-16 20:59:19,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 20:59:19,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356492666] [2021-11-16 20:59:19,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356492666] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 20:59:19,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932176504] [2021-11-16 20:59:19,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 20:59:19,203 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 20:59:19,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 20:59:19,204 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 20:59:19,234 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 20:59:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 20:59:19,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 2943 conjuncts, 130 conjunts are in the unsatisfiable core [2021-11-16 20:59:19,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 20:59:19,622 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 20:59:19,746 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-16 20:59:19,747 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 20:59:20,046 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-16 20:59:20,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 37 [2021-11-16 20:59:20,171 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 36 treesize of output 32 [2021-11-16 20:59:22,696 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 77 treesize of output 53 [2021-11-16 20:59:22,782 INFO L354 Elim1Store]: treesize reduction 160, result has 22.0 percent of original size [2021-11-16 20:59:22,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 81 [2021-11-16 20:59:23,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 20:59:24,336 INFO L354 Elim1Store]: treesize reduction 276, result has 17.1 percent of original size [2021-11-16 20:59:24,337 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 143 treesize of output 175 [2021-11-16 20:59:24,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:59:24,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 20:59:24,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 39 [2021-11-16 20:59:24,625 INFO L354 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2021-11-16 20:59:24,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 64 [2021-11-16 20:59:28,109 INFO L354 Elim1Store]: treesize reduction 100, result has 17.4 percent of original size [2021-11-16 20:59:28,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 140 treesize of output 148 [2021-11-16 20:59:30,307 WARN L860 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_memcpy_#t~mem1244| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1236_15| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1236_15| |c_#Ultimate.C_memcpy_dest.offset|) |#Ultimate.C_memcpy_#t~mem1244|)))) is different from true [2021-11-16 20:59:32,230 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1236_16| Int) (|#Ultimate.C_memcpy_#t~mem1244| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1236_15| Int) (|v_#Ultimate.C_memcpy_#t~mem1244_9| Int)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1236_15| |c_#Ultimate.C_memcpy_dest.offset|) |v_#Ultimate.C_memcpy_#t~mem1244_9|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1236_16| |c_#Ultimate.C_memcpy_dest.offset|) |#Ultimate.C_memcpy_#t~mem1244|)) |c_#memory_int|)) is different from true [2021-11-16 20:59:34,239 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1245_13| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1236_16| Int) (|#Ultimate.C_memcpy_#t~mem1244| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1236_15| Int) (|v_#Ultimate.C_memcpy_#t~mem1244_9| Int) (|#Ultimate.C_memcpy_dest.offset| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (let ((.cse0 (+ |v_#Ultimate.C_memcpy_#t~loopctr1245_13| |#Ultimate.C_memcpy_dest.offset|))) (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1236_15| |#Ultimate.C_memcpy_dest.offset|) |v_#Ultimate.C_memcpy_#t~mem1244_9|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1236_16| |#Ultimate.C_memcpy_dest.offset|) |#Ultimate.C_memcpy_#t~mem1244|) .cse0 (select (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|) .cse0)))))) is different from true [2021-11-16 20:59:34,516 INFO L354 Elim1Store]: treesize reduction 1107, result has 6.6 percent of original size [2021-11-16 20:59:34,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 29 case distinctions, treesize of input 119 treesize of output 136 [2021-11-16 21:00:19,744 INFO L354 Elim1Store]: treesize reduction 446, result has 11.2 percent of original size [2021-11-16 21:00:19,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 105 treesize of output 118 [2021-11-16 21:01:47,775 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_save_byte_from_array_~array#1.base| Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.base| Int) (|v_ULTIMATE.start_aws_byte_cursor_read_be64_~cur#1.base_BEFORE_CALL_12| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_read_be64_~cur#1.base_BEFORE_CALL_12| |ULTIMATE.start_save_byte_from_array_~array#1.base|)) (let ((.cse1 (not (= (mod (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_read_be64_~cur#1.base_BEFORE_CALL_12|) 0) 18446744073709551616) 0)))) (or (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse0 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (and (= (select .cse0 (+ 8 v_prenex_1)) (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|) v_prenex_2)) (< 9223372036854775807 (mod (select .cse0 v_prenex_1) 18446744073709551616))))) .cse1) (and (exists ((|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int) (v_arrayElimIndex_1 Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (and (= (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ v_arrayElimIndex_1 18446744073709551616)) (select .cse2 (+ |ULTIMATE.start_save_byte_from_array_~storage#1.offset| 8))) (<= (mod (select .cse2 |ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) 9223372036854775807)))) .cse1))) (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_ULTIMATE.start_aws_byte_cursor_read_be64_~cur#1.base_BEFORE_CALL_12|)))) is different from true [2021-11-16 21:02:44,908 INFO L354 Elim1Store]: treesize reduction 1355, result has 0.1 percent of original size [2021-11-16 21:02:44,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 172 treesize of output 1 [2021-11-16 21:02:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 220 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 28 not checked. [2021-11-16 21:02:45,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-16 21:03:22,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932176504] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:03:22,789 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-16 21:03:22,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 37] total 43 [2021-11-16 21:03:22,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132558208] [2021-11-16 21:03:22,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-16 21:03:22,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-11-16 21:03:22,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-16 21:03:22,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-16 21:03:22,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2163, Unknown=31, NotChecked=388, Total=2756 [2021-11-16 21:03:22,792 INFO L87 Difference]: Start difference. First operand 207 states and 267 transitions. Second operand has 43 states, 41 states have (on average 4.0) internal successors, (164), 36 states have internal predecessors, (164), 12 states have call successors, (53), 13 states have call predecessors, (53), 13 states have return successors, (50), 12 states have call predecessors, (50), 12 states have call successors, (50) [2021-11-16 21:04:08,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-16 21:04:08,829 INFO L93 Difference]: Finished difference Result 371 states and 489 transitions. [2021-11-16 21:04:08,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-16 21:04:08,830 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 4.0) internal successors, (164), 36 states have internal predecessors, (164), 12 states have call successors, (53), 13 states have call predecessors, (53), 13 states have return successors, (50), 12 states have call predecessors, (50), 12 states have call successors, (50) Word has length 187 [2021-11-16 21:04:08,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-16 21:04:08,832 INFO L225 Difference]: With dead ends: 371 [2021-11-16 21:04:08,832 INFO L226 Difference]: Without dead ends: 227 [2021-11-16 21:04:08,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 253 SyntacticMatches, 16 SemanticMatches, 61 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 233.5s TimeCoverageRelationStatistics Valid=230, Invalid=3161, Unknown=47, NotChecked=468, Total=3906 [2021-11-16 21:04:08,834 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 194 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 2541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1722 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-11-16 21:04:08,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 1159 Invalid, 2541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 655 Invalid, 0 Unknown, 1722 Unchecked, 4.0s Time] [2021-11-16 21:04:08,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-11-16 21:04:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 215. [2021-11-16 21:04:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 141 states have (on average 1.148936170212766) internal successors, (162), 144 states have internal predecessors, (162), 51 states have call successors, (51), 20 states have call predecessors, (51), 22 states have return successors, (61), 50 states have call predecessors, (61), 50 states have call successors, (61) [2021-11-16 21:04:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 274 transitions. [2021-11-16 21:04:08,846 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 274 transitions. Word has length 187 [2021-11-16 21:04:08,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-16 21:04:08,846 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 274 transitions. [2021-11-16 21:04:08,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 4.0) internal successors, (164), 36 states have internal predecessors, (164), 12 states have call successors, (53), 13 states have call predecessors, (53), 13 states have return successors, (50), 12 states have call predecessors, (50), 12 states have call successors, (50) [2021-11-16 21:04:08,846 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 274 transitions. [2021-11-16 21:04:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-16 21:04:08,848 INFO L506 BasicCegarLoop]: Found error trace [2021-11-16 21:04:08,848 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:08,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-11-16 21:04:09,055 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,SelfDestructingSolverStorable15 [2021-11-16 21:04:09,055 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-16 21:04:09,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-16 21:04:09,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1180520980, now seen corresponding path program 2 times [2021-11-16 21:04:09,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-16 21:04:09,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140880282] [2021-11-16 21:04:09,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-16 21:04:09,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-16 21:04:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-16 21:04:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:04:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-16 21:04:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:04:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-16 21:04:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-16 21:04:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:04:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-16 21:04:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-16 21:04:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-16 21:04:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-16 21:04:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-16 21:04:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-16 21:04:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-16 21:04:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-16 21:04:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:04:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-16 21:04:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-16 21:04:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-16 21:04:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-16 21:04:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-16 21:04:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-11-16 21:04:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-16 21:04:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-16 21:04:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-11-16 21:04:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-11-16 21:04:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-16 21:04:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2021-11-16 21:04:09,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-16 21:04:09,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140880282] [2021-11-16 21:04:09,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140880282] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-16 21:04:09,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688934309] [2021-11-16 21:04:09,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-16 21:04:09,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-16 21:04:09,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-16 21:04:09,999 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:04:10,001 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:04:12,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-16 21:04:12,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-16 21:04:12,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 2987 conjuncts, 150 conjunts are in the unsatisfiable core [2021-11-16 21:04:12,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-16 21:04:12,093 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:04:12,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-16 21:04:12,557 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-16 21:04:12,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 17 [2021-11-16 21:04:13,177 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-16 21:04:13,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 13 [2021-11-16 21:04:13,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:04:13,367 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-11-16 21:04:13,367 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 22 treesize of output 27 [2021-11-16 21:04:13,722 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 24 treesize of output 20 [2021-11-16 21:04:17,337 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-16 21:04:17,337 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 74 treesize of output 44 [2021-11-16 21:04:17,522 INFO L354 Elim1Store]: treesize reduction 106, result has 23.2 percent of original size [2021-11-16 21:04:17,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 58 [2021-11-16 21:04:17,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2021-11-16 21:04:20,773 INFO L354 Elim1Store]: treesize reduction 356, result has 20.4 percent of original size [2021-11-16 21:04:20,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 161 treesize of output 223 [2021-11-16 21:04:22,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:04:22,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:04:22,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:04:22,705 INFO L354 Elim1Store]: treesize reduction 47, result has 23.0 percent of original size [2021-11-16 21:04:22,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 61 [2021-11-16 21:04:22,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:04:22,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:04:22,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:04:22,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 40 [2021-11-16 21:04:23,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:04:23,462 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-16 21:04:23,462 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 50 [2021-11-16 21:04:23,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-16 21:04:24,041 INFO L354 Elim1Store]: treesize reduction 67, result has 17.3 percent of original size [2021-11-16 21:04:24,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 131 treesize of output 95 [2021-11-16 21:04:43,614 INFO L354 Elim1Store]: treesize reduction 196, result has 12.9 percent of original size [2021-11-16 21:04:43,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 283 treesize of output 295 [2021-11-16 21:05:01,120 WARN L860 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_memcpy_#t~mem1244| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1236_17| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1236_17| |c_#Ultimate.C_memcpy_dest.offset|) |#Ultimate.C_memcpy_#t~mem1244|)))) is different from true [2021-11-16 21:05:03,143 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~mem1244_10| Int) (|#Ultimate.C_memcpy_#t~mem1244| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1236_18| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1236_17| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1236_17| |c_#Ultimate.C_memcpy_dest.offset|) |v_#Ultimate.C_memcpy_#t~mem1244_10|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1236_18| |c_#Ultimate.C_memcpy_dest.offset|) |#Ultimate.C_memcpy_#t~mem1244|)))) is different from true [2021-11-16 21:05:05,166 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~mem1244_10| Int) (|v_#Ultimate.C_memcpy_#t~mem1244_11| Int) (|#Ultimate.C_memcpy_#t~mem1244| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1236_18| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1236_17| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1236_19| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1236_17| |c_#Ultimate.C_memcpy_dest.offset|) |v_#Ultimate.C_memcpy_#t~mem1244_10|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1236_18| |c_#Ultimate.C_memcpy_dest.offset|) |v_#Ultimate.C_memcpy_#t~mem1244_11|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1236_19| |c_#Ultimate.C_memcpy_dest.offset|) |#Ultimate.C_memcpy_#t~mem1244|)))) is different from true [2021-11-16 21:05:07,191 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~mem1244_10| Int) (|v_#Ultimate.C_memcpy_#t~mem1244_11| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1245_14| Int) (|#Ultimate.C_memcpy_#t~mem1244| Int) (|#Ultimate.C_memcpy_dest.offset| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1236_18| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1236_17| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1236_19| Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (let ((.cse0 (+ |v_#Ultimate.C_memcpy_#t~loopctr1245_14| |#Ultimate.C_memcpy_dest.offset|))) (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1236_17| |#Ultimate.C_memcpy_dest.offset|) |v_#Ultimate.C_memcpy_#t~mem1244_10|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1236_18| |#Ultimate.C_memcpy_dest.offset|) |v_#Ultimate.C_memcpy_#t~mem1244_11|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1236_19| |#Ultimate.C_memcpy_dest.offset|) |#Ultimate.C_memcpy_#t~mem1244|) .cse0 (select (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|) .cse0)))))) is different from true [2021-11-16 21:05:09,245 INFO L354 Elim1Store]: treesize reduction 3298, result has 4.2 percent of original size [2021-11-16 21:05:09,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 2 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 93 case distinctions, treesize of input 264 treesize of output 281 [2021-11-16 21:05:47,953 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#cur~3#1.base_BEFORE_CALL_59| Int) (|ULTIMATE.start_save_byte_from_array_~array#1.base| Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.base| Int)) (and (let ((.cse6 (mod (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|) (- 8)) 18446744073709551616)) (.cse0 (not (= (mod (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#cur~3#1.base_BEFORE_CALL_59|) 0) 18446744073709551616) 0)))) (or (and .cse0 (exists ((|v_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#cur~3#1.base_BEFORE_CALL_57| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|)) (.cse4 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|)) (.cse1 (+ 8 v_prenex_9)) (.cse2 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#cur~3#1.base_BEFORE_CALL_57|) 0))) (and (or (not (= .cse1 0)) (= .cse2 (select .cse3 (+ 18446744073709551616 v_prenex_8))) (not (= |ULTIMATE.start_save_byte_from_array_~storage#1.base| |v_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#cur~3#1.base_BEFORE_CALL_57|))) (< 9223372036854775807 (mod (select .cse4 v_prenex_9) 18446744073709551616)) (= (select .cse3 v_prenex_8) (select .cse4 .cse1)) (let ((.cse5 (* .cse2 (- 1)))) (< (div (+ 18446744073709551615 .cse5) (- 18446744073709551616)) (div .cse5 (- 18446744073709551616)))))))) (and .cse0 (exists ((v_prenex_7 Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ 18446744073709551616 v_prenex_7)) (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|) 0))) (<= .cse6 9223372036854775807)) (and .cse0 (exists ((v_prenex_10 Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|) v_prenex_10) (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|) 0))) (< 9223372036854775807 .cse6)) (and (exists ((v_arrayElimIndex_3 Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int)) (let ((.cse7 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (and (= (select .cse7 (+ |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_3 18446744073709551616))) (<= (mod (select .cse7 |ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) 9223372036854775807)))) .cse0 (exists ((|v_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#cur~3#1.base_BEFORE_CALL_57| Int)) (let ((.cse8 (* (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#cur~3#1.base_BEFORE_CALL_57|) 0) (- 1)))) (< (div (+ 18446744073709551615 .cse8) (- 18446744073709551616)) (div .cse8 (- 18446744073709551616)))))))) (< (+ |ULTIMATE.start_save_byte_from_array_~array#1.base| 1) |v_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#cur~3#1.base_BEFORE_CALL_59|) (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_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#cur~3#1.base_BEFORE_CALL_59|)))) is different from true [2021-11-16 21:08:10,998 INFO L354 Elim1Store]: treesize reduction 1254, result has 7.5 percent of original size [2021-11-16 21:08:10,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 91 case distinctions, treesize of input 245 treesize of output 244 [2021-11-16 21:10:47,853 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_save_byte_from_array_~array#1.base| Int) (|v_ULTIMATE.start_aws_byte_cursor_read_be64_~cur#1.base_BEFORE_CALL_18| Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.base| Int)) (and (< (+ |ULTIMATE.start_save_byte_from_array_~array#1.base| 1) |v_ULTIMATE.start_aws_byte_cursor_read_be64_~cur#1.base_BEFORE_CALL_18|) (not (= |ULTIMATE.start_save_byte_from_array_~storage#1.base| |v_ULTIMATE.start_aws_byte_cursor_read_be64_~cur#1.base_BEFORE_CALL_18|)) (not (= |ULTIMATE.start_save_byte_from_array_~storage#1.base| |ULTIMATE.start_save_byte_from_array_~array#1.base|)) (let ((.cse1 (not (= (mod (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_read_be64_~cur#1.base_BEFORE_CALL_18|) 0) 18446744073709551616) 0))) (.cse0 (mod (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|) (- 8)) 18446744073709551616))) (or (and (exists ((v_prenex_7 Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|) (+ 18446744073709551616 v_prenex_7)) (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|) 0))) (<= .cse0 9223372036854775807) .cse1) (and (exists ((v_arrayElimIndex_3 Int) (|ULTIMATE.start_save_byte_from_array_~storage#1.offset| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|))) (and (= (select .cse2 (+ |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_3 18446744073709551616))) (<= (mod (select .cse2 |ULTIMATE.start_save_byte_from_array_~storage#1.offset|) 18446744073709551616) 9223372036854775807)))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#cur~3#1.base_BEFORE_CALL_57| Int)) (let ((.cse3 (* (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#cur~3#1.base_BEFORE_CALL_57|) 0) (- 1)))) (< (div (+ 18446744073709551615 .cse3) (- 18446744073709551616)) (div .cse3 (- 18446744073709551616))))) .cse1) (and (exists ((|v_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#cur~3#1.base_BEFORE_CALL_57| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|)) (.cse7 (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|)) (.cse4 (+ 8 v_prenex_9)) (.cse5 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#cur~3#1.base_BEFORE_CALL_57|) 0))) (and (or (not (= .cse4 0)) (= .cse5 (select .cse6 (+ 18446744073709551616 v_prenex_8))) (not (= |ULTIMATE.start_save_byte_from_array_~storage#1.base| |v_ULTIMATE.start_aws_byte_cursor_read_common_harness_~#cur~3#1.base_BEFORE_CALL_57|))) (< 9223372036854775807 (mod (select .cse7 v_prenex_9) 18446744073709551616)) (= (select .cse6 v_prenex_8) (select .cse7 .cse4)) (let ((.cse8 (* .cse5 (- 1)))) (< (div (+ 18446744073709551615 .cse8) (- 18446744073709551616)) (div .cse8 (- 18446744073709551616))))))) .cse1) (and (exists ((v_prenex_10 Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~array#1.base|) v_prenex_10) (select (select |c_#memory_int| |ULTIMATE.start_save_byte_from_array_~storage#1.base|) 0))) .cse1 (< 9223372036854775807 .cse0)))))) is different from true Killed by 15