./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_ignore_case_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_ignore_case_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 37f6b0c93ef236fcd62a86dc508823d298ec7578e65cd9cab79b0e3659914d7a --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:01:27,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:01:27,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:01:27,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:01:27,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:01:27,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:01:27,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:01:27,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:01:27,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:01:27,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:01:27,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:01:27,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:01:27,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:01:27,198 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:01:27,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:01:27,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:01:27,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:01:27,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:01:27,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:01:27,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:01:27,210 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:01:27,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:01:27,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:01:27,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:01:27,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:01:27,220 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:01:27,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:01:27,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:01:27,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:01:27,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:01:27,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:01:27,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:01:27,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:01:27,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:01:27,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:01:27,227 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:01:27,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:01:27,228 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:01:27,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:01:27,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:01:27,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:01:27,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:01:27,233 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:01:27,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:01:27,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:01:27,257 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:01:27,257 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:01:27,258 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:01:27,258 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:01:27,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:01:27,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:01:27,259 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:01:27,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:01:27,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:01:27,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:01:27,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:01:27,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:01:27,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:01:27,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:01:27,261 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:01:27,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:01:27,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:01:27,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:01:27,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:01:27,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:01:27,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:01:27,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:01:27,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:01:27,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:01:27,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:01:27,263 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:01:27,263 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:01:27,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:01:27,264 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 -> 37f6b0c93ef236fcd62a86dc508823d298ec7578e65cd9cab79b0e3659914d7a [2022-07-12 11:01:27,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:01:27,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:01:27,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:01:27,496 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:01:27,497 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:01:27,498 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_ignore_case_harness.i [2022-07-12 11:01:27,562 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b3faf36e/a611590541ab47db92794788521e27b7/FLAG5ccdd1765 [2022-07-12 11:01:28,214 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:01:28,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_ignore_case_harness.i [2022-07-12 11:01:28,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b3faf36e/a611590541ab47db92794788521e27b7/FLAG5ccdd1765 [2022-07-12 11:01:28,598 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b3faf36e/a611590541ab47db92794788521e27b7 [2022-07-12 11:01:28,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:01:28,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:01:28,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:01:28,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:01:28,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:01:28,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:01:28" (1/1) ... [2022-07-12 11:01:28,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d72a5aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:28, skipping insertion in model container [2022-07-12 11:01:28,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:01:28" (1/1) ... [2022-07-12 11:01:28,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:01:28,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:01:28,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_ignore_case_harness.i[4504,4517] [2022-07-12 11:01:28,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_ignore_case_harness.i[4564,4577] [2022-07-12 11:01:29,383 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:29,385 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:29,385 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:29,386 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:29,388 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:29,395 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:29,401 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:29,403 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:29,404 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:29,602 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:01:29,602 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:01:29,603 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:01:29,604 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:01:29,604 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:01:29,605 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:01:29,605 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:01:29,605 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:01:29,606 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:01:29,606 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:01:29,786 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:01:29,923 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:29,924 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:29,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:01:29,989 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:01:29,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_ignore_case_harness.i[4504,4517] [2022-07-12 11:01:29,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_ignore_case_harness.i[4564,4577] [2022-07-12 11:01:30,010 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:30,011 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:30,011 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:30,011 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:30,011 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:30,033 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:30,045 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:30,046 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:30,046 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:30,075 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:01:30,076 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:01:30,076 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:01:30,077 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:01:30,077 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:01:30,077 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:01:30,078 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:01:30,078 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:01:30,078 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:01:30,078 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:01:30,088 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:01:30,113 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:30,113 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:30,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:01:30,299 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:01:30,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:30 WrapperNode [2022-07-12 11:01:30,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:01:30,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:01:30,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:01:30,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:01:30,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:30" (1/1) ... [2022-07-12 11:01:30,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:30" (1/1) ... [2022-07-12 11:01:30,423 INFO L137 Inliner]: procedures = 691, calls = 2645, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 848 [2022-07-12 11:01:30,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:01:30,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:01:30,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:01:30,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:01:30,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:30" (1/1) ... [2022-07-12 11:01:30,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:30" (1/1) ... [2022-07-12 11:01:30,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:30" (1/1) ... [2022-07-12 11:01:30,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:30" (1/1) ... [2022-07-12 11:01:30,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:30" (1/1) ... [2022-07-12 11:01:30,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:30" (1/1) ... [2022-07-12 11:01:30,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:30" (1/1) ... [2022-07-12 11:01:30,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:01:30,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:01:30,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:01:30,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:01:30,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:30" (1/1) ... [2022-07-12 11:01:30,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:01:30,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:30,524 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-12 11:01:30,582 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-12 11:01:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-12 11:01:30,605 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-12 11:01:30,605 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_ignore_case [2022-07-12 11:01:30,606 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_ignore_case [2022-07-12 11:01:30,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:01:30,606 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 11:01:30,606 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 11:01:30,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:01:30,607 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_bounded [2022-07-12 11:01:30,607 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_bounded [2022-07-12 11:01:30,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:01:30,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:01:30,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:01:30,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:01:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2022-07-12 11:01:30,609 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2022-07-12 11:01:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:01:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:01:30,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:01:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 11:01:30,610 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 11:01:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-12 11:01:30,610 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-12 11:01:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:01:30,610 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:01:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:01:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:01:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:01:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:01:30,612 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-07-12 11:01:30,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-07-12 11:01:30,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:01:30,852 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:01:30,853 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:01:31,462 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:01:31,469 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:01:31,469 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 11:01:31,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:01:31 BoogieIcfgContainer [2022-07-12 11:01:31,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:01:31,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:01:31,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:01:31,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:01:31,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:01:28" (1/3) ... [2022-07-12 11:01:31,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d348a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:01:31, skipping insertion in model container [2022-07-12 11:01:31,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:30" (2/3) ... [2022-07-12 11:01:31,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d348a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:01:31, skipping insertion in model container [2022-07-12 11:01:31,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:01:31" (3/3) ... [2022-07-12 11:01:31,477 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_eq_ignore_case_harness.i [2022-07-12 11:01:31,488 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:01:31,489 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:01:31,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:01:31,545 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@c6ec0fc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2a5589c7 [2022-07-12 11:01:31,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:01:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-07-12 11:01:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 11:01:31,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:31,562 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:31,562 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash -507731001, now seen corresponding path program 1 times [2022-07-12 11:01:31,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:31,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752853621] [2022-07-12 11:01:31,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:31,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:01:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:01:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:01:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:01:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:01:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:01:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:01:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:01:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:01:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:01:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-12 11:01:32,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:32,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752853621] [2022-07-12 11:01:32,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752853621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:32,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:32,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:01:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220081654] [2022-07-12 11:01:32,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:32,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:01:32,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:32,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:01:32,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:01:32,282 INFO L87 Difference]: Start difference. First operand has 124 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 11:01:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:32,536 INFO L93 Difference]: Finished difference Result 247 states and 356 transitions. [2022-07-12 11:01:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:01:32,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 102 [2022-07-12 11:01:32,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:32,544 INFO L225 Difference]: With dead ends: 247 [2022-07-12 11:01:32,545 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 11:01:32,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:01:32,549 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 106 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:32,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 176 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:01:32,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 11:01:32,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2022-07-12 11:01:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 72 states have internal predecessors, (86), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-12 11:01:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 157 transitions. [2022-07-12 11:01:32,581 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 157 transitions. Word has length 102 [2022-07-12 11:01:32,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:32,581 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 157 transitions. [2022-07-12 11:01:32,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 11:01:32,581 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 157 transitions. [2022-07-12 11:01:32,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 11:01:32,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:32,584 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:32,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:01:32,584 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:32,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:32,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1146447743, now seen corresponding path program 1 times [2022-07-12 11:01:32,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:32,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857315580] [2022-07-12 11:01:32,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:32,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:01:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:01:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:01:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:01:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:01:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:01:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:01:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:01:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:01:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:01:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-12 11:01:32,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:32,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857315580] [2022-07-12 11:01:32,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857315580] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:32,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627672246] [2022-07-12 11:01:32,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:32,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:32,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:32,935 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-12 11:01:32,963 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-12 11:01:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 2662 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 11:01:33,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-12 11:01:33,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:33,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627672246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:33,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:33,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-12 11:01:33,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232074755] [2022-07-12 11:01:33,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:33,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:01:33,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:33,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:01:33,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:01:33,436 INFO L87 Difference]: Start difference. First operand 118 states and 157 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 11:01:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:33,574 INFO L93 Difference]: Finished difference Result 232 states and 313 transitions. [2022-07-12 11:01:33,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:01:33,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 102 [2022-07-12 11:01:33,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:33,576 INFO L225 Difference]: With dead ends: 232 [2022-07-12 11:01:33,576 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 11:01:33,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:01:33,578 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 168 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:33,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 319 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:01:33,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 11:01:33,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-12 11:01:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 75 states have internal predecessors, (88), 36 states have call successors, (36), 10 states have call predecessors, (36), 11 states have return successors, (41), 35 states have call predecessors, (41), 35 states have call successors, (41) [2022-07-12 11:01:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 165 transitions. [2022-07-12 11:01:33,589 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 165 transitions. Word has length 102 [2022-07-12 11:01:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:33,590 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 165 transitions. [2022-07-12 11:01:33,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 11:01:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 165 transitions. [2022-07-12 11:01:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 11:01:33,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:33,592 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:33,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:33,813 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-12 11:01:33,813 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:33,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1566881444, now seen corresponding path program 1 times [2022-07-12 11:01:33,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:33,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335061601] [2022-07-12 11:01:33,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:33,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:33,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:01:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:01:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:01:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:01:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:01:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:01:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-12 11:01:34,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:34,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335061601] [2022-07-12 11:01:34,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335061601] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:34,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250315193] [2022-07-12 11:01:34,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:34,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:34,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:34,128 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-12 11:01:34,129 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-12 11:01:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:34,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 2667 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 11:01:34,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-12 11:01:34,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:34,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250315193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:34,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:34,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-12 11:01:34,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495935834] [2022-07-12 11:01:34,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:34,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:01:34,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:34,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:01:34,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:01:34,631 INFO L87 Difference]: Start difference. First operand 121 states and 165 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-12 11:01:34,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:34,857 INFO L93 Difference]: Finished difference Result 192 states and 262 transitions. [2022-07-12 11:01:34,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:01:34,857 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 104 [2022-07-12 11:01:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:34,859 INFO L225 Difference]: With dead ends: 192 [2022-07-12 11:01:34,859 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 11:01:34,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2022-07-12 11:01:34,860 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 180 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:34,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 414 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:01:34,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 11:01:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-12 11:01:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 75 states have internal predecessors, (88), 36 states have call successors, (36), 10 states have call predecessors, (36), 11 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2022-07-12 11:01:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 163 transitions. [2022-07-12 11:01:34,875 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 163 transitions. Word has length 104 [2022-07-12 11:01:34,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:34,875 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 163 transitions. [2022-07-12 11:01:34,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-12 11:01:34,876 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 163 transitions. [2022-07-12 11:01:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 11:01:34,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:34,881 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:34,933 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-12 11:01:35,101 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-12 11:01:35,102 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:35,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1013762770, now seen corresponding path program 2 times [2022-07-12 11:01:35,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:35,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833627690] [2022-07-12 11:01:35,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:35,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:01:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:01:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:01:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:01:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:01:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:01:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 11:01:35,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:35,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833627690] [2022-07-12 11:01:35,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833627690] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:35,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450200577] [2022-07-12 11:01:35,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:01:35,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:35,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:35,546 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-12 11:01:35,548 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-12 11:01:35,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 11:01:35,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:01:35,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 2314 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 11:01:35,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-12 11:01:36,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:36,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450200577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:36,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:36,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-07-12 11:01:36,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359332902] [2022-07-12 11:01:36,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:36,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:01:36,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:36,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:01:36,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:01:36,025 INFO L87 Difference]: Start difference. First operand 121 states and 163 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-12 11:01:36,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:36,133 INFO L93 Difference]: Finished difference Result 133 states and 182 transitions. [2022-07-12 11:01:36,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:01:36,133 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2022-07-12 11:01:36,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:36,135 INFO L225 Difference]: With dead ends: 133 [2022-07-12 11:01:36,135 INFO L226 Difference]: Without dead ends: 131 [2022-07-12 11:01:36,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:01:36,136 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 16 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:36,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1070 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:01:36,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-12 11:01:36,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2022-07-12 11:01:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 37 states have call successors, (37), 11 states have call predecessors, (37), 13 states have return successors, (48), 36 states have call predecessors, (48), 36 states have call successors, (48) [2022-07-12 11:01:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2022-07-12 11:01:36,173 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 108 [2022-07-12 11:01:36,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:36,174 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2022-07-12 11:01:36,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-12 11:01:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2022-07-12 11:01:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 11:01:36,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:36,176 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:36,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:36,376 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-12 11:01:36,376 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:36,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:36,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1839411574, now seen corresponding path program 1 times [2022-07-12 11:01:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:36,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386652187] [2022-07-12 11:01:36,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:36,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:01:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:01:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:01:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:01:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:01:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:01:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 11:01:36,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:36,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386652187] [2022-07-12 11:01:36,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386652187] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:36,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899418780] [2022-07-12 11:01:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:36,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:36,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:36,697 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-12 11:01:36,719 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-12 11:01:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 2689 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 11:01:37,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 11:01:37,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:37,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899418780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:37,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:37,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-12 11:01:37,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192397558] [2022-07-12 11:01:37,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:37,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:01:37,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:37,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:01:37,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:01:37,184 INFO L87 Difference]: Start difference. First operand 130 states and 179 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-12 11:01:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:37,338 INFO L93 Difference]: Finished difference Result 225 states and 309 transitions. [2022-07-12 11:01:37,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:01:37,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 112 [2022-07-12 11:01:37,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:37,340 INFO L225 Difference]: With dead ends: 225 [2022-07-12 11:01:37,340 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 11:01:37,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:01:37,341 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 179 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:37,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 414 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:01:37,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 11:01:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-07-12 11:01:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 79 states have internal predecessors, (91), 37 states have call successors, (37), 11 states have call predecessors, (37), 12 states have return successors, (44), 36 states have call predecessors, (44), 36 states have call successors, (44) [2022-07-12 11:01:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 172 transitions. [2022-07-12 11:01:37,350 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 172 transitions. Word has length 112 [2022-07-12 11:01:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:37,350 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 172 transitions. [2022-07-12 11:01:37,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-12 11:01:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 172 transitions. [2022-07-12 11:01:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 11:01:37,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:37,357 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:37,396 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-12 11:01:37,579 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-12 11:01:37,579 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:37,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:37,580 INFO L85 PathProgramCache]: Analyzing trace with hash 698694363, now seen corresponding path program 1 times [2022-07-12 11:01:37,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:37,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271061339] [2022-07-12 11:01:37,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:37,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:37,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:38,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:38,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:01:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:38,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:01:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:38,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:01:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:38,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:01:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:38,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:01:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:38,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:38,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:38,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:01:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-12 11:01:38,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:38,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271061339] [2022-07-12 11:01:38,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271061339] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:38,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398637994] [2022-07-12 11:01:38,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:38,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:38,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:38,230 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-12 11:01:38,259 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-12 11:01:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:38,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 2694 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-12 11:01:38,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:38,673 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-12 11:01:38,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:01:38,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2022-07-12 11:01:41,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2022-07-12 11:01:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 46 proven. 36 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 11:01:41,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:49,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398637994] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:49,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:01:49,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 24 [2022-07-12 11:01:49,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727185257] [2022-07-12 11:01:49,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:49,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 11:01:49,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:49,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 11:01:49,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=769, Unknown=4, NotChecked=0, Total=870 [2022-07-12 11:01:49,187 INFO L87 Difference]: Start difference. First operand 127 states and 172 transitions. Second operand has 24 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 13 states have call successors, (34), 7 states have call predecessors, (34), 8 states have return successors, (33), 10 states have call predecessors, (33), 13 states have call successors, (33) [2022-07-12 11:01:52,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:52,052 INFO L93 Difference]: Finished difference Result 297 states and 422 transitions. [2022-07-12 11:01:52,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 11:01:52,053 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 13 states have call successors, (34), 7 states have call predecessors, (34), 8 states have return successors, (33), 10 states have call predecessors, (33), 13 states have call successors, (33) Word has length 114 [2022-07-12 11:01:52,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:52,056 INFO L225 Difference]: With dead ends: 297 [2022-07-12 11:01:52,056 INFO L226 Difference]: Without dead ends: 240 [2022-07-12 11:01:52,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 197 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=303, Invalid=1940, Unknown=13, NotChecked=0, Total=2256 [2022-07-12 11:01:52,057 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 259 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 2116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:52,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 592 Invalid, 2116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1528 Invalid, 0 Unknown, 428 Unchecked, 1.2s Time] [2022-07-12 11:01:52,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-07-12 11:01:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 177. [2022-07-12 11:01:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 109 states have (on average 1.18348623853211) internal successors, (129), 113 states have internal predecessors, (129), 49 states have call successors, (49), 15 states have call predecessors, (49), 18 states have return successors, (62), 48 states have call predecessors, (62), 48 states have call successors, (62) [2022-07-12 11:01:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 240 transitions. [2022-07-12 11:01:52,099 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 240 transitions. Word has length 114 [2022-07-12 11:01:52,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:52,099 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 240 transitions. [2022-07-12 11:01:52,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 4.285714285714286) internal successors, (90), 21 states have internal predecessors, (90), 13 states have call successors, (34), 7 states have call predecessors, (34), 8 states have return successors, (33), 10 states have call predecessors, (33), 13 states have call successors, (33) [2022-07-12 11:01:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 240 transitions. [2022-07-12 11:01:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-12 11:01:52,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:52,108 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:52,130 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-12 11:01:52,329 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-12 11:01:52,330 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:52,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:52,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1771853040, now seen corresponding path program 1 times [2022-07-12 11:01:52,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:52,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660617279] [2022-07-12 11:01:52,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:52,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:01:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:01:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:01:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:01:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:01:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 11:01:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:01:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-12 11:01:52,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:52,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660617279] [2022-07-12 11:01:52,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660617279] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:52,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60333159] [2022-07-12 11:01:52,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:52,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:52,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:52,876 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-12 11:01:52,904 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-12 11:01:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:53,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 2751 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:01:53,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-12 11:01:53,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:53,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60333159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:53,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:53,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 21 [2022-07-12 11:01:53,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266624685] [2022-07-12 11:01:53,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:53,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:01:53,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:53,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:01:53,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:01:53,374 INFO L87 Difference]: Start difference. First operand 177 states and 240 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 11:01:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:53,504 INFO L93 Difference]: Finished difference Result 268 states and 366 transitions. [2022-07-12 11:01:53,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:01:53,504 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 125 [2022-07-12 11:01:53,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:53,506 INFO L225 Difference]: With dead ends: 268 [2022-07-12 11:01:53,506 INFO L226 Difference]: Without dead ends: 187 [2022-07-12 11:01:53,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2022-07-12 11:01:53,507 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 12 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1165 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-12 11:01:53,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1165 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:01:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-12 11:01:53,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-12 11:01:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 117 states have (on average 1.170940170940171) internal successors, (137), 123 states have internal predecessors, (137), 49 states have call successors, (49), 15 states have call predecessors, (49), 20 states have return successors, (70), 48 states have call predecessors, (70), 48 states have call successors, (70) [2022-07-12 11:01:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 256 transitions. [2022-07-12 11:01:53,539 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 256 transitions. Word has length 125 [2022-07-12 11:01:53,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:53,539 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 256 transitions. [2022-07-12 11:01:53,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 11:01:53,539 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 256 transitions. [2022-07-12 11:01:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-12 11:01:53,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:53,541 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:53,565 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-12 11:01:53,762 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-12 11:01:53,763 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:53,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:53,763 INFO L85 PathProgramCache]: Analyzing trace with hash 70600304, now seen corresponding path program 2 times [2022-07-12 11:01:53,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:53,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119936586] [2022-07-12 11:01:53,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:53,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:01:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:01:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:01:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:01:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:01:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 11:01:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:01:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-12 11:01:54,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:54,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119936586] [2022-07-12 11:01:54,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119936586] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:54,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934925787] [2022-07-12 11:01:54,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:01:54,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:54,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:54,396 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-12 11:01:54,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 11:01:55,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:01:55,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:01:55,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 2751 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:01:55,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:01:55,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:55,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934925787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:55,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:55,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [20] total 27 [2022-07-12 11:01:55,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432410803] [2022-07-12 11:01:55,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:55,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:01:55,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:55,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:01:55,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2022-07-12 11:01:55,397 INFO L87 Difference]: Start difference. First operand 187 states and 256 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 11:01:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:55,562 INFO L93 Difference]: Finished difference Result 301 states and 405 transitions. [2022-07-12 11:01:55,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:01:55,562 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 125 [2022-07-12 11:01:55,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:55,563 INFO L225 Difference]: With dead ends: 301 [2022-07-12 11:01:55,563 INFO L226 Difference]: Without dead ends: 182 [2022-07-12 11:01:55,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2022-07-12 11:01:55,566 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 12 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:55,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1158 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:01:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-12 11:01:55,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-07-12 11:01:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 113 states have (on average 1.168141592920354) internal successors, (132), 118 states have internal predecessors, (132), 49 states have call successors, (49), 15 states have call predecessors, (49), 19 states have return successors, (68), 48 states have call predecessors, (68), 48 states have call successors, (68) [2022-07-12 11:01:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 249 transitions. [2022-07-12 11:01:55,579 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 249 transitions. Word has length 125 [2022-07-12 11:01:55,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:55,579 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 249 transitions. [2022-07-12 11:01:55,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 11:01:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 249 transitions. [2022-07-12 11:01:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-12 11:01:55,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:55,581 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:55,603 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-12 11:01:55,792 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-12 11:01:55,792 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:55,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:55,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2123527374, now seen corresponding path program 1 times [2022-07-12 11:01:55,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:55,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694732606] [2022-07-12 11:01:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:55,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:55,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:55,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:01:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:01:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:01:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:01:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:01:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:01:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-12 11:01:56,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:56,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694732606] [2022-07-12 11:01:56,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694732606] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:56,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752137118] [2022-07-12 11:01:56,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:56,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:56,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:56,204 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-12 11:01:56,205 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-12 11:01:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:56,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 2706 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-12 11:01:56,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:56,596 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-12 11:01:56,812 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 11:01:56,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2022-07-12 11:01:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 56 proven. 16 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 11:01:58,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:07,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752137118] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:07,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:02:07,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 25 [2022-07-12 11:02:07,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926244237] [2022-07-12 11:02:07,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:07,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 11:02:07,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:07,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 11:02:07,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=746, Unknown=5, NotChecked=0, Total=870 [2022-07-12 11:02:07,936 INFO L87 Difference]: Start difference. First operand 182 states and 249 transitions. Second operand has 25 states, 23 states have (on average 4.304347826086956) internal successors, (99), 22 states have internal predecessors, (99), 10 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (33), 9 states have call predecessors, (33), 9 states have call successors, (33) [2022-07-12 11:02:11,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:11,918 INFO L93 Difference]: Finished difference Result 368 states and 489 transitions. [2022-07-12 11:02:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 11:02:11,919 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.304347826086956) internal successors, (99), 22 states have internal predecessors, (99), 10 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (33), 9 states have call predecessors, (33), 9 states have call successors, (33) Word has length 116 [2022-07-12 11:02:11,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:11,921 INFO L225 Difference]: With dead ends: 368 [2022-07-12 11:02:11,921 INFO L226 Difference]: Without dead ends: 300 [2022-07-12 11:02:11,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 195 SyntacticMatches, 17 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=261, Invalid=1538, Unknown=7, NotChecked=0, Total=1806 [2022-07-12 11:02:11,922 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 342 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 560 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:11,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 884 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 977 Invalid, 0 Unknown, 560 Unchecked, 0.8s Time] [2022-07-12 11:02:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-07-12 11:02:11,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 264. [2022-07-12 11:02:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 172 states have (on average 1.1453488372093024) internal successors, (197), 179 states have internal predecessors, (197), 61 states have call successors, (61), 24 states have call predecessors, (61), 30 states have return successors, (84), 60 states have call predecessors, (84), 60 states have call successors, (84) [2022-07-12 11:02:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 342 transitions. [2022-07-12 11:02:11,949 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 342 transitions. Word has length 116 [2022-07-12 11:02:11,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:11,950 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 342 transitions. [2022-07-12 11:02:11,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.304347826086956) internal successors, (99), 22 states have internal predecessors, (99), 10 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (33), 9 states have call predecessors, (33), 9 states have call successors, (33) [2022-07-12 11:02:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 342 transitions. [2022-07-12 11:02:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 11:02:11,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:11,951 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:11,973 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-12 11:02:12,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-12 11:02:12,171 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:12,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:12,171 INFO L85 PathProgramCache]: Analyzing trace with hash 515121653, now seen corresponding path program 1 times [2022-07-12 11:02:12,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:12,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949866586] [2022-07-12 11:02:12,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:12,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:02:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:02:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:02:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:02:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:02:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:02:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:02:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:02:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-12 11:02:12,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:12,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949866586] [2022-07-12 11:02:12,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949866586] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:12,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133107285] [2022-07-12 11:02:12,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:12,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:12,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:12,814 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-12 11:02:12,815 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-12 11:02:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 2756 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 11:02:13,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 11:02:13,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:02:13,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133107285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:13,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:02:13,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [22] total 24 [2022-07-12 11:02:13,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821365308] [2022-07-12 11:02:13,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:13,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:02:13,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:13,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:02:13,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-07-12 11:02:13,316 INFO L87 Difference]: Start difference. First operand 264 states and 342 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 11:02:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:13,483 INFO L93 Difference]: Finished difference Result 454 states and 602 transitions. [2022-07-12 11:02:13,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:02:13,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 127 [2022-07-12 11:02:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:13,485 INFO L225 Difference]: With dead ends: 454 [2022-07-12 11:02:13,485 INFO L226 Difference]: Without dead ends: 268 [2022-07-12 11:02:13,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-07-12 11:02:13,486 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 17 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:13,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 547 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2022-07-12 11:02:13,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-12 11:02:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 264. [2022-07-12 11:02:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 172 states have (on average 1.122093023255814) internal successors, (193), 179 states have internal predecessors, (193), 61 states have call successors, (61), 24 states have call predecessors, (61), 30 states have return successors, (84), 60 states have call predecessors, (84), 60 states have call successors, (84) [2022-07-12 11:02:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 338 transitions. [2022-07-12 11:02:13,506 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 338 transitions. Word has length 127 [2022-07-12 11:02:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:13,507 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 338 transitions. [2022-07-12 11:02:13,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 11:02:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 338 transitions. [2022-07-12 11:02:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 11:02:13,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:13,509 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:13,548 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-12 11:02:13,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 11:02:13,731 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:13,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:13,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1075821431, now seen corresponding path program 1 times [2022-07-12 11:02:13,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:13,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369041390] [2022-07-12 11:02:13,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:13,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:02:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:14,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:02:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:14,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:02:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:14,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:02:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:14,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:02:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:14,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:02:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:14,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:02:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:14,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:14,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:14,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:02:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-12 11:02:14,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:14,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369041390] [2022-07-12 11:02:14,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369041390] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:14,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516396119] [2022-07-12 11:02:14,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:14,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:14,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:14,116 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-12 11:02:14,145 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-12 11:02:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:14,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 2761 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 11:02:14,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:14,764 INFO L356 Elim1Store]: treesize reduction 70, result has 26.3 percent of original size [2022-07-12 11:02:14,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 45 [2022-07-12 11:02:14,824 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 11:02:14,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 24 [2022-07-12 11:02:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 76 proven. 8 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 11:02:14,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:15,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-12 11:02:15,117 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:02:15,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-12 11:02:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-12 11:02:15,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516396119] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:02:15,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:02:15,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 21 [2022-07-12 11:02:15,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458275002] [2022-07-12 11:02:15,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:15,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 11:02:15,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:15,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 11:02:15,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:02:15,135 INFO L87 Difference]: Start difference. First operand 264 states and 338 transitions. Second operand has 21 states, 20 states have (on average 4.95) internal successors, (99), 19 states have internal predecessors, (99), 10 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (35), 8 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-12 11:02:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:16,262 INFO L93 Difference]: Finished difference Result 411 states and 545 transitions. [2022-07-12 11:02:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 11:02:16,262 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.95) internal successors, (99), 19 states have internal predecessors, (99), 10 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (35), 8 states have call predecessors, (35), 10 states have call successors, (35) Word has length 127 [2022-07-12 11:02:16,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:16,264 INFO L225 Difference]: With dead ends: 411 [2022-07-12 11:02:16,264 INFO L226 Difference]: Without dead ends: 308 [2022-07-12 11:02:16,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 271 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=793, Unknown=1, NotChecked=0, Total=930 [2022-07-12 11:02:16,265 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 183 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 274 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:16,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 693 Invalid, 1862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1458 Invalid, 0 Unknown, 274 Unchecked, 0.9s Time] [2022-07-12 11:02:16,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-12 11:02:16,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 270. [2022-07-12 11:02:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 175 states have (on average 1.12) internal successors, (196), 182 states have internal predecessors, (196), 64 states have call successors, (64), 24 states have call predecessors, (64), 30 states have return successors, (87), 63 states have call predecessors, (87), 63 states have call successors, (87) [2022-07-12 11:02:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 347 transitions. [2022-07-12 11:02:16,281 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 347 transitions. Word has length 127 [2022-07-12 11:02:16,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:16,281 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 347 transitions. [2022-07-12 11:02:16,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.95) internal successors, (99), 19 states have internal predecessors, (99), 10 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (35), 8 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-12 11:02:16,281 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 347 transitions. [2022-07-12 11:02:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 11:02:16,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:16,283 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:16,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-12 11:02:16,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 11:02:16,497 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:16,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:16,497 INFO L85 PathProgramCache]: Analyzing trace with hash 516599765, now seen corresponding path program 1 times [2022-07-12 11:02:16,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:16,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409831312] [2022-07-12 11:02:16,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:16,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:02:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:02:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:02:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:02:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:02:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:02:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:02:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-12 11:02:16,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:16,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409831312] [2022-07-12 11:02:16,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409831312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:16,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:16,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 11:02:16,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912061615] [2022-07-12 11:02:16,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:16,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:02:16,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:16,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:02:16,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:02:16,873 INFO L87 Difference]: Start difference. First operand 270 states and 347 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (18), 4 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-12 11:02:17,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:17,784 INFO L93 Difference]: Finished difference Result 283 states and 360 transitions. [2022-07-12 11:02:17,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 11:02:17,785 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (18), 4 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 118 [2022-07-12 11:02:17,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:17,787 INFO L225 Difference]: With dead ends: 283 [2022-07-12 11:02:17,787 INFO L226 Difference]: Without dead ends: 281 [2022-07-12 11:02:17,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-07-12 11:02:17,788 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 86 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:17,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 805 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 11:02:17,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-07-12 11:02:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 266. [2022-07-12 11:02:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 172 states have (on average 1.122093023255814) internal successors, (193), 178 states have internal predecessors, (193), 64 states have call successors, (64), 24 states have call predecessors, (64), 29 states have return successors, (86), 63 states have call predecessors, (86), 63 states have call successors, (86) [2022-07-12 11:02:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 343 transitions. [2022-07-12 11:02:17,811 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 343 transitions. Word has length 118 [2022-07-12 11:02:17,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:17,811 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 343 transitions. [2022-07-12 11:02:17,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (18), 4 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-12 11:02:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 343 transitions. [2022-07-12 11:02:17,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 11:02:17,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:17,813 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:17,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 11:02:17,813 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:17,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:17,813 INFO L85 PathProgramCache]: Analyzing trace with hash -671461454, now seen corresponding path program 1 times [2022-07-12 11:02:17,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:17,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005957633] [2022-07-12 11:02:17,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:17,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:02:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:02:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:02:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:02:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:02:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:02:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:02:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:02:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:02:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:02:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,115 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-12 11:02:18,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:18,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005957633] [2022-07-12 11:02:18,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005957633] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:18,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053028508] [2022-07-12 11:02:18,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:18,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:18,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:18,117 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-12 11:02:18,118 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-12 11:02:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:18,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 2728 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:02:18,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-12 11:02:18,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:02:18,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053028508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:18,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:02:18,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-12 11:02:18,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677490612] [2022-07-12 11:02:18,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:18,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:02:18,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:18,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:02:18,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:02:18,541 INFO L87 Difference]: Start difference. First operand 266 states and 343 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 11:02:18,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:18,657 INFO L93 Difference]: Finished difference Result 418 states and 552 transitions. [2022-07-12 11:02:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:02:18,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 124 [2022-07-12 11:02:18,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:18,659 INFO L225 Difference]: With dead ends: 418 [2022-07-12 11:02:18,659 INFO L226 Difference]: Without dead ends: 266 [2022-07-12 11:02:18,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:02:18,660 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 11 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:18,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1144 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:02:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-12 11:02:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-07-12 11:02:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 172 states have (on average 1.122093023255814) internal successors, (193), 178 states have internal predecessors, (193), 64 states have call successors, (64), 24 states have call predecessors, (64), 29 states have return successors, (85), 63 states have call predecessors, (85), 63 states have call successors, (85) [2022-07-12 11:02:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 342 transitions. [2022-07-12 11:02:18,678 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 342 transitions. Word has length 124 [2022-07-12 11:02:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:18,678 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 342 transitions. [2022-07-12 11:02:18,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 11:02:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 342 transitions. [2022-07-12 11:02:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 11:02:18,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:18,680 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:18,710 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-12 11:02:18,899 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,SelfDestructingSolverStorable12 [2022-07-12 11:02:18,900 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:18,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:18,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1510405803, now seen corresponding path program 2 times [2022-07-12 11:02:18,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:18,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831552205] [2022-07-12 11:02:18,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:18,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:02:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:02:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:02:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:02:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:02:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:02:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:02:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:02:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:02:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-07-12 11:02:19,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:19,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831552205] [2022-07-12 11:02:19,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831552205] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:19,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207014454] [2022-07-12 11:02:19,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:02:19,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:19,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:19,776 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-12 11:02:19,777 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-12 11:02:20,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:02:20,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:02:20,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 2761 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-12 11:02:20,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 40 proven. 3 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-12 11:02:50,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:51,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207014454] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:51,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:02:51,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2022-07-12 11:02:51,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179449882] [2022-07-12 11:02:51,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:51,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-12 11:02:51,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:51,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-12 11:02:51,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2181, Unknown=4, NotChecked=0, Total=2352 [2022-07-12 11:02:51,980 INFO L87 Difference]: Start difference. First operand 266 states and 342 transitions. Second operand has 35 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 30 states have internal predecessors, (86), 13 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (36), 10 states have call predecessors, (36), 13 states have call successors, (36) [2022-07-12 11:03:02,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:02,166 INFO L93 Difference]: Finished difference Result 531 states and 775 transitions. [2022-07-12 11:03:02,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-12 11:03:02,167 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 30 states have internal predecessors, (86), 13 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (36), 10 states have call predecessors, (36), 13 states have call successors, (36) Word has length 127 [2022-07-12 11:03:02,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:02,169 INFO L225 Difference]: With dead ends: 531 [2022-07-12 11:03:02,169 INFO L226 Difference]: Without dead ends: 421 [2022-07-12 11:03:02,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=582, Invalid=6893, Unknown=7, NotChecked=0, Total=7482 [2022-07-12 11:03:02,171 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 347 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 2770 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 4433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 2770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1238 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:02,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 864 Invalid, 4433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 2770 Invalid, 0 Unknown, 1238 Unchecked, 2.1s Time] [2022-07-12 11:03:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-07-12 11:03:02,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 292. [2022-07-12 11:03:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 189 states have (on average 1.1322751322751323) internal successors, (214), 194 states have internal predecessors, (214), 72 states have call successors, (72), 26 states have call predecessors, (72), 30 states have return successors, (98), 71 states have call predecessors, (98), 71 states have call successors, (98) [2022-07-12 11:03:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 384 transitions. [2022-07-12 11:03:02,194 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 384 transitions. Word has length 127 [2022-07-12 11:03:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:02,194 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 384 transitions. [2022-07-12 11:03:02,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 30 states have internal predecessors, (86), 13 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (36), 10 states have call predecessors, (36), 13 states have call successors, (36) [2022-07-12 11:03:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 384 transitions. [2022-07-12 11:03:02,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 11:03:02,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:02,196 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 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] [2022-07-12 11:03:02,234 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-12 11:03:02,410 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,SelfDestructingSolverStorable13 [2022-07-12 11:03:02,410 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:02,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:02,411 INFO L85 PathProgramCache]: Analyzing trace with hash 810653175, now seen corresponding path program 1 times [2022-07-12 11:03:02,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:02,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141507310] [2022-07-12 11:03:02,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:02,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:03:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:03:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:03:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:03:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:03:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:03:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:03:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:03:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 11:03:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-12 11:03:02,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:02,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141507310] [2022-07-12 11:03:02,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141507310] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:02,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652094814] [2022-07-12 11:03:02,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:02,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:02,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:02,796 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-12 11:03:02,797 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-12 11:03:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 2733 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 11:03:03,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-12 11:03:03,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:03:03,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652094814] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:03,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:03:03,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 16 [2022-07-12 11:03:03,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57701408] [2022-07-12 11:03:03,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:03,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:03:03,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:03,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:03:03,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:03:03,291 INFO L87 Difference]: Start difference. First operand 292 states and 384 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-12 11:03:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:03,383 INFO L93 Difference]: Finished difference Result 512 states and 688 transitions. [2022-07-12 11:03:03,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:03:03,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2022-07-12 11:03:03,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:03,385 INFO L225 Difference]: With dead ends: 512 [2022-07-12 11:03:03,385 INFO L226 Difference]: Without dead ends: 295 [2022-07-12 11:03:03,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:03:03,390 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 3 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:03,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 410 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-07-12 11:03:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-12 11:03:03,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 291. [2022-07-12 11:03:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 189 states have (on average 1.1058201058201058) internal successors, (209), 194 states have internal predecessors, (209), 71 states have call successors, (71), 26 states have call predecessors, (71), 30 states have return successors, (96), 70 states have call predecessors, (96), 70 states have call successors, (96) [2022-07-12 11:03:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 376 transitions. [2022-07-12 11:03:03,409 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 376 transitions. Word has length 126 [2022-07-12 11:03:03,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:03,409 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 376 transitions. [2022-07-12 11:03:03,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-12 11:03:03,410 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 376 transitions. [2022-07-12 11:03:03,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 11:03:03,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:03,411 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:03,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 11:03:03,631 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,SelfDestructingSolverStorable14 [2022-07-12 11:03:03,631 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:03,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:03,631 INFO L85 PathProgramCache]: Analyzing trace with hash 861832340, now seen corresponding path program 1 times [2022-07-12 11:03:03,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:03,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709037029] [2022-07-12 11:03:03,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:03,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:03:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:03:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:03:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:03:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:03:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:03:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:03:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:03:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:03:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:03:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:03:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-07-12 11:03:03,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:03,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709037029] [2022-07-12 11:03:03,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709037029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:03,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:03:03,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:03:03,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762015788] [2022-07-12 11:03:03,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:03,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:03:03,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:03,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:03:03,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:03:03,867 INFO L87 Difference]: Start difference. First operand 291 states and 376 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 11:03:04,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:04,364 INFO L93 Difference]: Finished difference Result 307 states and 392 transitions. [2022-07-12 11:03:04,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:03:04,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2022-07-12 11:03:04,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:04,366 INFO L225 Difference]: With dead ends: 307 [2022-07-12 11:03:04,366 INFO L226 Difference]: Without dead ends: 305 [2022-07-12 11:03:04,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:03:04,366 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 66 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:04,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 560 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:03:04,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-07-12 11:03:04,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 296. [2022-07-12 11:03:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 192 states have (on average 1.1041666666666667) internal successors, (212), 197 states have internal predecessors, (212), 72 states have call successors, (72), 27 states have call predecessors, (72), 31 states have return successors, (97), 71 states have call predecessors, (97), 71 states have call successors, (97) [2022-07-12 11:03:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 381 transitions. [2022-07-12 11:03:04,386 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 381 transitions. Word has length 126 [2022-07-12 11:03:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:04,387 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 381 transitions. [2022-07-12 11:03:04,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 11:03:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 381 transitions. [2022-07-12 11:03:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 11:03:04,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:04,388 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:04,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 11:03:04,389 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:04,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:04,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1852841436, now seen corresponding path program 1 times [2022-07-12 11:03:04,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:04,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125942062] [2022-07-12 11:03:04,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:04,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:03:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:03:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:03:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:03:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:03:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:03:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:03:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:03:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:03:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:03:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:03:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:04,716 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 32 proven. 11 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-12 11:03:04,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:04,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125942062] [2022-07-12 11:03:04,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125942062] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:04,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446907816] [2022-07-12 11:03:04,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:04,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:04,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:04,718 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-12 11:03:04,719 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-12 11:03:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:05,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 2738 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 11:03:05,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:05,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:03:05,349 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 11:03:05,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2022-07-12 11:03:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 49 proven. 22 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-12 11:03:06,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:03:06,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-12 11:03:06,480 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:03:06,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-12 11:03:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-07-12 11:03:06,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446907816] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:03:06,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:03:06,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 12] total 28 [2022-07-12 11:03:06,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844861350] [2022-07-12 11:03:06,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:03:06,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 11:03:06,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:06,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 11:03:06,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2022-07-12 11:03:06,501 INFO L87 Difference]: Start difference. First operand 296 states and 381 transitions. Second operand has 28 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 12 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) [2022-07-12 11:03:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:09,063 INFO L93 Difference]: Finished difference Result 666 states and 912 transitions. [2022-07-12 11:03:09,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-12 11:03:09,064 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 12 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) Word has length 130 [2022-07-12 11:03:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:09,081 INFO L225 Difference]: With dead ends: 666 [2022-07-12 11:03:09,081 INFO L226 Difference]: Without dead ends: 543 [2022-07-12 11:03:09,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 262 SyntacticMatches, 23 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=425, Invalid=2767, Unknown=0, NotChecked=0, Total=3192 [2022-07-12 11:03:09,099 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 289 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 3343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 619 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:09,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 874 Invalid, 3343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 2513 Invalid, 0 Unknown, 619 Unchecked, 1.8s Time] [2022-07-12 11:03:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-07-12 11:03:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 357. [2022-07-12 11:03:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 225 states have (on average 1.0977777777777777) internal successors, (247), 232 states have internal predecessors, (247), 92 states have call successors, (92), 33 states have call predecessors, (92), 39 states have return successors, (123), 91 states have call predecessors, (123), 91 states have call successors, (123) [2022-07-12 11:03:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 462 transitions. [2022-07-12 11:03:09,135 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 462 transitions. Word has length 130 [2022-07-12 11:03:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:09,135 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 462 transitions. [2022-07-12 11:03:09,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 12 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) [2022-07-12 11:03:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 462 transitions. [2022-07-12 11:03:09,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 11:03:09,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:09,138 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:09,160 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-12 11:03:09,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:09,358 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:09,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:09,358 INFO L85 PathProgramCache]: Analyzing trace with hash -318953602, now seen corresponding path program 1 times [2022-07-12 11:03:09,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:09,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813543743] [2022-07-12 11:03:09,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:09,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:03:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:03:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:03:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:03:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:03:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:03:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:03:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:03:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:03:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:03:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:03:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:03:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-12 11:03:09,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:09,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813543743] [2022-07-12 11:03:09,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813543743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:09,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:03:09,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 11:03:09,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314274813] [2022-07-12 11:03:09,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:09,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 11:03:09,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:09,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 11:03:09,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:03:09,866 INFO L87 Difference]: Start difference. First operand 357 states and 462 transitions. Second operand has 14 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 7 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-07-12 11:03:10,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:10,628 INFO L93 Difference]: Finished difference Result 425 states and 582 transitions. [2022-07-12 11:03:10,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:03:10,629 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 7 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 134 [2022-07-12 11:03:10,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:10,631 INFO L225 Difference]: With dead ends: 425 [2022-07-12 11:03:10,631 INFO L226 Difference]: Without dead ends: 423 [2022-07-12 11:03:10,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:03:10,632 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 227 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:10,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 391 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 11:03:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-07-12 11:03:10,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 410. [2022-07-12 11:03:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 248 states have (on average 1.092741935483871) internal successors, (271), 256 states have internal predecessors, (271), 121 states have call successors, (121), 34 states have call predecessors, (121), 40 states have return successors, (165), 119 states have call predecessors, (165), 120 states have call successors, (165) [2022-07-12 11:03:10,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 557 transitions. [2022-07-12 11:03:10,684 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 557 transitions. Word has length 134 [2022-07-12 11:03:10,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:10,685 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 557 transitions. [2022-07-12 11:03:10,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 7 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-07-12 11:03:10,685 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 557 transitions. [2022-07-12 11:03:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-12 11:03:10,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:10,687 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 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] [2022-07-12 11:03:10,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 11:03:10,687 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:10,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:10,688 INFO L85 PathProgramCache]: Analyzing trace with hash 799839239, now seen corresponding path program 1 times [2022-07-12 11:03:10,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:10,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920361434] [2022-07-12 11:03:10,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:10,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:03:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:03:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:03:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:03:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:03:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:03:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:03:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:10,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:03:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:11,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:11,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:11,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 11:03:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:11,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 11:03:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:11,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:03:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 20 proven. 33 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-12 11:03:11,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:11,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920361434] [2022-07-12 11:03:11,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920361434] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:11,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921622722] [2022-07-12 11:03:11,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:11,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:11,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:11,019 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-12 11:03:11,024 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-12 11:03:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:11,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 2770 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-12 11:03:11,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:11,778 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-12 11:03:11,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:03:11,788 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 11:03:11,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-07-12 11:03:11,794 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-12 11:03:11,889 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-12 11:03:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 99 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 11:03:12,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:03:20,788 WARN L233 SmtUtils]: Spent 7.64s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:03:30,198 WARN L233 SmtUtils]: Spent 9.27s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:03:32,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-12 11:03:33,039 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:03:33,040 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 19 treesize of output 18 [2022-07-12 11:03:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 8 proven. 54 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 11:03:33,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921622722] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:03:33,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:03:33,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 19] total 52 [2022-07-12 11:03:33,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87786218] [2022-07-12 11:03:33,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:03:33,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-12 11:03:33,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:33,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-12 11:03:33,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2454, Unknown=0, NotChecked=0, Total=2652 [2022-07-12 11:03:33,097 INFO L87 Difference]: Start difference. First operand 410 states and 557 transitions. Second operand has 52 states, 49 states have (on average 3.857142857142857) internal successors, (189), 46 states have internal predecessors, (189), 17 states have call successors, (50), 11 states have call predecessors, (50), 16 states have return successors, (49), 16 states have call predecessors, (49), 17 states have call successors, (49) [2022-07-12 11:03:39,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:39,409 INFO L93 Difference]: Finished difference Result 763 states and 1010 transitions. [2022-07-12 11:03:39,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-07-12 11:03:39,410 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 3.857142857142857) internal successors, (189), 46 states have internal predecessors, (189), 17 states have call successors, (50), 11 states have call predecessors, (50), 16 states have return successors, (49), 16 states have call predecessors, (49), 17 states have call successors, (49) Word has length 140 [2022-07-12 11:03:39,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:39,413 INFO L225 Difference]: With dead ends: 763 [2022-07-12 11:03:39,413 INFO L226 Difference]: Without dead ends: 603 [2022-07-12 11:03:39,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 290 SyntacticMatches, 7 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3935 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=1742, Invalid=12537, Unknown=1, NotChecked=0, Total=14280 [2022-07-12 11:03:39,416 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 704 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 5548 mSolverCounterSat, 701 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 8495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 701 IncrementalHoareTripleChecker+Valid, 5548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2246 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:39,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 1307 Invalid, 8495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [701 Valid, 5548 Invalid, 0 Unknown, 2246 Unchecked, 3.0s Time] [2022-07-12 11:03:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-07-12 11:03:39,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 549. [2022-07-12 11:03:39,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 350 states have (on average 1.1) internal successors, (385), 357 states have internal predecessors, (385), 142 states have call successors, (142), 51 states have call predecessors, (142), 56 states have return successors, (187), 140 states have call predecessors, (187), 140 states have call successors, (187) [2022-07-12 11:03:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 714 transitions. [2022-07-12 11:03:39,460 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 714 transitions. Word has length 140 [2022-07-12 11:03:39,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:39,460 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 714 transitions. [2022-07-12 11:03:39,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 3.857142857142857) internal successors, (189), 46 states have internal predecessors, (189), 17 states have call successors, (50), 11 states have call predecessors, (50), 16 states have return successors, (49), 16 states have call predecessors, (49), 17 states have call successors, (49) [2022-07-12 11:03:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 714 transitions. [2022-07-12 11:03:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-12 11:03:39,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:39,463 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:39,497 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-12 11:03:39,682 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-12 11:03:39,683 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:39,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:39,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1793752668, now seen corresponding path program 1 times [2022-07-12 11:03:39,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:39,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379075870] [2022-07-12 11:03:39,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:39,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:03:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:03:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:39,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:03:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:03:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:03:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:03:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:03:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:03:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 11:03:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 11:03:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 11:03:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-07-12 11:03:40,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:40,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379075870] [2022-07-12 11:03:40,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379075870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:40,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882447796] [2022-07-12 11:03:40,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:40,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:40,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:40,124 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-12 11:03:40,144 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-12 11:03:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:40,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 2838 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-12 11:03:40,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:40,593 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-12 11:03:40,633 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-12 11:03:40,635 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-12 11:03:40,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:03:40,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:03:40,846 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 15 treesize of output 7 [2022-07-12 11:03:40,848 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 15 treesize of output 7 [2022-07-12 11:03:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 102 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-12 11:03:40,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:03:41,042 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1677 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_eq_ignore_case_harness_~#rhs~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_aws_byte_cursor_eq_ignore_case_harness_~#lhs~0#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_eq_ignore_case_harness_~#lhs~0#1.offset| 8)) 0)) (forall ((v_ArrVal_1678 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_byte_cursor_eq_ignore_case_harness_~#rhs~0#1.base| v_ArrVal_1678) |c_ULTIMATE.start_aws_byte_cursor_eq_ignore_case_harness_~#lhs~0#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_eq_ignore_case_harness_~#lhs~0#1.offset| 8)) 0))) is different from false [2022-07-12 11:03:41,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882447796] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:41,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:03:41,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2022-07-12 11:03:41,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377967119] [2022-07-12 11:03:41,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:03:41,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 11:03:41,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:41,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 11:03:41,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=585, Unknown=1, NotChecked=48, Total=702 [2022-07-12 11:03:41,052 INFO L87 Difference]: Start difference. First operand 549 states and 714 transitions. Second operand has 24 states, 22 states have (on average 5.181818181818182) internal successors, (114), 22 states have internal predecessors, (114), 11 states have call successors, (43), 5 states have call predecessors, (43), 7 states have return successors, (42), 9 states have call predecessors, (42), 11 states have call successors, (42) [2022-07-12 11:03:43,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:43,120 INFO L93 Difference]: Finished difference Result 836 states and 1139 transitions. [2022-07-12 11:03:43,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 11:03:43,121 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 5.181818181818182) internal successors, (114), 22 states have internal predecessors, (114), 11 states have call successors, (43), 5 states have call predecessors, (43), 7 states have return successors, (42), 9 states have call predecessors, (42), 11 states have call successors, (42) Word has length 148 [2022-07-12 11:03:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:43,124 INFO L225 Difference]: With dead ends: 836 [2022-07-12 11:03:43,124 INFO L226 Difference]: Without dead ends: 698 [2022-07-12 11:03:43,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 284 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=1773, Unknown=1, NotChecked=86, Total=2070 [2022-07-12 11:03:43,126 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 307 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 3109 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 3789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 3109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 285 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:43,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 835 Invalid, 3789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 3109 Invalid, 0 Unknown, 285 Unchecked, 1.6s Time] [2022-07-12 11:03:43,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-07-12 11:03:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 553. [2022-07-12 11:03:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 355 states have (on average 1.0985915492957747) internal successors, (390), 363 states have internal predecessors, (390), 138 states have call successors, (138), 53 states have call predecessors, (138), 59 states have return successors, (180), 136 states have call predecessors, (180), 136 states have call successors, (180) [2022-07-12 11:03:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 708 transitions. [2022-07-12 11:03:43,171 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 708 transitions. Word has length 148 [2022-07-12 11:03:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:43,172 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 708 transitions. [2022-07-12 11:03:43,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 5.181818181818182) internal successors, (114), 22 states have internal predecessors, (114), 11 states have call successors, (43), 5 states have call predecessors, (43), 7 states have return successors, (42), 9 states have call predecessors, (42), 11 states have call successors, (42) [2022-07-12 11:03:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 708 transitions. [2022-07-12 11:03:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 11:03:43,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:43,174 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 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] [2022-07-12 11:03:43,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 11:03:43,391 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-12 11:03:43,392 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:43,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:43,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1945645526, now seen corresponding path program 1 times [2022-07-12 11:03:43,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:43,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039184641] [2022-07-12 11:03:43,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:43,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:03:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:03:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:03:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:03:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:03:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:03:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:03:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:03:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 11:03:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 11:03:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 11:03:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-07-12 11:03:43,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:43,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039184641] [2022-07-12 11:03:43,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039184641] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:43,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576684234] [2022-07-12 11:03:43,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:43,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:43,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:43,941 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-12 11:03:43,942 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-12 11:03:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:44,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 2815 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-12 11:03:44,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:44,443 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-12 11:03:44,446 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-12 11:03:44,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-12 11:03:44,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-12 11:03:44,776 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 21 treesize of output 13 [2022-07-12 11:03:44,778 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 21 treesize of output 13 [2022-07-12 11:03:44,818 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 19 treesize of output 7 [2022-07-12 11:03:44,821 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 19 treesize of output 7 [2022-07-12 11:03:44,837 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 93 proven. 8 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-12 11:03:44,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:03:45,106 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 38 treesize of output 32 [2022-07-12 11:03:45,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:03:45,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:03:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-07-12 11:03:45,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576684234] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:03:45,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:03:45,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 11] total 28 [2022-07-12 11:03:45,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615038943] [2022-07-12 11:03:45,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:03:45,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 11:03:45,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:45,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 11:03:45,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-07-12 11:03:45,138 INFO L87 Difference]: Start difference. First operand 553 states and 708 transitions. Second operand has 28 states, 26 states have (on average 4.884615384615385) internal successors, (127), 26 states have internal predecessors, (127), 12 states have call successors, (47), 7 states have call predecessors, (47), 9 states have return successors, (45), 10 states have call predecessors, (45), 12 states have call successors, (45) [2022-07-12 11:03:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:49,226 INFO L93 Difference]: Finished difference Result 1135 states and 1666 transitions. [2022-07-12 11:03:49,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-12 11:03:49,227 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 4.884615384615385) internal successors, (127), 26 states have internal predecessors, (127), 12 states have call successors, (47), 7 states have call predecessors, (47), 9 states have return successors, (45), 10 states have call predecessors, (45), 12 states have call successors, (45) Word has length 147 [2022-07-12 11:03:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:49,232 INFO L225 Difference]: With dead ends: 1135 [2022-07-12 11:03:49,232 INFO L226 Difference]: Without dead ends: 1002 [2022-07-12 11:03:49,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 322 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=406, Invalid=3500, Unknown=0, NotChecked=0, Total=3906 [2022-07-12 11:03:49,235 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 317 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 4543 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 5746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 4543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 715 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:49,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1305 Invalid, 5746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 4543 Invalid, 0 Unknown, 715 Unchecked, 3.0s Time] [2022-07-12 11:03:49,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2022-07-12 11:03:49,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 593. [2022-07-12 11:03:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 381 states have (on average 1.094488188976378) internal successors, (417), 389 states have internal predecessors, (417), 149 states have call successors, (149), 56 states have call predecessors, (149), 62 states have return successors, (194), 147 states have call predecessors, (194), 147 states have call successors, (194) [2022-07-12 11:03:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 760 transitions. [2022-07-12 11:03:49,288 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 760 transitions. Word has length 147 [2022-07-12 11:03:49,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:49,288 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 760 transitions. [2022-07-12 11:03:49,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 4.884615384615385) internal successors, (127), 26 states have internal predecessors, (127), 12 states have call successors, (47), 7 states have call predecessors, (47), 9 states have return successors, (45), 10 states have call predecessors, (45), 12 states have call successors, (45) [2022-07-12 11:03:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 760 transitions. [2022-07-12 11:03:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-12 11:03:49,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:49,291 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:49,313 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-12 11:03:49,513 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-12 11:03:49,513 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:49,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:49,513 INFO L85 PathProgramCache]: Analyzing trace with hash -523964798, now seen corresponding path program 1 times [2022-07-12 11:03:49,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:49,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887247334] [2022-07-12 11:03:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:49,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:03:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:03:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:03:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:03:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:03:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:03:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:03:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:03:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:03:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:03:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 11:03:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:03:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 11:03:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-07-12 11:03:49,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:49,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887247334] [2022-07-12 11:03:49,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887247334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:49,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:03:49,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 11:03:49,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143130603] [2022-07-12 11:03:49,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:49,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:03:49,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:49,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:03:49,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:03:49,693 INFO L87 Difference]: Start difference. First operand 593 states and 760 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-12 11:03:50,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:50,201 INFO L93 Difference]: Finished difference Result 763 states and 1012 transitions. [2022-07-12 11:03:50,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:03:50,201 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 142 [2022-07-12 11:03:50,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:50,206 INFO L225 Difference]: With dead ends: 763 [2022-07-12 11:03:50,206 INFO L226 Difference]: Without dead ends: 666 [2022-07-12 11:03:50,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:03:50,208 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 71 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:50,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 485 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:03:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-07-12 11:03:50,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 637. [2022-07-12 11:03:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 403 states have (on average 1.086848635235732) internal successors, (438), 410 states have internal predecessors, (438), 169 states have call successors, (169), 56 states have call predecessors, (169), 64 states have return successors, (227), 170 states have call predecessors, (227), 167 states have call successors, (227) [2022-07-12 11:03:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 834 transitions. [2022-07-12 11:03:50,267 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 834 transitions. Word has length 142 [2022-07-12 11:03:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:50,268 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 834 transitions. [2022-07-12 11:03:50,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-12 11:03:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 834 transitions. [2022-07-12 11:03:50,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-12 11:03:50,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:50,271 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:03:50,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 11:03:50,271 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:50,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:50,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1337768659, now seen corresponding path program 1 times [2022-07-12 11:03:50,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:50,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741648501] [2022-07-12 11:03:50,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:50,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:03:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:03:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:03:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:03:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:03:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:03:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:03:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:03:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:03:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:03:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 11:03:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 11:03:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:03:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 11:03:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:03:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-07-12 11:03:50,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:50,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741648501] [2022-07-12 11:03:50,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741648501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:03:50,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:03:50,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:03:50,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929878659] [2022-07-12 11:03:50,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:03:50,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:03:50,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:03:50,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:03:50,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:03:50,501 INFO L87 Difference]: Start difference. First operand 637 states and 834 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-12 11:03:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:03:50,856 INFO L93 Difference]: Finished difference Result 651 states and 849 transitions. [2022-07-12 11:03:50,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:03:50,857 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 152 [2022-07-12 11:03:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:03:50,860 INFO L225 Difference]: With dead ends: 651 [2022-07-12 11:03:50,860 INFO L226 Difference]: Without dead ends: 649 [2022-07-12 11:03:50,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 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-12 11:03:50,862 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 66 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:03:50,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 560 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:03:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-07-12 11:03:50,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2022-07-12 11:03:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 409 states have (on average 1.0855745721271393) internal successors, (444), 416 states have internal predecessors, (444), 171 states have call successors, (171), 58 states have call predecessors, (171), 66 states have return successors, (229), 172 states have call predecessors, (229), 169 states have call successors, (229) [2022-07-12 11:03:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 844 transitions. [2022-07-12 11:03:50,916 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 844 transitions. Word has length 152 [2022-07-12 11:03:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:03:50,916 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 844 transitions. [2022-07-12 11:03:50,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-12 11:03:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 844 transitions. [2022-07-12 11:03:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-12 11:03:50,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:03:50,919 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1] [2022-07-12 11:03:50,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 11:03:50,920 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:03:50,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:03:50,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1366902475, now seen corresponding path program 1 times [2022-07-12 11:03:50,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:03:50,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523090105] [2022-07-12 11:03:50,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:50,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:03:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:03:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:03:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 11:03:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 11:03:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:03:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:03:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:03:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:03:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:03:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:03:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:03:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:03:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:03:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:03:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:03:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 11:03:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 11:03:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 11:03:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-07-12 11:03:51,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:03:51,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523090105] [2022-07-12 11:03:51,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523090105] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:03:51,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286674482] [2022-07-12 11:03:51,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:03:51,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:51,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:03:51,724 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-12 11:03:51,779 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-12 11:03:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:03:52,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 2852 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-12 11:03:52,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:03:52,252 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:03:52,252 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 11:03:52,657 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-12 11:03:52,730 INFO L356 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2022-07-12 11:03:52,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2022-07-12 11:03:53,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:03:53,610 INFO L356 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2022-07-12 11:03:53,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 40 [2022-07-12 11:03:53,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-12 11:03:53,618 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 30 treesize of output 18 [2022-07-12 11:03:53,728 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 11:03:53,728 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 11:03:53,954 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-12 11:03:53,955 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-12 11:03:53,967 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_ArrVal_2033 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_2033))) (exists ((v_ArrVal_2032 (Array Int Int))) (= (store |c_old(#memory_int)| |c_save_byte_from_array_#in~storage#1.base| v_ArrVal_2032) |c_#memory_int|))) is different from true [2022-07-12 11:03:53,975 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 27 treesize of output 27 [2022-07-12 11:03:53,988 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-12 11:03:53,988 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 34 treesize of output 41 [2022-07-12 11:03:53,992 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 11:03:54,013 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-12 11:03:54,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:03:54,213 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-12 11:03:54,217 INFO L158 Benchmark]: Toolchain (without parser) took 145616.35ms. Allocated memory was 121.6MB in the beginning and 423.6MB in the end (delta: 302.0MB). Free memory was 85.8MB in the beginning and 188.6MB in the end (delta: -102.8MB). Peak memory consumption was 198.5MB. Max. memory is 16.1GB. [2022-07-12 11:03:54,217 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 121.6MB. Free memory was 79.9MB in the beginning and 79.8MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:03:54,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1696.94ms. Allocated memory was 121.6MB in the beginning and 195.0MB in the end (delta: 73.4MB). Free memory was 85.5MB in the beginning and 144.3MB in the end (delta: -58.8MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2022-07-12 11:03:54,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.95ms. Allocated memory is still 195.0MB. Free memory was 144.3MB in the beginning and 132.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 11:03:54,218 INFO L158 Benchmark]: Boogie Preprocessor took 45.07ms. Allocated memory is still 195.0MB. Free memory was 132.8MB in the beginning and 125.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 11:03:54,218 INFO L158 Benchmark]: RCFGBuilder took 1001.29ms. Allocated memory is still 195.0MB. Free memory was 125.4MB in the beginning and 119.7MB in the end (delta: 5.7MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. [2022-07-12 11:03:54,218 INFO L158 Benchmark]: TraceAbstraction took 142744.61ms. Allocated memory was 195.0MB in the beginning and 423.6MB in the end (delta: 228.6MB). Free memory was 118.7MB in the beginning and 188.6MB in the end (delta: -69.9MB). Peak memory consumption was 159.7MB. Max. memory is 16.1GB. [2022-07-12 11:03:54,219 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.09ms. Allocated memory is still 121.6MB. Free memory was 79.9MB in the beginning and 79.8MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1696.94ms. Allocated memory was 121.6MB in the beginning and 195.0MB in the end (delta: 73.4MB). Free memory was 85.5MB in the beginning and 144.3MB in the end (delta: -58.8MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.95ms. Allocated memory is still 195.0MB. Free memory was 144.3MB in the beginning and 132.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.07ms. Allocated memory is still 195.0MB. Free memory was 132.8MB in the beginning and 125.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1001.29ms. Allocated memory is still 195.0MB. Free memory was 125.4MB in the beginning and 119.7MB in the end (delta: 5.7MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. * TraceAbstraction took 142744.61ms. Allocated memory was 195.0MB in the beginning and 423.6MB in the end (delta: 228.6MB). Free memory was 118.7MB in the beginning and 188.6MB in the end (delta: -69.9MB). Peak memory consumption was 159.7MB. 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-12 11:03:54,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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_cursor_eq_ignore_case_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 37f6b0c93ef236fcd62a86dc508823d298ec7578e65cd9cab79b0e3659914d7a --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:03:55,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:03:55,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:03:55,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:03:55,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:03:55,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:03:55,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:03:55,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:03:55,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:03:55,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:03:55,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:03:55,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:03:55,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:03:55,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:03:56,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:03:56,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:03:56,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:03:56,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:03:56,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:03:56,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:03:56,011 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:03:56,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:03:56,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:03:56,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:03:56,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:03:56,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:03:56,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:03:56,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:03:56,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:03:56,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:03:56,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:03:56,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:03:56,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:03:56,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:03:56,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:03:56,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:03:56,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:03:56,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:03:56,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:03:56,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:03:56,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:03:56,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:03:56,034 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-12 11:03:56,052 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:03:56,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:03:56,053 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:03:56,053 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:03:56,053 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:03:56,054 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:03:56,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:03:56,054 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:03:56,054 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:03:56,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:03:56,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:03:56,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:03:56,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:03:56,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:03:56,061 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 11:03:56,061 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 11:03:56,061 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 11:03:56,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:03:56,061 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:03:56,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:03:56,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:03:56,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:03:56,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:03:56,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:03:56,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:03:56,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:03:56,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:03:56,063 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 11:03:56,063 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 11:03:56,063 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:03:56,063 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:03:56,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:03:56,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 11:03:56,064 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 -> 37f6b0c93ef236fcd62a86dc508823d298ec7578e65cd9cab79b0e3659914d7a [2022-07-12 11:03:56,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:03:56,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:03:56,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:03:56,303 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:03:56,303 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:03:56,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_ignore_case_harness.i [2022-07-12 11:03:56,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/906d543b7/1e3ea9f4e8bd47198385a9744b3d5329/FLAG6639f1f93 [2022-07-12 11:03:56,962 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:03:56,963 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_ignore_case_harness.i [2022-07-12 11:03:56,992 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/906d543b7/1e3ea9f4e8bd47198385a9744b3d5329/FLAG6639f1f93 [2022-07-12 11:03:57,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/906d543b7/1e3ea9f4e8bd47198385a9744b3d5329 [2022-07-12 11:03:57,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:03:57,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:03:57,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:03:57,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:03:57,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:03:57,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:03:57" (1/1) ... [2022-07-12 11:03:57,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f6201c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:03:57, skipping insertion in model container [2022-07-12 11:03:57,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:03:57" (1/1) ... [2022-07-12 11:03:57,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:03:57,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:03:57,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_ignore_case_harness.i[4504,4517] [2022-07-12 11:03:57,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_ignore_case_harness.i[4564,4577] [2022-07-12 11:03:58,068 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:58,069 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:58,069 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:58,069 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:58,070 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:58,084 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:58,084 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:58,085 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:58,086 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:03:58,319 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:03:58,321 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:03:58,321 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:03:58,322 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:03:58,323 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:03:58,334 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:03:58,335 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:03:58,335 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:03:58,336 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:03:58,336 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:03:58,416 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:03:58,441 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-12 11:03:58,445 INFO L158 Benchmark]: Toolchain (without parser) took 1061.30ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 27.9MB in the beginning and 42.4MB in the end (delta: -14.5MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2022-07-12 11:03:58,445 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory was 40.3MB in the beginning and 40.3MB in the end (delta: 50.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:03:58,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1058.74ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 27.7MB in the beginning and 42.4MB in the end (delta: -14.7MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2022-07-12 11:03:58,447 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory was 40.3MB in the beginning and 40.3MB in the end (delta: 50.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1058.74ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 27.7MB in the beginning and 42.4MB in the end (delta: -14.7MB). Peak memory consumption was 15.2MB. 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