./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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_buf_advance_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 9a96b91703f0cc76adc9b0fdbd8386a96920c1be21a810b6415a59c2166f1461 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:54:42,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:54:42,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:54:42,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:54:42,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:54:42,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:54:42,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:54:42,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:54:42,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:54:42,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:54:42,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:54:42,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:54:42,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:54:42,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:54:42,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:54:42,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:54:42,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:54:42,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:54:42,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:54:42,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:54:42,725 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:54:42,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:54:42,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:54:42,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:54:42,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:54:42,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:54:42,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:54:42,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:54:42,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:54:42,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:54:42,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:54:42,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:54:42,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:54:42,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:54:42,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:54:42,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:54:42,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:54:42,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:54:42,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:54:42,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:54:42,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:54:42,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:54:42,747 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 21:54:42,784 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:54:42,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:54:42,785 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:54:42,785 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:54:42,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:54:42,786 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:54:42,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:54:42,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:54:42,787 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:54:42,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:54:42,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:54:42,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:54:42,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:54:42,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:54:42,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:54:42,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:54:42,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:54:42,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:54:42,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:54:42,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:54:42,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:54:42,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:54:42,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:54:42,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:54:42,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:54:42,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:54:42,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:54:42,792 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:54:42,793 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:54:42,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:54:42,793 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 -> 9a96b91703f0cc76adc9b0fdbd8386a96920c1be21a810b6415a59c2166f1461 [2022-07-19 21:54:43,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:54:43,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:54:43,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:54:43,107 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:54:43,107 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:54:43,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i [2022-07-19 21:54:43,169 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/106791ea5/16dc8f6041e0409f8e49fa9882e03195/FLAG41ac36951 [2022-07-19 21:54:43,915 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:54:43,916 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i [2022-07-19 21:54:43,959 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/106791ea5/16dc8f6041e0409f8e49fa9882e03195/FLAG41ac36951 [2022-07-19 21:54:43,980 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/106791ea5/16dc8f6041e0409f8e49fa9882e03195 [2022-07-19 21:54:43,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:54:43,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:54:43,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:54:43,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:54:43,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:54:43,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:54:43" (1/1) ... [2022-07-19 21:54:43,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6648d3eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:54:43, skipping insertion in model container [2022-07-19 21:54:43,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:54:43" (1/1) ... [2022-07-19 21:54:43,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:54:44,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:54:44,296 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_buf_advance_harness.i[4494,4507] [2022-07-19 21:54:44,303 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_buf_advance_harness.i[4554,4567] [2022-07-19 21:54:44,889 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:44,891 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:44,891 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:44,892 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:44,893 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:44,906 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:44,907 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:44,908 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:44,910 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:45,180 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 21:54:45,181 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 21:54:45,182 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 21:54:45,185 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 21:54:45,191 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 21:54:45,195 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 21:54:45,195 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 21:54:45,196 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 21:54:45,196 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 21:54:45,197 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 21:54:45,326 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 21:54:45,399 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:45,399 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:45,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:54:45,504 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:54:45,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_buf_advance_harness.i[4494,4507] [2022-07-19 21:54:45,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_buf_advance_harness.i[4554,4567] [2022-07-19 21:54:45,542 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:45,546 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:45,547 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:45,548 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:45,549 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:45,554 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:45,559 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:45,560 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:45,561 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:45,622 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 21:54:45,624 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 21:54:45,625 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 21:54:45,626 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 21:54:45,627 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 21:54:45,627 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 21:54:45,628 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 21:54:45,628 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 21:54:45,629 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 21:54:45,629 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 21:54:45,655 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 21:54:45,743 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:45,745 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:54:45,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:54:45,957 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:54:45,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:54:45 WrapperNode [2022-07-19 21:54:45,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:54:45,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:54:45,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:54:45,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:54:45,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:54:45" (1/1) ... [2022-07-19 21:54:46,068 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:54:45" (1/1) ... [2022-07-19 21:54:46,160 INFO L137 Inliner]: procedures = 691, calls = 2677, calls flagged for inlining = 60, calls inlined = 8, statements flattened = 972 [2022-07-19 21:54:46,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:54:46,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:54:46,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:54:46,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:54:46,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:54:45" (1/1) ... [2022-07-19 21:54:46,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:54:45" (1/1) ... [2022-07-19 21:54:46,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:54:45" (1/1) ... [2022-07-19 21:54:46,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:54:45" (1/1) ... [2022-07-19 21:54:46,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:54:45" (1/1) ... [2022-07-19 21:54:46,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:54:45" (1/1) ... [2022-07-19 21:54:46,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:54:45" (1/1) ... [2022-07-19 21:54:46,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:54:46,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:54:46,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:54:46,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:54:46,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:54:45" (1/1) ... [2022-07-19 21:54:46,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:54:46,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:54:46,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 21:54:46,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 21:54:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-07-19 21:54:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-07-19 21:54:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:54:46,356 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-19 21:54:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-19 21:54:46,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 21:54:46,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 21:54:46,357 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 21:54:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 21:54:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:54:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 21:54:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_buf_has_allocated_buffer_member [2022-07-19 21:54:46,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_buf_has_allocated_buffer_member [2022-07-19 21:54:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:54:46,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:54:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 21:54:46,360 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 21:54:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-19 21:54:46,360 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-19 21:54:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 21:54:46,361 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 21:54:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:54:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 21:54:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 21:54:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-19 21:54:46,362 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-19 21:54:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_bounded [2022-07-19 21:54:46,362 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_bounded [2022-07-19 21:54:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:54:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2022-07-19 21:54:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2022-07-19 21:54:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2022-07-19 21:54:46,364 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2022-07-19 21:54:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:54:46,659 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:54:46,661 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:54:47,671 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:54:47,677 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:54:47,677 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 21:54:47,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:54:47 BoogieIcfgContainer [2022-07-19 21:54:47,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:54:47,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:54:47,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:54:47,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:54:47,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:54:43" (1/3) ... [2022-07-19 21:54:47,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcfcdad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:54:47, skipping insertion in model container [2022-07-19 21:54:47,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:54:45" (2/3) ... [2022-07-19 21:54:47,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcfcdad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:54:47, skipping insertion in model container [2022-07-19 21:54:47,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:54:47" (3/3) ... [2022-07-19 21:54:47,686 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_advance_harness.i [2022-07-19 21:54:47,698 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:54:47,698 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 21:54:47,742 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:54:47,747 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@412b0bc5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@65d94367 [2022-07-19 21:54:47,748 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 21:54:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 106 states have internal predecessors, (130), 55 states have call successors, (55), 11 states have call predecessors, (55), 11 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-19 21:54:47,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-19 21:54:47,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:54:47,764 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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] [2022-07-19 21:54:47,764 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:54:47,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:54:47,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1247030305, now seen corresponding path program 1 times [2022-07-19 21:54:47,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:54:47,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029957106] [2022-07-19 21:54:47,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:54:47,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:54:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:48,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:54:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:48,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:54:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:48,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:54:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:48,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:54:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:48,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:54:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:48,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:54:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:48,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:54:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:48,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 21:54:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:48,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:54:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:48,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 21:54:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:48,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 21:54:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:48,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:54:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:48,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 21:54:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:48,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 21:54:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-19 21:54:48,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:54:48,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029957106] [2022-07-19 21:54:48,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029957106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:54:48,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:54:48,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 21:54:48,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610771308] [2022-07-19 21:54:48,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:54:48,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:54:48,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:54:48,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:54:48,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 21:54:48,503 INFO L87 Difference]: Start difference. First operand has 173 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 106 states have internal predecessors, (130), 55 states have call successors, (55), 11 states have call predecessors, (55), 11 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-19 21:54:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:54:48,877 INFO L93 Difference]: Finished difference Result 349 states and 522 transitions. [2022-07-19 21:54:48,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 21:54:48,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 89 [2022-07-19 21:54:48,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:54:48,891 INFO L225 Difference]: With dead ends: 349 [2022-07-19 21:54:48,892 INFO L226 Difference]: Without dead ends: 175 [2022-07-19 21:54:48,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 21:54:48,901 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 119 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:54:48,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 278 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:54:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-19 21:54:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2022-07-19 21:54:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 101 states have (on average 1.198019801980198) internal successors, (121), 102 states have internal predecessors, (121), 55 states have call successors, (55), 11 states have call predecessors, (55), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-19 21:54:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 230 transitions. [2022-07-19 21:54:48,950 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 230 transitions. Word has length 89 [2022-07-19 21:54:48,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:54:48,951 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 230 transitions. [2022-07-19 21:54:48,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-19 21:54:48,952 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 230 transitions. [2022-07-19 21:54:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-19 21:54:48,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:54:48,956 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 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] [2022-07-19 21:54:48,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:54:48,957 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:54:48,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:54:48,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1477386906, now seen corresponding path program 1 times [2022-07-19 21:54:48,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:54:48,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506978321] [2022-07-19 21:54:48,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:54:48,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:54:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:49,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:54:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:49,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:54:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:49,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:54:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:49,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:54:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:49,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:54:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:49,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:54:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:49,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:54:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:49,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 21:54:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:49,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:54:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:49,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 21:54:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:49,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 21:54:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:49,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:54:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:49,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 21:54:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:49,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 21:54:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:49,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 21:54:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:49,487 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-19 21:54:49,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:54:49,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506978321] [2022-07-19 21:54:49,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506978321] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:54:49,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670194339] [2022-07-19 21:54:49,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:54:49,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:54:49,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:54:49,490 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:54:49,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 21:54:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:50,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 2754 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 21:54:50,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:54:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-19 21:54:50,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:54:50,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670194339] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:54:50,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:54:50,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-19 21:54:50,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102293054] [2022-07-19 21:54:50,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:54:50,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:54:50,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:54:50,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:54:50,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:54:50,245 INFO L87 Difference]: Start difference. First operand 168 states and 230 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-19 21:54:50,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:54:50,645 INFO L93 Difference]: Finished difference Result 332 states and 462 transitions. [2022-07-19 21:54:50,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:54:50,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 96 [2022-07-19 21:54:50,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:54:50,648 INFO L225 Difference]: With dead ends: 332 [2022-07-19 21:54:50,648 INFO L226 Difference]: Without dead ends: 171 [2022-07-19 21:54:50,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:54:50,650 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 259 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:54:50,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 582 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 21:54:50,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-19 21:54:50,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-19 21:54:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 103 states have (on average 1.1941747572815533) internal successors, (123), 105 states have internal predecessors, (123), 55 states have call successors, (55), 11 states have call predecessors, (55), 12 states have return successors, (63), 54 states have call predecessors, (63), 54 states have call successors, (63) [2022-07-19 21:54:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 241 transitions. [2022-07-19 21:54:50,686 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 241 transitions. Word has length 96 [2022-07-19 21:54:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:54:50,691 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 241 transitions. [2022-07-19 21:54:50,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-19 21:54:50,691 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 241 transitions. [2022-07-19 21:54:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-19 21:54:50,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:54:50,697 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:54:50,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 21:54:50,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:54:50,920 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:54:50,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:54:50,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1893468965, now seen corresponding path program 1 times [2022-07-19 21:54:50,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:54:50,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745896926] [2022-07-19 21:54:50,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:54:50,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:54:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:54:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:54:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:54:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:54:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:54:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:54:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:54:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:54:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:54:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 21:54:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:54:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 21:54:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:54:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 21:54:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 21:54:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-19 21:54:51,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:54:51,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745896926] [2022-07-19 21:54:51,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745896926] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:54:51,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976537441] [2022-07-19 21:54:51,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:54:51,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:54:51,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:54:51,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:54:51,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 21:54:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:51,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 2771 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 21:54:51,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:54:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 21:54:52,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:54:52,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976537441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:54:52,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:54:52,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-19 21:54:52,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174513876] [2022-07-19 21:54:52,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:54:52,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:54:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:54:52,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:54:52,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-19 21:54:52,075 INFO L87 Difference]: Start difference. First operand 171 states and 241 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-19 21:54:52,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:54:52,552 INFO L93 Difference]: Finished difference Result 293 states and 416 transitions. [2022-07-19 21:54:52,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:54:52,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 102 [2022-07-19 21:54:52,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:54:52,555 INFO L225 Difference]: With dead ends: 293 [2022-07-19 21:54:52,555 INFO L226 Difference]: Without dead ends: 171 [2022-07-19 21:54:52,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-07-19 21:54:52,558 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 299 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:54:52,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 695 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 21:54:52,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-19 21:54:52,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-19 21:54:52,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 103 states have (on average 1.1941747572815533) internal successors, (123), 105 states have internal predecessors, (123), 55 states have call successors, (55), 11 states have call predecessors, (55), 12 states have return successors, (60), 54 states have call predecessors, (60), 54 states have call successors, (60) [2022-07-19 21:54:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 238 transitions. [2022-07-19 21:54:52,577 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 238 transitions. Word has length 102 [2022-07-19 21:54:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:54:52,577 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 238 transitions. [2022-07-19 21:54:52,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-19 21:54:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 238 transitions. [2022-07-19 21:54:52,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 21:54:52,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:54:52,586 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:54:52,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 21:54:52,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-19 21:54:52,787 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:54:52,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:54:52,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1871994096, now seen corresponding path program 2 times [2022-07-19 21:54:52,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:54:52,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905247160] [2022-07-19 21:54:52,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:54:52,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:54:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:53,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:54:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:53,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:54:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:53,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:54:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:53,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:54:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:53,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:54:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:53,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:54:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:53,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:54:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:53,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:54:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:53,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:54:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:53,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 21:54:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:53,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 21:54:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:53,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:54:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:53,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:54:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:53,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 21:54:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:53,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 21:54:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-19 21:54:53,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:54:53,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905247160] [2022-07-19 21:54:53,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905247160] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:54:53,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947977679] [2022-07-19 21:54:53,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:54:53,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:54:53,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:54:53,255 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:54:53,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 21:54:53,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 21:54:53,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:54:53,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 2390 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 21:54:53,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:54:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-19 21:54:53,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:54:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-19 21:54:54,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947977679] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 21:54:54,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 21:54:54,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 14 [2022-07-19 21:54:54,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120487070] [2022-07-19 21:54:54,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:54:54,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:54:54,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:54:54,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:54:54,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:54:54,143 INFO L87 Difference]: Start difference. First operand 171 states and 238 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-19 21:54:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:54:54,290 INFO L93 Difference]: Finished difference Result 256 states and 358 transitions. [2022-07-19 21:54:54,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 21:54:54,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 108 [2022-07-19 21:54:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:54:54,296 INFO L225 Difference]: With dead ends: 256 [2022-07-19 21:54:54,296 INFO L226 Difference]: Without dead ends: 171 [2022-07-19 21:54:54,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-07-19 21:54:54,298 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 229 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:54:54,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 813 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:54:54,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-19 21:54:54,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-19 21:54:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 103 states have (on average 1.1941747572815533) internal successors, (123), 105 states have internal predecessors, (123), 55 states have call successors, (55), 11 states have call predecessors, (55), 12 states have return successors, (59), 54 states have call predecessors, (59), 54 states have call successors, (59) [2022-07-19 21:54:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 237 transitions. [2022-07-19 21:54:54,315 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 237 transitions. Word has length 108 [2022-07-19 21:54:54,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:54:54,316 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 237 transitions. [2022-07-19 21:54:54,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-19 21:54:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 237 transitions. [2022-07-19 21:54:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-19 21:54:54,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:54:54,318 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:54:54,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 21:54:54,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:54:54,532 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:54:54,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:54:54,532 INFO L85 PathProgramCache]: Analyzing trace with hash -225220613, now seen corresponding path program 3 times [2022-07-19 21:54:54,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:54:54,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596645816] [2022-07-19 21:54:54,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:54:54,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:54:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:54,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:54:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:54,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:54:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:54,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:54:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:54,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:54:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:54,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:54:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:54,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:54:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:54,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:54:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:54,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:54:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:54,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:54:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:54,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 21:54:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:54,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 21:54:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:54,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:54:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:54,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:54:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:54,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 21:54:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:54,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 21:54:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-19 21:54:54,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:54:54,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596645816] [2022-07-19 21:54:54,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596645816] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:54:54,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335343838] [2022-07-19 21:54:54,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 21:54:54,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:54:54,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:54:54,900 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:54:54,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 21:54:55,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-07-19 21:54:55,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:54:55,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 2407 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-19 21:54:55,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:54:55,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:54:55,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:54:55,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:54:55,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-19 21:54:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-19 21:54:55,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:54:55,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335343838] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:54:55,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:54:55,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-07-19 21:54:55,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209156597] [2022-07-19 21:54:55,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:54:55,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:54:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:54:55,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:54:55,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:54:55,778 INFO L87 Difference]: Start difference. First operand 171 states and 237 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:54:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:54:55,838 INFO L93 Difference]: Finished difference Result 282 states and 390 transitions. [2022-07-19 21:54:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:54:55,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2022-07-19 21:54:55,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:54:55,841 INFO L225 Difference]: With dead ends: 282 [2022-07-19 21:54:55,841 INFO L226 Difference]: Without dead ends: 190 [2022-07-19 21:54:55,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-19 21:54:55,843 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 37 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:54:55,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 720 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 60 Unchecked, 0.0s Time] [2022-07-19 21:54:55,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-19 21:54:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2022-07-19 21:54:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 121 states have internal predecessors, (142), 56 states have call successors, (56), 12 states have call predecessors, (56), 13 states have return successors, (61), 54 states have call predecessors, (61), 55 states have call successors, (61) [2022-07-19 21:54:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 259 transitions. [2022-07-19 21:54:55,859 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 259 transitions. Word has length 114 [2022-07-19 21:54:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:54:55,860 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 259 transitions. [2022-07-19 21:54:55,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:54:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 259 transitions. [2022-07-19 21:54:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-19 21:54:55,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:54:55,861 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 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] [2022-07-19 21:54:55,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 21:54:56,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:54:56,075 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:54:56,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:54:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash -812026627, now seen corresponding path program 1 times [2022-07-19 21:54:56,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:54:56,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892789011] [2022-07-19 21:54:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:54:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:54:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:54:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:54:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:54:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:54:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:54:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:54:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:54:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:54:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:54:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 21:54:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 21:54:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:54:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:54:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 21:54:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 21:54:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-19 21:54:56,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:54:56,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892789011] [2022-07-19 21:54:56,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892789011] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:54:56,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244903837] [2022-07-19 21:54:56,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:54:56,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:54:56,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:54:56,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:54:56,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 21:54:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:56,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 2802 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 21:54:56,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:54:56,948 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-19 21:54:56,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:54:56,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244903837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:54:56,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:54:56,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-07-19 21:54:56,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252010566] [2022-07-19 21:54:56,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:54:56,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:54:56,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:54:56,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:54:56,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:54:56,951 INFO L87 Difference]: Start difference. First operand 188 states and 259 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-19 21:54:56,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:54:56,991 INFO L93 Difference]: Finished difference Result 393 states and 553 transitions. [2022-07-19 21:54:56,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:54:56,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2022-07-19 21:54:56,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:54:56,995 INFO L225 Difference]: With dead ends: 393 [2022-07-19 21:54:56,995 INFO L226 Difference]: Without dead ends: 212 [2022-07-19 21:54:56,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:54:57,002 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 28 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:54:57,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 718 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 21:54:57,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-19 21:54:57,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 190. [2022-07-19 21:54:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 120 states have (on average 1.1916666666666667) internal successors, (143), 123 states have internal predecessors, (143), 56 states have call successors, (56), 12 states have call predecessors, (56), 13 states have return successors, (61), 54 states have call predecessors, (61), 55 states have call successors, (61) [2022-07-19 21:54:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 260 transitions. [2022-07-19 21:54:57,020 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 260 transitions. Word has length 114 [2022-07-19 21:54:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:54:57,022 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 260 transitions. [2022-07-19 21:54:57,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-19 21:54:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 260 transitions. [2022-07-19 21:54:57,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-19 21:54:57,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:54:57,026 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:54:57,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 21:54:57,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:54:57,244 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:54:57,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:54:57,244 INFO L85 PathProgramCache]: Analyzing trace with hash -110962049, now seen corresponding path program 1 times [2022-07-19 21:54:57,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:54:57,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998876977] [2022-07-19 21:54:57,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:54:57,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:54:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:57,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:54:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:54:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:57,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:54:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:57,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:54:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:57,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:54:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:57,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:54:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:57,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:54:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:57,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:54:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:57,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:54:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:57,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 21:54:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:57,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 21:54:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:57,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:54:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:57,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:54:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:57,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 21:54:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:57,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 21:54:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-19 21:54:57,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:54:57,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998876977] [2022-07-19 21:54:57,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998876977] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:54:57,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452602626] [2022-07-19 21:54:57,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:54:57,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:54:57,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:54:57,560 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:54:57,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 21:54:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 2797 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 21:54:58,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:54:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-19 21:54:58,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:54:58,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452602626] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:54:58,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:54:58,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-07-19 21:54:58,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616444529] [2022-07-19 21:54:58,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:54:58,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:54:58,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:54:58,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:54:58,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:54:58,090 INFO L87 Difference]: Start difference. First operand 190 states and 260 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-19 21:54:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:54:58,129 INFO L93 Difference]: Finished difference Result 381 states and 533 transitions. [2022-07-19 21:54:58,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:54:58,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2022-07-19 21:54:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:54:58,132 INFO L225 Difference]: With dead ends: 381 [2022-07-19 21:54:58,132 INFO L226 Difference]: Without dead ends: 198 [2022-07-19 21:54:58,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:54:58,134 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 20 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:54:58,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 682 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 21:54:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-19 21:54:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 182. [2022-07-19 21:54:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 113 states have (on average 1.1946902654867257) internal successors, (135), 115 states have internal predecessors, (135), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (60), 54 states have call predecessors, (60), 55 states have call successors, (60) [2022-07-19 21:54:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 251 transitions. [2022-07-19 21:54:58,155 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 251 transitions. Word has length 114 [2022-07-19 21:54:58,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:54:58,155 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 251 transitions. [2022-07-19 21:54:58,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-19 21:54:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 251 transitions. [2022-07-19 21:54:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-19 21:54:58,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:54:58,157 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:54:58,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-19 21:54:58,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:54:58,373 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:54:58,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:54:58,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2075601977, now seen corresponding path program 1 times [2022-07-19 21:54:58,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:54:58,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091670591] [2022-07-19 21:54:58,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:54:58,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:54:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:54:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:54:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:54:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:54:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:54:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:54:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:54:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:54:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:54:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 21:54:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 21:54:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:54:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:54:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 21:54:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 21:54:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-19 21:54:58,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:54:58,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091670591] [2022-07-19 21:54:58,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091670591] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:54:58,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788529613] [2022-07-19 21:54:58,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:54:58,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:54:58,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:54:58,689 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:54:58,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 21:54:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:54:59,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 2805 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 21:54:59,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:54:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-19 21:54:59,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:54:59,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788529613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:54:59,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:54:59,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-19 21:54:59,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092752890] [2022-07-19 21:54:59,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:54:59,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:54:59,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:54:59,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:54:59,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-19 21:54:59,340 INFO L87 Difference]: Start difference. First operand 182 states and 251 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-19 21:54:59,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:54:59,635 INFO L93 Difference]: Finished difference Result 324 states and 450 transitions. [2022-07-19 21:54:59,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:54:59,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 114 [2022-07-19 21:54:59,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:54:59,638 INFO L225 Difference]: With dead ends: 324 [2022-07-19 21:54:59,638 INFO L226 Difference]: Without dead ends: 179 [2022-07-19 21:54:59,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-07-19 21:54:59,639 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 298 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:54:59,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 556 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 21:54:59,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-19 21:54:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-07-19 21:54:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 112 states have internal predecessors, (132), 56 states have call successors, (56), 12 states have call predecessors, (56), 11 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2022-07-19 21:54:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 243 transitions. [2022-07-19 21:54:59,653 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 243 transitions. Word has length 114 [2022-07-19 21:54:59,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:54:59,653 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 243 transitions. [2022-07-19 21:54:59,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-07-19 21:54:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 243 transitions. [2022-07-19 21:54:59,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-19 21:54:59,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:54:59,655 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-19 21:54:59,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 21:54:59,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:54:59,884 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:54:59,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:54:59,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1603675154, now seen corresponding path program 1 times [2022-07-19 21:54:59,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:54:59,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243566792] [2022-07-19 21:54:59,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:54:59,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:00,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:00,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:00,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:00,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:00,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:00,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:00,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:00,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:55:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:00,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:00,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 21:55:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:00,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 21:55:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:00,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:00,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 21:55:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:00,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 21:55:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:00,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 21:55:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-07-19 21:55:00,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:00,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243566792] [2022-07-19 21:55:00,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243566792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:00,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:55:00,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:55:00,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499958923] [2022-07-19 21:55:00,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:00,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:55:00,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:00,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:55:00,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:55:00,264 INFO L87 Difference]: Start difference. First operand 179 states and 243 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-19 21:55:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:00,955 INFO L93 Difference]: Finished difference Result 198 states and 273 transitions. [2022-07-19 21:55:00,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:55:00,956 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2022-07-19 21:55:00,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:00,957 INFO L225 Difference]: With dead ends: 198 [2022-07-19 21:55:00,958 INFO L226 Difference]: Without dead ends: 196 [2022-07-19 21:55:00,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:55:00,958 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 141 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:00,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 966 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 21:55:00,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-19 21:55:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 188. [2022-07-19 21:55:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 117 states have (on average 1.1794871794871795) internal successors, (138), 119 states have internal predecessors, (138), 57 states have call successors, (57), 13 states have call predecessors, (57), 13 states have return successors, (67), 55 states have call predecessors, (67), 56 states have call successors, (67) [2022-07-19 21:55:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 262 transitions. [2022-07-19 21:55:00,973 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 262 transitions. Word has length 120 [2022-07-19 21:55:00,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:00,973 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 262 transitions. [2022-07-19 21:55:00,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-19 21:55:00,974 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 262 transitions. [2022-07-19 21:55:00,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-19 21:55:00,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:00,976 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:00,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 21:55:00,976 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:00,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1437147720, now seen corresponding path program 1 times [2022-07-19 21:55:00,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:00,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673936488] [2022-07-19 21:55:00,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:00,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:01,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:01,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:01,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:01,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:01,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:01,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:01,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:01,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:55:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:01,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:01,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 21:55:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:01,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 21:55:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:01,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:01,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 21:55:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:01,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 21:55:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:01,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 21:55:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-19 21:55:01,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:01,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673936488] [2022-07-19 21:55:01,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673936488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:01,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:55:01,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 21:55:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096093424] [2022-07-19 21:55:01,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:01,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:55:01,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:01,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:55:01,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:55:01,414 INFO L87 Difference]: Start difference. First operand 188 states and 262 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-19 21:55:02,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:02,083 INFO L93 Difference]: Finished difference Result 395 states and 567 transitions. [2022-07-19 21:55:02,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:55:02,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2022-07-19 21:55:02,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:02,086 INFO L225 Difference]: With dead ends: 395 [2022-07-19 21:55:02,086 INFO L226 Difference]: Without dead ends: 214 [2022-07-19 21:55:02,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:55:02,087 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 194 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:02,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 579 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 21:55:02,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-19 21:55:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 191. [2022-07-19 21:55:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 120 states have (on average 1.175) internal successors, (141), 122 states have internal predecessors, (141), 57 states have call successors, (57), 13 states have call predecessors, (57), 13 states have return successors, (67), 55 states have call predecessors, (67), 56 states have call successors, (67) [2022-07-19 21:55:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 265 transitions. [2022-07-19 21:55:02,106 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 265 transitions. Word has length 124 [2022-07-19 21:55:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:02,106 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 265 transitions. [2022-07-19 21:55:02,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-19 21:55:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 265 transitions. [2022-07-19 21:55:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-19 21:55:02,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:02,108 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:02,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 21:55:02,109 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:02,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:02,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1178982282, now seen corresponding path program 1 times [2022-07-19 21:55:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:02,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675845423] [2022-07-19 21:55:02,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:02,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:02,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:02,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:02,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:02,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:02,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:02,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:02,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:02,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:55:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:02,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:02,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 21:55:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:02,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 21:55:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:02,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:02,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 21:55:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:02,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 21:55:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:02,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 21:55:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-19 21:55:02,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:02,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675845423] [2022-07-19 21:55:02,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675845423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:02,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:55:02,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 21:55:02,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125375066] [2022-07-19 21:55:02,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:02,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:55:02,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:02,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:55:02,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:55:02,643 INFO L87 Difference]: Start difference. First operand 191 states and 265 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:55:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:03,636 INFO L93 Difference]: Finished difference Result 356 states and 516 transitions. [2022-07-19 21:55:03,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:55:03,637 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2022-07-19 21:55:03,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:03,639 INFO L225 Difference]: With dead ends: 356 [2022-07-19 21:55:03,639 INFO L226 Difference]: Without dead ends: 261 [2022-07-19 21:55:03,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-07-19 21:55:03,640 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 248 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:03,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 897 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 21:55:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-19 21:55:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 201. [2022-07-19 21:55:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 129 states have (on average 1.1705426356589148) internal successors, (151), 132 states have internal predecessors, (151), 57 states have call successors, (57), 13 states have call predecessors, (57), 14 states have return successors, (78), 55 states have call predecessors, (78), 56 states have call successors, (78) [2022-07-19 21:55:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 286 transitions. [2022-07-19 21:55:03,661 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 286 transitions. Word has length 124 [2022-07-19 21:55:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:03,662 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 286 transitions. [2022-07-19 21:55:03,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:55:03,662 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 286 transitions. [2022-07-19 21:55:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-19 21:55:03,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:03,664 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:03,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 21:55:03,665 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:03,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:03,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1836121336, now seen corresponding path program 1 times [2022-07-19 21:55:03,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:03,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692070704] [2022-07-19 21:55:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:03,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:04,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:04,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:04,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:04,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:04,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:04,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:04,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:04,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:55:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:04,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:04,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 21:55:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:04,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 21:55:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:04,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:04,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 21:55:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:04,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 21:55:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:04,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 21:55:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-19 21:55:04,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:04,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692070704] [2022-07-19 21:55:04,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692070704] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:55:04,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599769065] [2022-07-19 21:55:04,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:04,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:04,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:55:04,574 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:55:04,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 21:55:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:05,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 2824 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-19 21:55:05,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:55:05,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:05,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:05,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:05,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-19 21:55:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-19 21:55:05,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:55:05,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599769065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:05,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:55:05,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2022-07-19 21:55:05,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702847975] [2022-07-19 21:55:05,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:05,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:55:05,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:05,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:55:05,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-07-19 21:55:05,560 INFO L87 Difference]: Start difference. First operand 201 states and 286 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:55:05,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:05,640 INFO L93 Difference]: Finished difference Result 316 states and 444 transitions. [2022-07-19 21:55:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:55:05,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2022-07-19 21:55:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:05,644 INFO L225 Difference]: With dead ends: 316 [2022-07-19 21:55:05,644 INFO L226 Difference]: Without dead ends: 208 [2022-07-19 21:55:05,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2022-07-19 21:55:05,645 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 13 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:05,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 855 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 61 Unchecked, 0.0s Time] [2022-07-19 21:55:05,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-19 21:55:05,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2022-07-19 21:55:05,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 134 states have (on average 1.164179104477612) internal successors, (156), 137 states have internal predecessors, (156), 57 states have call successors, (57), 13 states have call predecessors, (57), 14 states have return successors, (78), 55 states have call predecessors, (78), 56 states have call successors, (78) [2022-07-19 21:55:05,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 291 transitions. [2022-07-19 21:55:05,662 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 291 transitions. Word has length 124 [2022-07-19 21:55:05,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:05,664 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 291 transitions. [2022-07-19 21:55:05,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:55:05,664 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 291 transitions. [2022-07-19 21:55:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-19 21:55:05,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:05,666 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:05,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 21:55:05,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-19 21:55:05,891 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:05,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:05,892 INFO L85 PathProgramCache]: Analyzing trace with hash -10392004, now seen corresponding path program 1 times [2022-07-19 21:55:05,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:05,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134074315] [2022-07-19 21:55:05,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:05,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:06,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:06,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:06,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:06,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:06,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:06,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:06,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:06,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 21:55:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:06,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:06,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 21:55:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:06,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 21:55:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:06,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:06,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 21:55:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:06,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 21:55:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:06,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 21:55:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-19 21:55:06,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:06,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134074315] [2022-07-19 21:55:06,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134074315] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:55:06,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866383232] [2022-07-19 21:55:06,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:06,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:06,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:55:06,684 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:55:06,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 21:55:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:07,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 2826 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-19 21:55:07,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:55:07,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 21:55:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-19 21:55:07,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:55:07,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866383232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:07,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:55:07,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 25 [2022-07-19 21:55:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015141376] [2022-07-19 21:55:07,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:07,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 21:55:07,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:07,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 21:55:07,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2022-07-19 21:55:07,604 INFO L87 Difference]: Start difference. First operand 206 states and 291 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 10 states have internal predecessors, (64), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-19 21:55:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:07,859 INFO L93 Difference]: Finished difference Result 422 states and 588 transitions. [2022-07-19 21:55:07,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:55:07,860 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 10 states have internal predecessors, (64), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 124 [2022-07-19 21:55:07,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:07,861 INFO L225 Difference]: With dead ends: 422 [2022-07-19 21:55:07,861 INFO L226 Difference]: Without dead ends: 219 [2022-07-19 21:55:07,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2022-07-19 21:55:07,865 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 75 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:07,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1318 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2022-07-19 21:55:07,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-19 21:55:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2022-07-19 21:55:07,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 141 states have (on average 1.1702127659574468) internal successors, (165), 143 states have internal predecessors, (165), 57 states have call successors, (57), 14 states have call predecessors, (57), 14 states have return successors, (77), 55 states have call predecessors, (77), 56 states have call successors, (77) [2022-07-19 21:55:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 299 transitions. [2022-07-19 21:55:07,884 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 299 transitions. Word has length 124 [2022-07-19 21:55:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:07,884 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 299 transitions. [2022-07-19 21:55:07,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 10 states have internal predecessors, (64), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-19 21:55:07,885 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 299 transitions. [2022-07-19 21:55:07,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-19 21:55:07,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:07,887 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:07,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 21:55:08,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 21:55:08,107 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:08,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:08,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1190017078, now seen corresponding path program 1 times [2022-07-19 21:55:08,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:08,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863933679] [2022-07-19 21:55:08,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:08,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:08,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:08,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:08,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:08,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:08,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:08,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:08,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:08,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 21:55:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:08,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:55:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:08,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:55:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:08,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:55:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:08,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:55:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:08,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 21:55:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:08,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 21:55:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:08,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 21:55:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-19 21:55:08,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:08,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863933679] [2022-07-19 21:55:08,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863933679] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:55:08,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550781483] [2022-07-19 21:55:08,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:08,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:08,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:55:08,496 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:55:08,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 21:55:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:09,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 2833 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-19 21:55:09,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:55:09,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 21:55:09,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:09,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:09,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:09,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2022-07-19 21:55:09,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-19 21:55:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 21:55:09,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:55:09,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550781483] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:09,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:55:09,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2022-07-19 21:55:09,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595970559] [2022-07-19 21:55:09,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:09,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 21:55:09,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:09,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 21:55:09,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2022-07-19 21:55:09,932 INFO L87 Difference]: Start difference. First operand 213 states and 299 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 14 states have internal predecessors, (79), 6 states have call successors, (16), 3 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-19 21:55:10,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:10,256 INFO L93 Difference]: Finished difference Result 514 states and 750 transitions. [2022-07-19 21:55:10,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 21:55:10,256 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 14 states have internal predecessors, (79), 6 states have call successors, (16), 3 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 128 [2022-07-19 21:55:10,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:10,259 INFO L225 Difference]: With dead ends: 514 [2022-07-19 21:55:10,259 INFO L226 Difference]: Without dead ends: 360 [2022-07-19 21:55:10,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 134 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2022-07-19 21:55:10,262 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 85 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:10,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 2113 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 154 Unchecked, 0.2s Time] [2022-07-19 21:55:10,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-07-19 21:55:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 263. [2022-07-19 21:55:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 182 states have (on average 1.1868131868131868) internal successors, (216), 185 states have internal predecessors, (216), 62 states have call successors, (62), 17 states have call predecessors, (62), 18 states have return successors, (88), 60 states have call predecessors, (88), 61 states have call successors, (88) [2022-07-19 21:55:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 366 transitions. [2022-07-19 21:55:10,286 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 366 transitions. Word has length 128 [2022-07-19 21:55:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:10,287 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 366 transitions. [2022-07-19 21:55:10,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 14 states have internal predecessors, (79), 6 states have call successors, (16), 3 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-19 21:55:10,287 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 366 transitions. [2022-07-19 21:55:10,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-19 21:55:10,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:10,289 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:10,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 21:55:10,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-19 21:55:10,500 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:10,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:10,500 INFO L85 PathProgramCache]: Analyzing trace with hash 955701423, now seen corresponding path program 1 times [2022-07-19 21:55:10,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:10,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178981827] [2022-07-19 21:55:10,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:10,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:10,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:10,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:10,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:10,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:10,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:10,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:10,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:10,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:10,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:55:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:10,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:55:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:10,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:10,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:55:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:10,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 21:55:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:10,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 21:55:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:10,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 21:55:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-19 21:55:10,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:10,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178981827] [2022-07-19 21:55:10,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178981827] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:55:10,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318174974] [2022-07-19 21:55:10,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:10,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:10,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:55:10,716 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:55:10,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 21:55:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:11,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 2843 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 21:55:11,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:55:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-19 21:55:11,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:55:11,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318174974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:11,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:55:11,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-19 21:55:11,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465423589] [2022-07-19 21:55:11,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:11,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:55:11,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:11,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:55:11,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:55:11,357 INFO L87 Difference]: Start difference. First operand 263 states and 366 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:55:11,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:11,394 INFO L93 Difference]: Finished difference Result 525 states and 750 transitions. [2022-07-19 21:55:11,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:55:11,394 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2022-07-19 21:55:11,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:11,396 INFO L225 Difference]: With dead ends: 525 [2022-07-19 21:55:11,396 INFO L226 Difference]: Without dead ends: 269 [2022-07-19 21:55:11,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:55:11,399 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 9 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:11,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 672 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 21:55:11,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-19 21:55:11,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 252. [2022-07-19 21:55:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 171 states have (on average 1.1695906432748537) internal successors, (200), 174 states have internal predecessors, (200), 62 states have call successors, (62), 17 states have call predecessors, (62), 18 states have return successors, (85), 60 states have call predecessors, (85), 61 states have call successors, (85) [2022-07-19 21:55:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 347 transitions. [2022-07-19 21:55:11,422 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 347 transitions. Word has length 130 [2022-07-19 21:55:11,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:11,422 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 347 transitions. [2022-07-19 21:55:11,423 INFO L496 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:55:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 347 transitions. [2022-07-19 21:55:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-19 21:55:11,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:11,425 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-19 21:55:11,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 21:55:11,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-19 21:55:11,651 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:11,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:11,652 INFO L85 PathProgramCache]: Analyzing trace with hash 78959785, now seen corresponding path program 1 times [2022-07-19 21:55:11,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:11,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372272071] [2022-07-19 21:55:11,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:11,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:55:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:55:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:55:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-19 21:55:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 21:55:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 21:55:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,349 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-19 21:55:12,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:12,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372272071] [2022-07-19 21:55:12,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372272071] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:55:12,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406246113] [2022-07-19 21:55:12,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:12,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:12,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:55:12,351 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:55:12,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 21:55:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:12,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 2840 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-19 21:55:12,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:55:12,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 21:55:13,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:13,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2022-07-19 21:55:13,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2022-07-19 21:55:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 102 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 21:55:13,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:55:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 10 proven. 44 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-19 21:55:14,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406246113] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:55:14,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:55:14,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 36 [2022-07-19 21:55:14,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595488176] [2022-07-19 21:55:14,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:55:14,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-19 21:55:14,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:14,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-19 21:55:14,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1152, Unknown=0, NotChecked=0, Total=1260 [2022-07-19 21:55:14,187 INFO L87 Difference]: Start difference. First operand 252 states and 347 transitions. Second operand has 36 states, 35 states have (on average 4.571428571428571) internal successors, (160), 33 states have internal predecessors, (160), 12 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2022-07-19 21:55:22,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:22,724 INFO L93 Difference]: Finished difference Result 820 states and 1259 transitions. [2022-07-19 21:55:22,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-19 21:55:22,724 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.571428571428571) internal successors, (160), 33 states have internal predecessors, (160), 12 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) Word has length 130 [2022-07-19 21:55:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:22,729 INFO L225 Difference]: With dead ends: 820 [2022-07-19 21:55:22,729 INFO L226 Difference]: Without dead ends: 661 [2022-07-19 21:55:22,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 273 SyntacticMatches, 9 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=757, Invalid=6896, Unknown=3, NotChecked=0, Total=7656 [2022-07-19 21:55:22,732 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 465 mSDsluCounter, 3555 mSDsCounter, 0 mSdLazyCounter, 7795 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 3922 SdHoareTripleChecker+Invalid, 9073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 7795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 872 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:22,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 3922 Invalid, 9073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 7795 Invalid, 0 Unknown, 872 Unchecked, 6.3s Time] [2022-07-19 21:55:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-07-19 21:55:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 478. [2022-07-19 21:55:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 319 states have (on average 1.1755485893416928) internal successors, (375), 327 states have internal predecessors, (375), 129 states have call successors, (129), 23 states have call predecessors, (129), 29 states have return successors, (184), 127 states have call predecessors, (184), 128 states have call successors, (184) [2022-07-19 21:55:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 688 transitions. [2022-07-19 21:55:22,779 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 688 transitions. Word has length 130 [2022-07-19 21:55:22,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:22,780 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 688 transitions. [2022-07-19 21:55:22,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.571428571428571) internal successors, (160), 33 states have internal predecessors, (160), 12 states have call successors, (40), 5 states have call predecessors, (40), 9 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2022-07-19 21:55:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 688 transitions. [2022-07-19 21:55:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-19 21:55:22,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:22,782 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-07-19 21:55:22,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 21:55:22,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-19 21:55:22,995 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:22,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:22,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1718133808, now seen corresponding path program 2 times [2022-07-19 21:55:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:22,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269406948] [2022-07-19 21:55:22,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:22,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:23,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:23,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:23,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:23,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:23,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:23,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:23,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:23,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 21:55:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:23,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:55:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:23,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:55:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:23,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:55:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:23,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:55:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:23,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 21:55:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:23,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 21:55:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:23,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 21:55:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-19 21:55:23,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:23,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269406948] [2022-07-19 21:55:23,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269406948] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:55:23,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314125110] [2022-07-19 21:55:23,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:55:23,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:23,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:55:23,363 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:55:23,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-19 21:55:23,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 21:55:23,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:55:23,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 2411 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-19 21:55:23,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:55:23,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:23,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:23,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:23,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-19 21:55:24,272 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-19 21:55:24,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:55:24,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314125110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:24,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:55:24,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-07-19 21:55:24,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713265008] [2022-07-19 21:55:24,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:24,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:55:24,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:24,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:55:24,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-19 21:55:24,275 INFO L87 Difference]: Start difference. First operand 478 states and 688 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:55:24,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:24,316 INFO L93 Difference]: Finished difference Result 602 states and 856 transitions. [2022-07-19 21:55:24,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:55:24,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2022-07-19 21:55:24,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:24,320 INFO L225 Difference]: With dead ends: 602 [2022-07-19 21:55:24,320 INFO L226 Difference]: Without dead ends: 495 [2022-07-19 21:55:24,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-19 21:55:24,321 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 25 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:24,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1081 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 140 Unchecked, 0.0s Time] [2022-07-19 21:55:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-07-19 21:55:24,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2022-07-19 21:55:24,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 335 states have (on average 1.173134328358209) internal successors, (393), 343 states have internal predecessors, (393), 129 states have call successors, (129), 24 states have call predecessors, (129), 30 states have return successors, (186), 127 states have call predecessors, (186), 128 states have call successors, (186) [2022-07-19 21:55:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 708 transitions. [2022-07-19 21:55:24,361 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 708 transitions. Word has length 132 [2022-07-19 21:55:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:24,361 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 708 transitions. [2022-07-19 21:55:24,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:55:24,362 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 708 transitions. [2022-07-19 21:55:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-19 21:55:24,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:24,364 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:24,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-19 21:55:24,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-19 21:55:24,579 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:24,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:24,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1976299246, now seen corresponding path program 1 times [2022-07-19 21:55:24,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:24,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533079608] [2022-07-19 21:55:24,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:24,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:24,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:24,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:24,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:24,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:24,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:24,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:24,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:24,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 21:55:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:24,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:55:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:24,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:55:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:24,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:55:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:24,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:55:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:24,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 21:55:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:24,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 21:55:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:24,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 21:55:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-19 21:55:24,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:24,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533079608] [2022-07-19 21:55:24,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533079608] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:55:24,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432523131] [2022-07-19 21:55:24,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:24,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:24,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:55:24,900 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:55:24,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-19 21:55:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:25,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 2835 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 21:55:25,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:55:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-19 21:55:25,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:55:25,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432523131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:25,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:55:25,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-07-19 21:55:25,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322723117] [2022-07-19 21:55:25,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:25,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:55:25,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:25,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:55:25,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:55:25,641 INFO L87 Difference]: Start difference. First operand 495 states and 708 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-19 21:55:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:25,897 INFO L93 Difference]: Finished difference Result 942 states and 1377 transitions. [2022-07-19 21:55:25,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:55:25,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2022-07-19 21:55:25,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:25,905 INFO L225 Difference]: With dead ends: 942 [2022-07-19 21:55:25,905 INFO L226 Difference]: Without dead ends: 480 [2022-07-19 21:55:25,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-19 21:55:25,908 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 6 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:25,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 813 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2022-07-19 21:55:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-07-19 21:55:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2022-07-19 21:55:25,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 321 states have (on average 1.1651090342679127) internal successors, (374), 328 states have internal predecessors, (374), 129 states have call successors, (129), 24 states have call predecessors, (129), 29 states have return successors, (184), 127 states have call predecessors, (184), 128 states have call successors, (184) [2022-07-19 21:55:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 687 transitions. [2022-07-19 21:55:25,952 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 687 transitions. Word has length 132 [2022-07-19 21:55:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:25,953 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 687 transitions. [2022-07-19 21:55:25,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-19 21:55:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 687 transitions. [2022-07-19 21:55:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-19 21:55:25,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:25,956 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:25,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-19 21:55:26,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:26,179 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:26,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash 768398248, now seen corresponding path program 1 times [2022-07-19 21:55:26,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:26,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050466900] [2022-07-19 21:55:26,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:26,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:26,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:26,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:26,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:26,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:26,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:26,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:26,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 21:55:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:26,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 21:55:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:26,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 21:55:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:26,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 21:55:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:26,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:55:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:26,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 21:55:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:26,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 21:55:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:26,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 21:55:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-19 21:55:26,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:26,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050466900] [2022-07-19 21:55:26,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050466900] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:55:26,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445744107] [2022-07-19 21:55:26,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:26,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:26,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:55:26,542 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:55:26,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-19 21:55:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 2843 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 21:55:27,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:55:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-19 21:55:27,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:55:27,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445744107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:27,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:55:27,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-19 21:55:27,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535262138] [2022-07-19 21:55:27,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:27,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:55:27,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:27,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:55:27,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-19 21:55:27,187 INFO L87 Difference]: Start difference. First operand 480 states and 687 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-19 21:55:27,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:27,359 INFO L93 Difference]: Finished difference Result 881 states and 1254 transitions. [2022-07-19 21:55:27,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:55:27,360 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 132 [2022-07-19 21:55:27,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:27,363 INFO L225 Difference]: With dead ends: 881 [2022-07-19 21:55:27,363 INFO L226 Difference]: Without dead ends: 409 [2022-07-19 21:55:27,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:55:27,366 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 12 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:27,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1734 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:55:27,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-07-19 21:55:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 399. [2022-07-19 21:55:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 272 states have (on average 1.1470588235294117) internal successors, (312), 280 states have internal predecessors, (312), 99 states have call successors, (99), 21 states have call predecessors, (99), 27 states have return successors, (159), 97 states have call predecessors, (159), 98 states have call successors, (159) [2022-07-19 21:55:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 570 transitions. [2022-07-19 21:55:27,406 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 570 transitions. Word has length 132 [2022-07-19 21:55:27,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:27,406 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 570 transitions. [2022-07-19 21:55:27,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-19 21:55:27,407 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 570 transitions. [2022-07-19 21:55:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-19 21:55:27,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:27,409 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:27,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-19 21:55:27,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:27,631 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:27,632 INFO L85 PathProgramCache]: Analyzing trace with hash -984070051, now seen corresponding path program 1 times [2022-07-19 21:55:27,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:27,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187079203] [2022-07-19 21:55:27,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:27,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:55:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:55:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:55:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 21:55:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 21:55:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 21:55:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-19 21:55:27,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:27,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187079203] [2022-07-19 21:55:27,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187079203] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:55:27,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776964334] [2022-07-19 21:55:27,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:27,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:27,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:55:27,956 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:55:27,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-19 21:55:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:28,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 2845 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 21:55:28,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:55:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-19 21:55:28,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:55:28,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776964334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:28,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:55:28,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-19 21:55:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626669544] [2022-07-19 21:55:28,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:28,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:55:28,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:28,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:55:28,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-19 21:55:28,566 INFO L87 Difference]: Start difference. First operand 399 states and 570 transitions. Second operand has 9 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-19 21:55:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:28,731 INFO L93 Difference]: Finished difference Result 635 states and 923 transitions. [2022-07-19 21:55:28,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:55:28,732 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2022-07-19 21:55:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:28,735 INFO L225 Difference]: With dead ends: 635 [2022-07-19 21:55:28,735 INFO L226 Difference]: Without dead ends: 404 [2022-07-19 21:55:28,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:55:28,737 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 12 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:28,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1761 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:55:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-07-19 21:55:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 396. [2022-07-19 21:55:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 270 states have (on average 1.1481481481481481) internal successors, (310), 277 states have internal predecessors, (310), 99 states have call successors, (99), 21 states have call predecessors, (99), 26 states have return successors, (152), 97 states have call predecessors, (152), 98 states have call successors, (152) [2022-07-19 21:55:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 561 transitions. [2022-07-19 21:55:28,770 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 561 transitions. Word has length 134 [2022-07-19 21:55:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:28,771 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 561 transitions. [2022-07-19 21:55:28,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-19 21:55:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 561 transitions. [2022-07-19 21:55:28,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-19 21:55:28,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:28,773 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:28,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-19 21:55:28,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:29,000 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:29,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:29,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2087607718, now seen corresponding path program 1 times [2022-07-19 21:55:29,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:29,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818033972] [2022-07-19 21:55:29,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:29,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:55:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:55:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 21:55:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 21:55:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 21:55:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 21:55:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 21:55:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 21:55:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-19 21:55:29,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:29,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818033972] [2022-07-19 21:55:29,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818033972] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:55:29,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881626006] [2022-07-19 21:55:29,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:29,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:29,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:55:29,784 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:55:29,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-19 21:55:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:30,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 2883 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-19 21:55:30,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:55:30,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 21:55:30,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-07-19 21:55:30,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-19 21:55:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-19 21:55:30,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:55:30,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881626006] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:30,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:55:30,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 25 [2022-07-19 21:55:30,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711576432] [2022-07-19 21:55:30,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:30,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:55:30,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:30,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:55:30,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2022-07-19 21:55:30,828 INFO L87 Difference]: Start difference. First operand 396 states and 561 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-19 21:55:31,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:31,964 INFO L93 Difference]: Finished difference Result 683 states and 1039 transitions. [2022-07-19 21:55:31,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 21:55:31,965 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 137 [2022-07-19 21:55:31,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:31,968 INFO L225 Difference]: With dead ends: 683 [2022-07-19 21:55:31,968 INFO L226 Difference]: Without dead ends: 509 [2022-07-19 21:55:31,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 157 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2022-07-19 21:55:31,970 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 155 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:31,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1745 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 833 Invalid, 0 Unknown, 106 Unchecked, 1.0s Time] [2022-07-19 21:55:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-07-19 21:55:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 412. [2022-07-19 21:55:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 283 states have (on average 1.137809187279152) internal successors, (322), 292 states have internal predecessors, (322), 99 states have call successors, (99), 22 states have call predecessors, (99), 29 states have return successors, (173), 97 states have call predecessors, (173), 98 states have call successors, (173) [2022-07-19 21:55:32,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 594 transitions. [2022-07-19 21:55:32,009 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 594 transitions. Word has length 137 [2022-07-19 21:55:32,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:32,010 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 594 transitions. [2022-07-19 21:55:32,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-19 21:55:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 594 transitions. [2022-07-19 21:55:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-19 21:55:32,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:32,012 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:32,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-19 21:55:32,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:32,230 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:32,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:32,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1691174062, now seen corresponding path program 2 times [2022-07-19 21:55:32,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:32,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855636475] [2022-07-19 21:55:32,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:32,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:32,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:32,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:32,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:32,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:32,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:32,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:32,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:32,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:33,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:55:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:33,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:55:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:33,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:33,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:55:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 21:55:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:33,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 21:55:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:33,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 21:55:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-07-19 21:55:33,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:33,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855636475] [2022-07-19 21:55:33,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855636475] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:55:33,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582280071] [2022-07-19 21:55:33,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:55:33,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:33,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:55:33,128 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:55:33,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-19 21:55:33,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 21:55:33,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:55:33,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 2414 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-19 21:55:33,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:55:33,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:33,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:33,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:33,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:33,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:33,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:33,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-19 21:55:33,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:33,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:33,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:33,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:33,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:33,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:33,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-19 21:55:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-19 21:55:34,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:55:34,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582280071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:34,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:55:34,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 24 [2022-07-19 21:55:34,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091116398] [2022-07-19 21:55:34,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:34,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:55:34,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:34,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:55:34,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2022-07-19 21:55:34,047 INFO L87 Difference]: Start difference. First operand 412 states and 594 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:55:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:34,127 INFO L93 Difference]: Finished difference Result 541 states and 770 transitions. [2022-07-19 21:55:34,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:55:34,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2022-07-19 21:55:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:34,131 INFO L225 Difference]: With dead ends: 541 [2022-07-19 21:55:34,131 INFO L226 Difference]: Without dead ends: 422 [2022-07-19 21:55:34,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2022-07-19 21:55:34,133 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 13 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:34,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1267 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 152 Unchecked, 0.0s Time] [2022-07-19 21:55:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-07-19 21:55:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 416. [2022-07-19 21:55:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 287 states have (on average 1.1393728222996515) internal successors, (327), 296 states have internal predecessors, (327), 99 states have call successors, (99), 22 states have call predecessors, (99), 29 states have return successors, (173), 97 states have call predecessors, (173), 98 states have call successors, (173) [2022-07-19 21:55:34,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 599 transitions. [2022-07-19 21:55:34,168 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 599 transitions. Word has length 136 [2022-07-19 21:55:34,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:34,168 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 599 transitions. [2022-07-19 21:55:34,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:55:34,169 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 599 transitions. [2022-07-19 21:55:34,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-19 21:55:34,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:34,171 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:34,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-19 21:55:34,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:34,387 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:34,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1323929556, now seen corresponding path program 3 times [2022-07-19 21:55:34,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:34,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402326176] [2022-07-19 21:55:34,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:34,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:34,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:34,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:34,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:34,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:34,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:34,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:34,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:34,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:34,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:55:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:34,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:55:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:34,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:34,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:55:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:34,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 21:55:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:34,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 21:55:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:34,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 21:55:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-19 21:55:34,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:34,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402326176] [2022-07-19 21:55:34,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402326176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:34,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:55:34,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 21:55:34,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798147197] [2022-07-19 21:55:34,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:34,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:55:34,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:34,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:55:34,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:55:34,841 INFO L87 Difference]: Start difference. First operand 416 states and 599 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:55:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:36,225 INFO L93 Difference]: Finished difference Result 601 states and 891 transitions. [2022-07-19 21:55:36,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:55:36,227 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2022-07-19 21:55:36,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:36,230 INFO L225 Difference]: With dead ends: 601 [2022-07-19 21:55:36,230 INFO L226 Difference]: Without dead ends: 490 [2022-07-19 21:55:36,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-07-19 21:55:36,232 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 200 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:36,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1144 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-19 21:55:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-07-19 21:55:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 416. [2022-07-19 21:55:36,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 287 states have (on average 1.1393728222996515) internal successors, (327), 296 states have internal predecessors, (327), 99 states have call successors, (99), 22 states have call predecessors, (99), 29 states have return successors, (172), 97 states have call predecessors, (172), 98 states have call successors, (172) [2022-07-19 21:55:36,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 598 transitions. [2022-07-19 21:55:36,270 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 598 transitions. Word has length 136 [2022-07-19 21:55:36,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:36,270 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 598 transitions. [2022-07-19 21:55:36,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:55:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 598 transitions. [2022-07-19 21:55:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-19 21:55:36,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:36,272 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:36,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 21:55:36,273 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:36,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:36,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1902565441, now seen corresponding path program 1 times [2022-07-19 21:55:36,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:36,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785961445] [2022-07-19 21:55:36,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:36,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:36,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:36,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:36,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:36,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:36,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:36,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:36,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:36,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:55:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:36,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:55:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:36,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:36,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:55:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:36,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 21:55:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:36,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 21:55:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:36,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 21:55:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-19 21:55:36,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:36,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785961445] [2022-07-19 21:55:36,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785961445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:36,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:55:36,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 21:55:36,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644029498] [2022-07-19 21:55:36,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:36,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 21:55:36,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:36,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 21:55:36,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 21:55:36,592 INFO L87 Difference]: Start difference. First operand 416 states and 598 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-19 21:55:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:37,457 INFO L93 Difference]: Finished difference Result 432 states and 614 transitions. [2022-07-19 21:55:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:55:37,458 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2022-07-19 21:55:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:37,460 INFO L225 Difference]: With dead ends: 432 [2022-07-19 21:55:37,460 INFO L226 Difference]: Without dead ends: 430 [2022-07-19 21:55:37,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-07-19 21:55:37,462 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 154 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:37,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1186 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 21:55:37,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-07-19 21:55:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 416. [2022-07-19 21:55:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 287 states have (on average 1.1393728222996515) internal successors, (327), 296 states have internal predecessors, (327), 99 states have call successors, (99), 22 states have call predecessors, (99), 29 states have return successors, (172), 97 states have call predecessors, (172), 98 states have call successors, (172) [2022-07-19 21:55:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 598 transitions. [2022-07-19 21:55:37,498 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 598 transitions. Word has length 138 [2022-07-19 21:55:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:37,498 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 598 transitions. [2022-07-19 21:55:37,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-19 21:55:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 598 transitions. [2022-07-19 21:55:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-19 21:55:37,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:37,500 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-07-19 21:55:37,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 21:55:37,501 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:37,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1201500863, now seen corresponding path program 1 times [2022-07-19 21:55:37,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:37,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437468004] [2022-07-19 21:55:37,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:37,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:38,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:38,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:38,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:38,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:38,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:38,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:38,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:38,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:55:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:38,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:55:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:38,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:38,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:55:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:38,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 21:55:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:38,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 21:55:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:38,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 21:55:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 16 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-19 21:55:38,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:38,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437468004] [2022-07-19 21:55:38,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437468004] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:55:38,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115099451] [2022-07-19 21:55:38,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:38,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:38,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:55:38,869 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:55:38,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-19 21:55:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:39,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 2854 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-19 21:55:39,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:55:39,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:39,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:39,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:39,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:39,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:39,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:39,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-19 21:55:39,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:39,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:39,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:39,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:39,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:39,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:39,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-19 21:55:40,654 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:55:40,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 53 [2022-07-19 21:55:40,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2022-07-19 21:55:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 22 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-19 21:55:40,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:55:41,799 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-19 21:55:41,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115099451] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 21:55:41,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 21:55:41,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [26, 25] total 57 [2022-07-19 21:55:41,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494377822] [2022-07-19 21:55:41,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:41,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 21:55:41,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:41,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 21:55:41,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3022, Unknown=0, NotChecked=0, Total=3192 [2022-07-19 21:55:41,801 INFO L87 Difference]: Start difference. First operand 416 states and 598 transitions. Second operand has 16 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:55:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:42,919 INFO L93 Difference]: Finished difference Result 481 states and 694 transitions. [2022-07-19 21:55:42,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 21:55:42,920 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2022-07-19 21:55:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:42,923 INFO L225 Difference]: With dead ends: 481 [2022-07-19 21:55:42,923 INFO L226 Difference]: Without dead ends: 479 [2022-07-19 21:55:42,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 270 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=239, Invalid=4183, Unknown=0, NotChecked=0, Total=4422 [2022-07-19 21:55:42,925 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 75 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:42,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 3213 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 21:55:42,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-07-19 21:55:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 416. [2022-07-19 21:55:42,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 287 states have (on average 1.1393728222996515) internal successors, (327), 296 states have internal predecessors, (327), 99 states have call successors, (99), 22 states have call predecessors, (99), 29 states have return successors, (172), 97 states have call predecessors, (172), 98 states have call successors, (172) [2022-07-19 21:55:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 598 transitions. [2022-07-19 21:55:42,966 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 598 transitions. Word has length 138 [2022-07-19 21:55:42,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:42,966 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 598 transitions. [2022-07-19 21:55:42,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:55:42,966 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 598 transitions. [2022-07-19 21:55:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-19 21:55:42,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:42,968 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-07-19 21:55:42,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-19 21:55:43,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:43,183 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:43,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:43,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1335514369, now seen corresponding path program 1 times [2022-07-19 21:55:43,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:43,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673164032] [2022-07-19 21:55:43,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:43,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:43,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:43,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:43,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:43,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:43,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:43,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:43,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:43,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:43,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:55:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:43,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:55:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:43,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:43,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:55:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:43,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 21:55:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:43,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 21:55:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:43,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 21:55:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:43,582 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-19 21:55:43,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:43,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673164032] [2022-07-19 21:55:43,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673164032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:43,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:55:43,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 21:55:43,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323621149] [2022-07-19 21:55:43,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:43,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:55:43,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:43,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:55:43,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:55:43,586 INFO L87 Difference]: Start difference. First operand 416 states and 598 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:55:44,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:44,559 INFO L93 Difference]: Finished difference Result 579 states and 848 transitions. [2022-07-19 21:55:44,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:55:44,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2022-07-19 21:55:44,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:44,563 INFO L225 Difference]: With dead ends: 579 [2022-07-19 21:55:44,563 INFO L226 Difference]: Without dead ends: 468 [2022-07-19 21:55:44,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-19 21:55:44,564 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 117 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:44,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 937 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 21:55:44,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-07-19 21:55:44,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 415. [2022-07-19 21:55:44,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 287 states have (on average 1.1393728222996515) internal successors, (327), 296 states have internal predecessors, (327), 98 states have call successors, (98), 22 states have call predecessors, (98), 29 states have return successors, (170), 96 states have call predecessors, (170), 97 states have call successors, (170) [2022-07-19 21:55:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 595 transitions. [2022-07-19 21:55:44,606 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 595 transitions. Word has length 138 [2022-07-19 21:55:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:44,607 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 595 transitions. [2022-07-19 21:55:44,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 21:55:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 595 transitions. [2022-07-19 21:55:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-19 21:55:44,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:44,609 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:44,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 21:55:44,609 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:44,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:44,610 INFO L85 PathProgramCache]: Analyzing trace with hash 148730141, now seen corresponding path program 1 times [2022-07-19 21:55:44,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:44,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402132574] [2022-07-19 21:55:44,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:44,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:55:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:55:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:55:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 21:55:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 21:55:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 21:55:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-19 21:55:44,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:44,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402132574] [2022-07-19 21:55:44,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402132574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:44,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:55:44,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 21:55:44,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634055414] [2022-07-19 21:55:44,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:44,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:55:44,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:44,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:55:44,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:55:44,853 INFO L87 Difference]: Start difference. First operand 415 states and 595 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-19 21:55:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:45,527 INFO L93 Difference]: Finished difference Result 588 states and 864 transitions. [2022-07-19 21:55:45,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 21:55:45,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 142 [2022-07-19 21:55:45,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:45,531 INFO L225 Difference]: With dead ends: 588 [2022-07-19 21:55:45,531 INFO L226 Difference]: Without dead ends: 415 [2022-07-19 21:55:45,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:55:45,533 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 85 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:45,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 795 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 21:55:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-19 21:55:45,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2022-07-19 21:55:45,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 287 states have (on average 1.1358885017421603) internal successors, (326), 296 states have internal predecessors, (326), 98 states have call successors, (98), 22 states have call predecessors, (98), 29 states have return successors, (170), 96 states have call predecessors, (170), 97 states have call successors, (170) [2022-07-19 21:55:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 594 transitions. [2022-07-19 21:55:45,570 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 594 transitions. Word has length 142 [2022-07-19 21:55:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:45,571 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 594 transitions. [2022-07-19 21:55:45,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-19 21:55:45,571 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 594 transitions. [2022-07-19 21:55:45,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-19 21:55:45,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:45,573 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:45,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-19 21:55:45,573 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:45,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:45,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1573992648, now seen corresponding path program 1 times [2022-07-19 21:55:45,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:45,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668612610] [2022-07-19 21:55:45,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:45,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:55:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:55:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:55:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 21:55:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 21:55:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 21:55:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-07-19 21:55:45,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:45,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668612610] [2022-07-19 21:55:45,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668612610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:45,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:55:45,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 21:55:45,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273167938] [2022-07-19 21:55:45,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:45,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 21:55:45,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:45,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 21:55:45,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-19 21:55:45,862 INFO L87 Difference]: Start difference. First operand 415 states and 594 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-19 21:55:46,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:46,513 INFO L93 Difference]: Finished difference Result 435 states and 616 transitions. [2022-07-19 21:55:46,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 21:55:46,513 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2022-07-19 21:55:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:46,515 INFO L225 Difference]: With dead ends: 435 [2022-07-19 21:55:46,515 INFO L226 Difference]: Without dead ends: 433 [2022-07-19 21:55:46,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-07-19 21:55:46,516 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 192 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:46,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 977 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 21:55:46,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-07-19 21:55:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 422. [2022-07-19 21:55:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 290 states have (on average 1.1344827586206896) internal successors, (329), 299 states have internal predecessors, (329), 101 states have call successors, (101), 23 states have call predecessors, (101), 30 states have return successors, (173), 99 states have call predecessors, (173), 100 states have call successors, (173) [2022-07-19 21:55:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 603 transitions. [2022-07-19 21:55:46,556 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 603 transitions. Word has length 143 [2022-07-19 21:55:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:46,557 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 603 transitions. [2022-07-19 21:55:46,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-19 21:55:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 603 transitions. [2022-07-19 21:55:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 21:55:46,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:46,559 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:46,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-19 21:55:46,560 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash -874766962, now seen corresponding path program 1 times [2022-07-19 21:55:46,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:46,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078771109] [2022-07-19 21:55:46,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:46,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:55:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:55:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:55:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 21:55:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 21:55:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 21:55:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-07-19 21:55:46,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:46,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078771109] [2022-07-19 21:55:46,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078771109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:46,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:55:46,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:55:46,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335056121] [2022-07-19 21:55:46,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:46,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:55:46,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:46,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:55:46,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:55:46,834 INFO L87 Difference]: Start difference. First operand 422 states and 603 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 4 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-19 21:55:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:47,527 INFO L93 Difference]: Finished difference Result 538 states and 762 transitions. [2022-07-19 21:55:47,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:55:47,528 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 4 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 147 [2022-07-19 21:55:47,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:47,529 INFO L225 Difference]: With dead ends: 538 [2022-07-19 21:55:47,529 INFO L226 Difference]: Without dead ends: 358 [2022-07-19 21:55:47,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-07-19 21:55:47,531 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 78 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:47,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 794 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 21:55:47,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-19 21:55:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 349. [2022-07-19 21:55:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 251 states have (on average 1.1274900398406376) internal successors, (283), 259 states have internal predecessors, (283), 69 states have call successors, (69), 23 states have call predecessors, (69), 28 states have return successors, (116), 66 states have call predecessors, (116), 68 states have call successors, (116) [2022-07-19 21:55:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 468 transitions. [2022-07-19 21:55:47,560 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 468 transitions. Word has length 147 [2022-07-19 21:55:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:47,561 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 468 transitions. [2022-07-19 21:55:47,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 4 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-19 21:55:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 468 transitions. [2022-07-19 21:55:47,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-19 21:55:47,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:47,563 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:47,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-19 21:55:47,564 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:47,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:47,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1614049972, now seen corresponding path program 1 times [2022-07-19 21:55:47,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:47,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183771401] [2022-07-19 21:55:47,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:47,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:55:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:55:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:55:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:55:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 21:55:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 21:55:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 21:55:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:47,934 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-07-19 21:55:47,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:47,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183771401] [2022-07-19 21:55:47,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183771401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:55:47,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7744779] [2022-07-19 21:55:47,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:47,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:47,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:55:47,940 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:55:47,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-19 21:55:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:48,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 2851 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-19 21:55:48,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:55:48,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 21:55:48,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 21:55:48,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-19 21:55:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 21:55:49,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:55:49,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7744779] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:55:49,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:55:49,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [12] total 25 [2022-07-19 21:55:49,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940651684] [2022-07-19 21:55:49,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:55:49,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 21:55:49,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:55:49,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 21:55:49,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2022-07-19 21:55:49,108 INFO L87 Difference]: Start difference. First operand 349 states and 468 transitions. Second operand has 15 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 6 states have call successors, (18), 3 states have call predecessors, (18), 6 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-07-19 21:55:49,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:55:49,424 INFO L93 Difference]: Finished difference Result 706 states and 1000 transitions. [2022-07-19 21:55:49,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 21:55:49,425 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 6 states have call successors, (18), 3 states have call predecessors, (18), 6 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 149 [2022-07-19 21:55:49,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:55:49,427 INFO L225 Difference]: With dead ends: 706 [2022-07-19 21:55:49,428 INFO L226 Difference]: Without dead ends: 470 [2022-07-19 21:55:49,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 160 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2022-07-19 21:55:49,430 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 86 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 3036 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 326 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:55:49,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 3036 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 238 Invalid, 0 Unknown, 326 Unchecked, 0.2s Time] [2022-07-19 21:55:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-07-19 21:55:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 359. [2022-07-19 21:55:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 261 states have (on average 1.1226053639846743) internal successors, (293), 268 states have internal predecessors, (293), 69 states have call successors, (69), 24 states have call predecessors, (69), 28 states have return successors, (115), 66 states have call predecessors, (115), 68 states have call successors, (115) [2022-07-19 21:55:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 477 transitions. [2022-07-19 21:55:49,463 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 477 transitions. Word has length 149 [2022-07-19 21:55:49,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:55:49,464 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 477 transitions. [2022-07-19 21:55:49,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 6 states have call successors, (18), 3 states have call predecessors, (18), 6 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-07-19 21:55:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 477 transitions. [2022-07-19 21:55:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-19 21:55:49,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:55:49,466 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:55:49,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-19 21:55:49,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:49,691 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:55:49,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:55:49,692 INFO L85 PathProgramCache]: Analyzing trace with hash -891040382, now seen corresponding path program 1 times [2022-07-19 21:55:49,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:55:49,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83525261] [2022-07-19 21:55:49,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:49,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:55:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:49,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:55:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:49,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:55:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:49,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:55:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:49,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:49,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:55:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:49,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:49,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:55:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:49,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:55:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:49,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:55:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:49,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:55:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:49,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 21:55:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:49,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 21:55:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:49,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 21:55:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:49,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 21:55:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:49,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 21:55:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:49,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:50,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:55:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:50,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 21:55:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-19 21:55:50,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:55:50,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83525261] [2022-07-19 21:55:50,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83525261] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:55:50,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984437845] [2022-07-19 21:55:50,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:55:50,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:55:50,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:55:50,084 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:55:50,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-19 21:55:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:55:50,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 2892 conjuncts, 113 conjunts are in the unsatisfiable core [2022-07-19 21:55:50,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:55:50,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 21:55:50,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 21:55:51,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2022-07-19 21:55:51,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:51,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-19 21:55:51,399 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-19 21:55:51,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 44 treesize of output 53 [2022-07-19 21:55:51,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:51,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-07-19 21:55:51,438 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-19 21:55:51,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 21:55:52,991 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.base_BEFORE_CALL_39| Int)) (and (or (let ((.cse0 (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.base_BEFORE_CALL_39|))) (and (not (= (mod (select .cse0 0) 18446744073709551616) 0)) (not (= (mod (select .cse0 16) 18446744073709551616) 0)))) (not (= (mod (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.base_BEFORE_CALL_25|) 16) 18446744073709551616) 0))) (not (= |v_ULTIMATE.start_aws_byte_buf_advance_harness_~#buf~3#1.base_BEFORE_CALL_39| |v_ULTIMATE.start_aws_byte_buf_advance_harness_~#output~0#1.base_BEFORE_CALL_25|)))) is different from true [2022-07-19 21:55:53,212 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-19 21:55:53,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 88 treesize of output 91 [2022-07-19 21:55:53,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:55:53,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-07-19 21:55:54,879 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_3| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_3| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_13|)) (or (not (= (mod (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_13|) 16) 18446744073709551616) 0)) (let ((.cse0 (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_3|))) (and (not (= (mod (select .cse0 0) 18446744073709551616) 0)) (not (= (mod (select .cse0 16) 18446744073709551616) 0))))))) is different from true [2022-07-19 21:55:56,559 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_4| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_14|)) (or (not (= (mod (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_14|) 16) 18446744073709551616) 0)) (let ((.cse0 (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_4|))) (and (not (= (mod (select .cse0 16) 18446744073709551616) 0)) (not (= (mod (select .cse0 0) 18446744073709551616) 0))))))) is different from true [2022-07-19 21:55:58,115 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_5| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_5| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_15|)) (or (not (= 0 (mod (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_15|) 16) 18446744073709551616))) (let ((.cse0 (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_5|))) (and (not (= (mod (select .cse0 0) 18446744073709551616) 0)) (not (= (mod (select .cse0 16) 18446744073709551616) 0))))))) is different from true [2022-07-19 21:56:01,882 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5059 (Array Int Int))) (= (store |c_old(#memory_int)| |c_memset_impl_#in~s.base| v_ArrVal_5059) |c_#memory_int|)) is different from true [2022-07-19 21:56:01,891 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5059 (Array Int Int))) (= (store |c_old(#memory_int)| |c_my_memset_#in~s.base| v_ArrVal_5059) |c_#memory_int|)) is different from true [2022-07-19 21:56:01,908 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 21:56:01,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-07-19 21:56:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 45 proven. 39 refuted. 8 times theorem prover too weak. 12 trivial. 54 not checked. [2022-07-19 21:56:02,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:56:02,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5065 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_advance_~output#1.base| v_ArrVal_5065) |c_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base|) |c_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.offset|) 18446744073709551616) 0))) is different from false [2022-07-19 21:56:02,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984437845] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:02,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 21:56:02,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 36] total 46 [2022-07-19 21:56:02,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096842917] [2022-07-19 21:56:02,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 21:56:02,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-19 21:56:02,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:02,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-19 21:56:02,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1844, Unknown=8, NotChecked=644, Total=2652 [2022-07-19 21:56:02,692 INFO L87 Difference]: Start difference. First operand 359 states and 477 transitions. Second operand has 46 states, 43 states have (on average 3.6511627906976742) internal successors, (157), 41 states have internal predecessors, (157), 14 states have call successors, (36), 12 states have call predecessors, (36), 13 states have return successors, (35), 13 states have call predecessors, (35), 14 states have call successors, (35) [2022-07-19 21:56:23,614 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5059 (Array Int Int))) (= (store |c_old(#memory_int)| |c_my_memset_#in~s.base| v_ArrVal_5059) |c_#memory_int|)) (not (= |c_my_memset_#in~n| 32))) is different from true [2022-07-19 21:56:25,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:25,865 INFO L93 Difference]: Finished difference Result 659 states and 935 transitions. [2022-07-19 21:56:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-19 21:56:25,866 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 3.6511627906976742) internal successors, (157), 41 states have internal predecessors, (157), 14 states have call successors, (36), 12 states have call predecessors, (36), 13 states have return successors, (35), 13 states have call predecessors, (35), 14 states have call successors, (35) Word has length 150 [2022-07-19 21:56:25,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:25,868 INFO L225 Difference]: With dead ends: 659 [2022-07-19 21:56:25,868 INFO L226 Difference]: Without dead ends: 538 [2022-07-19 21:56:25,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 160 SyntacticMatches, 12 SemanticMatches, 77 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1550 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=396, Invalid=4567, Unknown=39, NotChecked=1160, Total=6162 [2022-07-19 21:56:25,870 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 332 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 4364 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 8402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 4364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3716 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:25,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 2351 Invalid, 8402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 4364 Invalid, 0 Unknown, 3716 Unchecked, 3.3s Time] [2022-07-19 21:56:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-07-19 21:56:25,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 429. [2022-07-19 21:56:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 315 states have (on average 1.126984126984127) internal successors, (355), 324 states have internal predecessors, (355), 78 states have call successors, (78), 30 states have call predecessors, (78), 35 states have return successors, (135), 74 states have call predecessors, (135), 77 states have call successors, (135) [2022-07-19 21:56:25,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 568 transitions. [2022-07-19 21:56:25,907 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 568 transitions. Word has length 150 [2022-07-19 21:56:25,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:25,908 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 568 transitions. [2022-07-19 21:56:25,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 3.6511627906976742) internal successors, (157), 41 states have internal predecessors, (157), 14 states have call successors, (36), 12 states have call predecessors, (36), 13 states have return successors, (35), 13 states have call predecessors, (35), 14 states have call successors, (35) [2022-07-19 21:56:25,908 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 568 transitions. [2022-07-19 21:56:25,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-19 21:56:25,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:25,910 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2022-07-19 21:56:25,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-19 21:56:26,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:26,123 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:26,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:26,124 INFO L85 PathProgramCache]: Analyzing trace with hash -985042663, now seen corresponding path program 1 times [2022-07-19 21:56:26,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:26,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190643288] [2022-07-19 21:56:26,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:26,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:56:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:56:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:56:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:56:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 21:56:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 21:56:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 21:56:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 21:56:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 21:56:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 21:56:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 21:56:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 21:56:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-19 21:56:26,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:26,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190643288] [2022-07-19 21:56:26,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190643288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:56:26,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:56:26,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 21:56:26,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089180734] [2022-07-19 21:56:26,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:56:26,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:56:26,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:26,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:56:26,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:56:26,481 INFO L87 Difference]: Start difference. First operand 429 states and 568 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-19 21:56:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:27,085 INFO L93 Difference]: Finished difference Result 441 states and 580 transitions. [2022-07-19 21:56:27,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 21:56:27,086 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2022-07-19 21:56:27,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:27,088 INFO L225 Difference]: With dead ends: 441 [2022-07-19 21:56:27,088 INFO L226 Difference]: Without dead ends: 439 [2022-07-19 21:56:27,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:56:27,089 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 127 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:27,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 957 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 21:56:27,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-07-19 21:56:27,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 438. [2022-07-19 21:56:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 321 states have (on average 1.1246105919003115) internal successors, (361), 331 states have internal predecessors, (361), 79 states have call successors, (79), 31 states have call predecessors, (79), 37 states have return successors, (137), 75 states have call predecessors, (137), 78 states have call successors, (137) [2022-07-19 21:56:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 577 transitions. [2022-07-19 21:56:27,124 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 577 transitions. Word has length 152 [2022-07-19 21:56:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:27,125 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 577 transitions. [2022-07-19 21:56:27,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-19 21:56:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 577 transitions. [2022-07-19 21:56:27,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-19 21:56:27,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:27,127 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:56:27,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-19 21:56:27,127 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:27,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:27,128 INFO L85 PathProgramCache]: Analyzing trace with hash -72937408, now seen corresponding path program 2 times [2022-07-19 21:56:27,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:27,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446859183] [2022-07-19 21:56:27,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:27,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:56:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:56:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:56:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:56:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 21:56:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 21:56:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 21:56:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 21:56:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 21:56:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 21:56:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-19 21:56:27,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:27,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446859183] [2022-07-19 21:56:27,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446859183] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:27,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445821399] [2022-07-19 21:56:27,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:56:27,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:27,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:27,603 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:56:27,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-19 21:56:29,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:56:29,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:56:29,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 2911 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-19 21:56:29,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:56:29,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 21:56:29,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:56:29,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2022-07-19 21:56:29,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2022-07-19 21:56:29,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:56:29,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-07-19 21:56:29,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:56:29,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-07-19 21:56:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 118 proven. 18 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 21:56:29,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:56:31,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445821399] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:31,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 21:56:31,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2022-07-19 21:56:31,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105188463] [2022-07-19 21:56:31,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 21:56:31,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-19 21:56:31,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:31,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-19 21:56:31,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=959, Unknown=1, NotChecked=0, Total=1056 [2022-07-19 21:56:31,779 INFO L87 Difference]: Start difference. First operand 438 states and 577 transitions. Second operand has 27 states, 25 states have (on average 6.04) internal successors, (151), 24 states have internal predecessors, (151), 10 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-19 21:56:34,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:34,756 INFO L93 Difference]: Finished difference Result 764 states and 1055 transitions. [2022-07-19 21:56:34,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-19 21:56:34,756 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 6.04) internal successors, (151), 24 states have internal predecessors, (151), 10 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) Word has length 152 [2022-07-19 21:56:34,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:34,758 INFO L225 Difference]: With dead ends: 764 [2022-07-19 21:56:34,758 INFO L226 Difference]: Without dead ends: 562 [2022-07-19 21:56:34,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 240 SyntacticMatches, 10 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=328, Invalid=3093, Unknown=1, NotChecked=0, Total=3422 [2022-07-19 21:56:34,761 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 213 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 3412 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 4051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 3412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 516 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:34,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1695 Invalid, 4051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 3412 Invalid, 0 Unknown, 516 Unchecked, 2.2s Time] [2022-07-19 21:56:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-07-19 21:56:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 468. [2022-07-19 21:56:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 344 states have (on average 1.125) internal successors, (387), 353 states have internal predecessors, (387), 83 states have call successors, (83), 35 states have call predecessors, (83), 40 states have return successors, (143), 79 states have call predecessors, (143), 82 states have call successors, (143) [2022-07-19 21:56:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 613 transitions. [2022-07-19 21:56:34,801 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 613 transitions. Word has length 152 [2022-07-19 21:56:34,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:34,802 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 613 transitions. [2022-07-19 21:56:34,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 6.04) internal successors, (151), 24 states have internal predecessors, (151), 10 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-19 21:56:34,802 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 613 transitions. [2022-07-19 21:56:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-19 21:56:34,805 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:34,805 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:56:34,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-19 21:56:35,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:35,031 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:35,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:35,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1657527114, now seen corresponding path program 1 times [2022-07-19 21:56:35,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:35,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733553644] [2022-07-19 21:56:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:56:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:56:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:56:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:56:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 21:56:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:56:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 21:56:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 21:56:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 21:56:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-07-19 21:56:35,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:35,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733553644] [2022-07-19 21:56:35,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733553644] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:35,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151738634] [2022-07-19 21:56:35,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:35,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:35,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:35,472 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:56:35,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-19 21:56:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:36,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 2894 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-19 21:56:36,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:56:36,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 21:56:36,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 21:56:36,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-19 21:56:36,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-19 21:56:36,972 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-19 21:56:36,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 11 [2022-07-19 21:56:36,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-19 21:56:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-19 21:56:37,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:56:37,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151738634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:56:37,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:56:37,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [14] total 29 [2022-07-19 21:56:37,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510912030] [2022-07-19 21:56:37,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:56:37,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 21:56:37,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:37,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 21:56:37,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2022-07-19 21:56:37,005 INFO L87 Difference]: Start difference. First operand 468 states and 613 transitions. Second operand has 17 states, 16 states have (on average 5.375) internal successors, (86), 13 states have internal predecessors, (86), 6 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2022-07-19 21:56:37,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:37,214 INFO L93 Difference]: Finished difference Result 875 states and 1186 transitions. [2022-07-19 21:56:37,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 21:56:37,215 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.375) internal successors, (86), 13 states have internal predecessors, (86), 6 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) Word has length 153 [2022-07-19 21:56:37,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:37,218 INFO L225 Difference]: With dead ends: 875 [2022-07-19 21:56:37,219 INFO L226 Difference]: Without dead ends: 619 [2022-07-19 21:56:37,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 165 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2022-07-19 21:56:37,221 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 101 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 2049 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:37,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 2049 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 189 Unchecked, 0.1s Time] [2022-07-19 21:56:37,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-07-19 21:56:37,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 529. [2022-07-19 21:56:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 389 states have (on average 1.1182519280205656) internal successors, (435), 399 states have internal predecessors, (435), 90 states have call successors, (90), 43 states have call predecessors, (90), 49 states have return successors, (152), 86 states have call predecessors, (152), 89 states have call successors, (152) [2022-07-19 21:56:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 677 transitions. [2022-07-19 21:56:37,264 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 677 transitions. Word has length 153 [2022-07-19 21:56:37,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:37,265 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 677 transitions. [2022-07-19 21:56:37,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.375) internal successors, (86), 13 states have internal predecessors, (86), 6 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2022-07-19 21:56:37,265 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 677 transitions. [2022-07-19 21:56:37,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-19 21:56:37,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:37,267 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:56:37,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-19 21:56:37,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:37,483 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:37,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:37,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1748475022, now seen corresponding path program 1 times [2022-07-19 21:56:37,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:37,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397939596] [2022-07-19 21:56:37,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:37,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:56:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:56:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:56:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:56:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:56:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:56:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:56:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 21:56:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 21:56:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-07-19 21:56:37,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:37,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397939596] [2022-07-19 21:56:37,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397939596] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:37,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285753134] [2022-07-19 21:56:37,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:37,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:37,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:37,857 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:56:37,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-19 21:56:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:38,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 2896 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-19 21:56:38,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:56:38,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 21:56:38,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 21:56:38,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-19 21:56:38,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:56:38,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-19 21:56:39,550 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_25| Int)) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_25|) 16) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_10|) 16)) (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_25| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_10|)))) is different from true [2022-07-19 21:56:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 123 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 1 not checked. [2022-07-19 21:56:45,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:56:47,243 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5958 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_buf_advance_~output#1.base| v_ArrVal_5958) |c_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base|) (+ 16 |c_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.offset|)) 18446744073709551616) 0))) is different from false [2022-07-19 21:56:47,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285753134] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:47,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 21:56:47,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2022-07-19 21:56:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388354487] [2022-07-19 21:56:47,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 21:56:47,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-19 21:56:47,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:47,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-19 21:56:47,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=846, Unknown=3, NotChecked=118, Total=1056 [2022-07-19 21:56:47,246 INFO L87 Difference]: Start difference. First operand 529 states and 677 transitions. Second operand has 28 states, 25 states have (on average 5.6) internal successors, (140), 24 states have internal predecessors, (140), 9 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (33), 7 states have call predecessors, (33), 9 states have call successors, (33) [2022-07-19 21:56:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:53,126 INFO L93 Difference]: Finished difference Result 883 states and 1187 transitions. [2022-07-19 21:56:53,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-19 21:56:53,127 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 5.6) internal successors, (140), 24 states have internal predecessors, (140), 9 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (33), 7 states have call predecessors, (33), 9 states have call successors, (33) Word has length 157 [2022-07-19 21:56:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:53,130 INFO L225 Difference]: With dead ends: 883 [2022-07-19 21:56:53,130 INFO L226 Difference]: Without dead ends: 682 [2022-07-19 21:56:53,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 191 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=246, Invalid=2510, Unknown=8, NotChecked=206, Total=2970 [2022-07-19 21:56:53,131 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 216 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 3851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1178 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:53,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1953 Invalid, 3851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 2437 Invalid, 0 Unknown, 1178 Unchecked, 1.7s Time] [2022-07-19 21:56:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-07-19 21:56:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 590. [2022-07-19 21:56:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 441 states have (on average 1.1156462585034013) internal successors, (492), 451 states have internal predecessors, (492), 95 states have call successors, (95), 48 states have call predecessors, (95), 53 states have return successors, (161), 90 states have call predecessors, (161), 94 states have call successors, (161) [2022-07-19 21:56:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 748 transitions. [2022-07-19 21:56:53,180 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 748 transitions. Word has length 157 [2022-07-19 21:56:53,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:53,180 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 748 transitions. [2022-07-19 21:56:53,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 5.6) internal successors, (140), 24 states have internal predecessors, (140), 9 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (33), 7 states have call predecessors, (33), 9 states have call successors, (33) [2022-07-19 21:56:53,181 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 748 transitions. [2022-07-19 21:56:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-19 21:56:53,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:53,183 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:56:53,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-19 21:56:53,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:53,394 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:53,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:53,394 INFO L85 PathProgramCache]: Analyzing trace with hash -443112591, now seen corresponding path program 1 times [2022-07-19 21:56:53,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:53,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377138659] [2022-07-19 21:56:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:53,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:56:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:56:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:56:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:56:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 21:56:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 21:56:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 21:56:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 21:56:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 21:56:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 21:56:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 21:56:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-19 21:56:53,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:53,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377138659] [2022-07-19 21:56:53,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377138659] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:53,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383971173] [2022-07-19 21:56:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:53,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:53,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:53,843 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:56:53,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-19 21:56:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:54,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 3011 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 21:56:54,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:56:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-19 21:56:54,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:56:54,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383971173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:56:54,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:56:54,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-19 21:56:54,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671854726] [2022-07-19 21:56:54,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:56:54,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:56:54,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:54,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:56:54,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-19 21:56:54,575 INFO L87 Difference]: Start difference. First operand 590 states and 748 transitions. Second operand has 9 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-19 21:56:54,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:54,736 INFO L93 Difference]: Finished difference Result 907 states and 1157 transitions. [2022-07-19 21:56:54,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:56:54,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 159 [2022-07-19 21:56:54,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:54,739 INFO L225 Difference]: With dead ends: 907 [2022-07-19 21:56:54,739 INFO L226 Difference]: Without dead ends: 517 [2022-07-19 21:56:54,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-19 21:56:54,741 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 12 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:54,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1739 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 21:56:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-07-19 21:56:54,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2022-07-19 21:56:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 380 states have (on average 1.0973684210526315) internal successors, (417), 388 states have internal predecessors, (417), 90 states have call successors, (90), 43 states have call predecessors, (90), 46 states have return successors, (142), 85 states have call predecessors, (142), 89 states have call successors, (142) [2022-07-19 21:56:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 649 transitions. [2022-07-19 21:56:54,783 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 649 transitions. Word has length 159 [2022-07-19 21:56:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:54,783 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 649 transitions. [2022-07-19 21:56:54,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-19 21:56:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 649 transitions. [2022-07-19 21:56:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-19 21:56:54,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:54,786 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:56:54,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-19 21:56:54,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-19 21:56:54,999 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:54,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:54,999 INFO L85 PathProgramCache]: Analyzing trace with hash 138560413, now seen corresponding path program 1 times [2022-07-19 21:56:55,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:55,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250539050] [2022-07-19 21:56:55,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:55,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 21:56:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 21:56:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 21:56:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 21:56:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 21:56:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 21:56:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 21:56:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 21:56:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 21:56:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 21:56:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 21:56:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 28 proven. 24 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-19 21:56:55,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:55,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250539050] [2022-07-19 21:56:55,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250539050] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:55,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224511646] [2022-07-19 21:56:55,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:55,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:55,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:55,688 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:56:55,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-19 21:56:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:56,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 3022 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-19 21:56:56,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:56:56,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 21:56:56,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 21:56:57,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-19 21:56:57,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-19 21:56:57,292 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-19 21:56:57,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 11 [2022-07-19 21:56:57,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-19 21:56:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-19 21:56:57,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:56:57,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224511646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:56:57,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:56:57,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 32 [2022-07-19 21:56:57,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877451931] [2022-07-19 21:56:57,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:56:57,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 21:56:57,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:56:57,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 21:56:57,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2022-07-19 21:56:57,331 INFO L87 Difference]: Start difference. First operand 517 states and 649 transitions. Second operand has 17 states, 16 states have (on average 5.25) internal successors, (84), 13 states have internal predecessors, (84), 6 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-19 21:56:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 21:56:57,827 INFO L93 Difference]: Finished difference Result 852 states and 1121 transitions. [2022-07-19 21:56:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 21:56:57,827 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.25) internal successors, (84), 13 states have internal predecessors, (84), 6 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) Word has length 160 [2022-07-19 21:56:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 21:56:57,830 INFO L225 Difference]: With dead ends: 852 [2022-07-19 21:56:57,830 INFO L226 Difference]: Without dead ends: 598 [2022-07-19 21:56:57,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 178 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 21:56:57,832 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 79 mSDsluCounter, 2129 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 21:56:57,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 2477 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 273 Invalid, 0 Unknown, 272 Unchecked, 0.4s Time] [2022-07-19 21:56:57,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-07-19 21:56:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 522. [2022-07-19 21:56:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 376 states have (on average 1.0930851063829787) internal successors, (411), 386 states have internal predecessors, (411), 94 states have call successors, (94), 46 states have call predecessors, (94), 51 states have return successors, (144), 89 states have call predecessors, (144), 93 states have call successors, (144) [2022-07-19 21:56:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 649 transitions. [2022-07-19 21:56:57,901 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 649 transitions. Word has length 160 [2022-07-19 21:56:57,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 21:56:57,901 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 649 transitions. [2022-07-19 21:56:57,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.25) internal successors, (84), 13 states have internal predecessors, (84), 6 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-19 21:56:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 649 transitions. [2022-07-19 21:56:57,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-19 21:56:57,904 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 21:56:57,904 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:56:57,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-19 21:56:58,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-19 21:56:58,119 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 21:56:58,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:56:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1595947110, now seen corresponding path program 1 times [2022-07-19 21:56:58,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:56:58,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994138926] [2022-07-19 21:56:58,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:58,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:56:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 21:56:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 21:56:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 21:56:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 21:56:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 21:56:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 21:56:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 21:56:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 21:56:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 21:56:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 21:56:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 21:56:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 21:56:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 21:56:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 21:56:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 21:56:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 21:56:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:56:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 56 proven. 39 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-19 21:56:59,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:56:59,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994138926] [2022-07-19 21:56:59,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994138926] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:56:59,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102282611] [2022-07-19 21:56:59,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:56:59,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:56:59,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:56:59,824 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:56:59,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-19 21:57:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:57:00,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 3008 conjuncts, 132 conjunts are in the unsatisfiable core [2022-07-19 21:57:00,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:57:00,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 21:57:00,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 21:57:00,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-19 21:57:00,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:57:00,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-19 21:57:01,621 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_28| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_14|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_28|) 16) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_14|) 16)))) is different from true [2022-07-19 21:57:02,516 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_29|) 16) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_15|) 16)) (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_29| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_15|)))) is different from true [2022-07-19 21:57:03,353 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_30| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_16| Int)) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_30|) 16) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_16|) 16)) (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_30| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_16|)))) is different from true [2022-07-19 21:57:19,994 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_31| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_31|) 16))) (and (= .cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_17|) 16)) (not (= (mod .cse0 18446744073709551616) 0)) (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_31| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_17|))))) is different from true [2022-07-19 21:57:21,143 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_18| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_32| Int)) (let ((.cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_32|) 16))) (and (= .cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_18|) 16)) (not (= (mod .cse0 18446744073709551616) 0)) (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_32| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_18|))))) is different from true [2022-07-19 21:57:21,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:57:21,291 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-19 21:57:21,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 41 [2022-07-19 21:57:21,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 21:57:21,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 21:57:21,309 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-07-19 21:57:22,520 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_33| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_33| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_19|)) (or (let ((.cse0 (* (- 1) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~buffer#1.base_BEFORE_CALL_19|) 16)))) (< (div (+ 18446744073709551615 .cse0) (- 18446744073709551616)) (div .cse0 (- 18446744073709551616)))) (not (= (mod (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_buf_advance_~output#1.base_BEFORE_CALL_33|) 16) 18446744073709551616) 0))))) is different from true [2022-07-19 21:57:34,198 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-07-19 21:57:34,207 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-07-19 21:57:34,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:57:34,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 162 treesize of output 148 [2022-07-19 21:57:34,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:57:34,267 INFO L356 Elim1Store]: treesize reduction 26, result has 52.7 percent of original size [2022-07-19 21:57:34,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 177 [2022-07-19 21:57:34,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:57:34,313 INFO L356 Elim1Store]: treesize reduction 26, result has 52.7 percent of original size [2022-07-19 21:57:34,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 194 treesize of output 206 [2022-07-19 21:57:34,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 200 [2022-07-19 21:57:34,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 194 [2022-07-19 21:57:34,327 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 21:57:34,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-19 21:57:34,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-19 21:57:34,540 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-19 21:57:34,542 INFO L158 Benchmark]: Toolchain (without parser) took 170559.43ms. Allocated memory was 90.2MB in the beginning and 721.4MB in the end (delta: 631.2MB). Free memory was 63.6MB in the beginning and 451.0MB in the end (delta: -387.3MB). Peak memory consumption was 245.0MB. Max. memory is 16.1GB. [2022-07-19 21:57:34,542 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 90.2MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 21:57:34,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1974.78ms. Allocated memory was 90.2MB in the beginning and 169.9MB in the end (delta: 79.7MB). Free memory was 63.6MB in the beginning and 105.9MB in the end (delta: -42.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2022-07-19 21:57:34,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 201.94ms. Allocated memory is still 169.9MB. Free memory was 105.9MB in the beginning and 93.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 21:57:34,543 INFO L158 Benchmark]: Boogie Preprocessor took 119.81ms. Allocated memory is still 169.9MB. Free memory was 93.3MB in the beginning and 85.8MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 21:57:34,543 INFO L158 Benchmark]: RCFGBuilder took 1397.10ms. Allocated memory is still 169.9MB. Free memory was 85.8MB in the beginning and 103.8MB in the end (delta: -17.9MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2022-07-19 21:57:34,543 INFO L158 Benchmark]: TraceAbstraction took 166861.02ms. Allocated memory was 169.9MB in the beginning and 721.4MB in the end (delta: 551.6MB). Free memory was 102.7MB in the beginning and 451.0MB in the end (delta: -348.2MB). Peak memory consumption was 204.4MB. Max. memory is 16.1GB. [2022-07-19 21:57:34,544 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 90.2MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1974.78ms. Allocated memory was 90.2MB in the beginning and 169.9MB in the end (delta: 79.7MB). Free memory was 63.6MB in the beginning and 105.9MB in the end (delta: -42.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 201.94ms. Allocated memory is still 169.9MB. Free memory was 105.9MB in the beginning and 93.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.81ms. Allocated memory is still 169.9MB. Free memory was 93.3MB in the beginning and 85.8MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1397.10ms. Allocated memory is still 169.9MB. Free memory was 85.8MB in the beginning and 103.8MB in the end (delta: -17.9MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * TraceAbstraction took 166861.02ms. Allocated memory was 169.9MB in the beginning and 721.4MB in the end (delta: 551.6MB). Free memory was 102.7MB in the beginning and 451.0MB in the end (delta: -348.2MB). Peak memory consumption was 204.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-19 21:57:34,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_buf_advance_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 9a96b91703f0cc76adc9b0fdbd8386a96920c1be21a810b6415a59c2166f1461 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:57:36,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:57:36,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:57:36,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:57:36,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:57:36,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:57:36,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:57:36,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:57:36,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:57:36,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:57:36,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:57:36,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:57:36,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:57:36,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:57:36,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:57:36,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:57:36,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:57:36,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:57:36,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:57:36,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:57:36,561 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:57:36,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:57:36,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:57:36,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:57:36,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:57:36,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:57:36,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:57:36,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:57:36,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:57:36,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:57:36,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:57:36,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:57:36,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:57:36,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:57:36,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:57:36,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:57:36,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:57:36,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:57:36,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:57:36,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:57:36,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:57:36,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:57:36,590 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-19 21:57:36,610 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:57:36,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:57:36,612 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:57:36,612 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:57:36,612 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:57:36,613 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:57:36,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:57:36,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:57:36,613 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:57:36,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:57:36,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:57:36,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:57:36,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:57:36,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:57:36,614 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 21:57:36,614 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 21:57:36,615 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 21:57:36,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:57:36,615 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:57:36,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:57:36,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:57:36,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:57:36,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:57:36,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:57:36,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:57:36,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:57:36,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:57:36,617 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 21:57:36,617 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 21:57:36,617 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:57:36,617 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:57:36,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:57:36,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 21:57:36,618 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 9a96b91703f0cc76adc9b0fdbd8386a96920c1be21a810b6415a59c2166f1461 [2022-07-19 21:57:36,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:57:36,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:57:36,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:57:36,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:57:36,964 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:57:36,965 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i [2022-07-19 21:57:37,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb349f6c/11d1d1d6bb644996902c21644198cb79/FLAG59053b086 [2022-07-19 21:57:37,801 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:57:37,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i [2022-07-19 21:57:37,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb349f6c/11d1d1d6bb644996902c21644198cb79/FLAG59053b086 [2022-07-19 21:57:38,035 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb349f6c/11d1d1d6bb644996902c21644198cb79 [2022-07-19 21:57:38,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:57:38,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:57:38,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:57:38,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:57:38,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:57:38,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:57:38" (1/1) ... [2022-07-19 21:57:38,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b97ccae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:57:38, skipping insertion in model container [2022-07-19 21:57:38,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:57:38" (1/1) ... [2022-07-19 21:57:38,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:57:38,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:57:38,395 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_buf_advance_harness.i[4494,4507] [2022-07-19 21:57:38,403 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_buf_advance_harness.i[4554,4567] [2022-07-19 21:57:39,495 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:39,496 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:39,496 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:39,497 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:39,498 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:39,507 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:39,509 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:39,511 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:39,512 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 21:57:39,813 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 21:57:39,814 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 21:57:39,815 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 21:57:39,816 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 21:57:39,817 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 21:57:39,817 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 21:57:39,818 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 21:57:39,818 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 21:57:39,819 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 21:57:39,819 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 21:57:39,920 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 21:57:39,931 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of int range at java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1009) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1384) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:249) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.translateInitializer(CHandler.java:2978) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleIASTDeclarator(CHandler.java:2836) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2138) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:143) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:211) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-19 21:57:39,935 INFO L158 Benchmark]: Toolchain (without parser) took 1895.63ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 26.4MB in the beginning and 39.3MB in the end (delta: -12.9MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2022-07-19 21:57:39,936 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 56.6MB. Free memory was 38.9MB in the beginning and 38.8MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 21:57:39,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1892.48ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 26.2MB in the beginning and 39.3MB in the end (delta: -13.0MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2022-07-19 21:57:39,939 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 56.6MB. Free memory was 38.9MB in the beginning and 38.8MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1892.48ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 26.2MB in the beginning and 39.3MB in the end (delta: -13.0MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of int range: java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range