./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.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 6063bfeeaa4a025ac67d1a7a9b5cc20b489e34fc9db0d4dd9fcdda86c75b9c5e --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 00:16:11,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 00:16:11,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 00:16:11,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 00:16:11,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 00:16:11,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 00:16:11,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 00:16:11,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 00:16:11,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 00:16:11,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 00:16:11,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 00:16:11,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 00:16:11,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 00:16:11,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 00:16:11,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 00:16:11,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 00:16:11,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 00:16:11,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 00:16:11,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 00:16:11,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 00:16:11,492 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 00:16:11,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 00:16:11,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 00:16:11,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 00:16:11,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 00:16:11,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 00:16:11,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 00:16:11,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 00:16:11,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 00:16:11,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 00:16:11,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 00:16:11,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 00:16:11,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 00:16:11,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 00:16:11,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 00:16:11,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 00:16:11,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 00:16:11,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 00:16:11,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 00:16:11,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 00:16:11,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 00:16:11,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 00:16:11,507 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 00:16:11,535 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 00:16:11,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 00:16:11,538 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 00:16:11,539 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 00:16:11,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 00:16:11,540 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 00:16:11,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 00:16:11,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 00:16:11,542 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 00:16:11,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 00:16:11,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 00:16:11,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 00:16:11,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 00:16:11,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 00:16:11,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 00:16:11,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 00:16:11,544 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 00:16:11,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 00:16:11,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 00:16:11,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 00:16:11,546 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 00:16:11,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 00:16:11,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 00:16:11,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 00:16:11,547 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 00:16:11,547 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 00:16:11,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 00:16:11,548 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 00:16:11,548 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 00:16:11,548 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 00:16:11,548 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 -> 6063bfeeaa4a025ac67d1a7a9b5cc20b489e34fc9db0d4dd9fcdda86c75b9c5e [2022-07-23 00:16:11,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 00:16:11,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 00:16:11,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 00:16:11,817 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 00:16:11,817 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 00:16:11,819 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-07-23 00:16:11,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899999bcd/191144bd31644c2ba72a1c8522ee4d24/FLAG44b4aa0a9 [2022-07-23 00:16:12,546 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 00:16:12,547 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-07-23 00:16:12,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899999bcd/191144bd31644c2ba72a1c8522ee4d24/FLAG44b4aa0a9 [2022-07-23 00:16:12,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/899999bcd/191144bd31644c2ba72a1c8522ee4d24 [2022-07-23 00:16:12,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 00:16:12,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 00:16:12,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 00:16:12,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 00:16:12,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 00:16:12,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:16:12" (1/1) ... [2022-07-23 00:16:12,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704ea401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:16:12, skipping insertion in model container [2022-07-23 00:16:12,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:16:12" (1/1) ... [2022-07-23 00:16:12,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 00:16:12,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 00:16:13,410 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/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2022-07-23 00:16:14,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:16:14,363 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 00:16:14,445 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/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2022-07-23 00:16:14,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:16:14,666 INFO L208 MainTranslator]: Completed translation [2022-07-23 00:16:14,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:16:14 WrapperNode [2022-07-23 00:16:14,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 00:16:14,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 00:16:14,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 00:16:14,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 00:16:14,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:16:14" (1/1) ... [2022-07-23 00:16:14,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:16:14" (1/1) ... [2022-07-23 00:16:14,895 INFO L137 Inliner]: procedures = 184, calls = 828, calls flagged for inlining = 92, calls inlined = 90, statements flattened = 3190 [2022-07-23 00:16:14,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 00:16:14,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 00:16:14,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 00:16:14,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 00:16:14,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:16:14" (1/1) ... [2022-07-23 00:16:14,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:16:14" (1/1) ... [2022-07-23 00:16:14,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:16:14" (1/1) ... [2022-07-23 00:16:14,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:16:14" (1/1) ... [2022-07-23 00:16:15,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:16:14" (1/1) ... [2022-07-23 00:16:15,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:16:14" (1/1) ... [2022-07-23 00:16:15,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:16:14" (1/1) ... [2022-07-23 00:16:15,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 00:16:15,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 00:16:15,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 00:16:15,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 00:16:15,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:16:14" (1/1) ... [2022-07-23 00:16:15,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 00:16:15,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:16:15,147 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-23 00:16:15,180 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-23 00:16:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-07-23 00:16:15,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-07-23 00:16:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2022-07-23 00:16:15,199 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2022-07-23 00:16:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-23 00:16:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-23 00:16:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-07-23 00:16:15,200 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-07-23 00:16:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-23 00:16:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-23 00:16:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 00:16:15,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 00:16:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 00:16:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-23 00:16:15,201 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-23 00:16:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-23 00:16:15,201 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-23 00:16:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-07-23 00:16:15,202 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-07-23 00:16:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-23 00:16:15,202 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-23 00:16:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-23 00:16:15,202 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-23 00:16:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 00:16:15,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 00:16:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-23 00:16:15,203 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-23 00:16:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-07-23 00:16:15,203 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-07-23 00:16:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-23 00:16:15,203 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-23 00:16:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-07-23 00:16:15,204 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-07-23 00:16:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 00:16:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-23 00:16:15,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-23 00:16:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 00:16:15,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 00:16:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-23 00:16:15,205 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-23 00:16:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-23 00:16:15,205 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-23 00:16:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-23 00:16:15,205 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-23 00:16:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-07-23 00:16:15,206 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-07-23 00:16:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 00:16:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-07-23 00:16:15,207 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-07-23 00:16:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-07-23 00:16:15,207 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-07-23 00:16:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-07-23 00:16:15,207 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-07-23 00:16:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 00:16:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-23 00:16:15,208 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-23 00:16:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-07-23 00:16:15,209 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-07-23 00:16:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 00:16:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 00:16:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-23 00:16:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-07-23 00:16:15,211 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-07-23 00:16:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2022-07-23 00:16:15,212 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2022-07-23 00:16:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-23 00:16:15,212 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-23 00:16:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2022-07-23 00:16:15,212 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2022-07-23 00:16:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 00:16:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-23 00:16:15,213 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-23 00:16:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-23 00:16:15,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-23 00:16:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-23 00:16:15,214 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-23 00:16:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-07-23 00:16:15,214 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-07-23 00:16:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-07-23 00:16:15,215 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-07-23 00:16:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 00:16:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-07-23 00:16:15,215 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-07-23 00:16:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 00:16:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-07-23 00:16:15,215 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-07-23 00:16:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-23 00:16:15,216 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-23 00:16:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2022-07-23 00:16:15,216 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2022-07-23 00:16:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-23 00:16:15,217 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-23 00:16:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-23 00:16:15,217 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-23 00:16:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2022-07-23 00:16:15,218 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2022-07-23 00:16:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-07-23 00:16:15,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-07-23 00:16:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-23 00:16:15,219 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-23 00:16:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-23 00:16:15,220 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-23 00:16:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-23 00:16:15,220 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-23 00:16:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-23 00:16:15,220 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-23 00:16:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 00:16:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-23 00:16:15,221 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-23 00:16:15,221 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-07-23 00:16:15,221 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-07-23 00:16:15,221 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-23 00:16:15,222 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-23 00:16:15,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-23 00:16:15,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-23 00:16:15,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-23 00:16:15,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 00:16:15,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 00:16:15,224 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-07-23 00:16:15,226 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-07-23 00:16:15,226 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-23 00:16:15,226 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-23 00:16:15,805 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 00:16:15,837 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 00:16:16,002 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 00:16:18,208 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 00:16:18,250 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 00:16:18,251 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 00:16:18,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:16:18 BoogieIcfgContainer [2022-07-23 00:16:18,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 00:16:18,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 00:16:18,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 00:16:18,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 00:16:18,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 12:16:12" (1/3) ... [2022-07-23 00:16:18,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21827d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:16:18, skipping insertion in model container [2022-07-23 00:16:18,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:16:14" (2/3) ... [2022-07-23 00:16:18,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21827d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:16:18, skipping insertion in model container [2022-07-23 00:16:18,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:16:18" (3/3) ... [2022-07-23 00:16:18,262 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-07-23 00:16:18,275 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 00:16:18,276 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-23 00:16:18,358 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 00:16:18,371 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@56b5a825, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@10d1d2e5 [2022-07-23 00:16:18,372 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-23 00:16:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 1090 states, 808 states have (on average 1.431930693069307) internal successors, (1157), 841 states have internal predecessors, (1157), 229 states have call successors, (229), 52 states have call predecessors, (229), 51 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2022-07-23 00:16:18,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-23 00:16:18,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:16:18,400 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:16:18,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:16:18,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:16:18,406 INFO L85 PathProgramCache]: Analyzing trace with hash 385485251, now seen corresponding path program 1 times [2022-07-23 00:16:18,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:16:18,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015885613] [2022-07-23 00:16:18,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:16:18,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:16:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:18,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:16:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:18,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 00:16:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:18,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 00:16:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:18,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 00:16:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:18,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 00:16:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:18,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:16:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:18,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 00:16:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-23 00:16:18,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:16:18,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015885613] [2022-07-23 00:16:18,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015885613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:16:18,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:16:18,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 00:16:18,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547047647] [2022-07-23 00:16:18,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:16:18,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 00:16:18,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:16:18,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 00:16:18,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 00:16:18,943 INFO L87 Difference]: Start difference. First operand has 1090 states, 808 states have (on average 1.431930693069307) internal successors, (1157), 841 states have internal predecessors, (1157), 229 states have call successors, (229), 52 states have call predecessors, (229), 51 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-23 00:16:21,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:16:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:16:23,533 INFO L93 Difference]: Finished difference Result 2928 states and 4383 transitions. [2022-07-23 00:16:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 00:16:23,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-07-23 00:16:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:16:23,575 INFO L225 Difference]: With dead ends: 2928 [2022-07-23 00:16:23,575 INFO L226 Difference]: Without dead ends: 1758 [2022-07-23 00:16:23,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:16:23,599 INFO L413 NwaCegarLoop]: 1698 mSDtfsCounter, 1444 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 499 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 3244 SdHoareTripleChecker+Invalid, 1837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-23 00:16:23,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 3244 Invalid, 1837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 1337 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-07-23 00:16:23,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2022-07-23 00:16:23,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1599. [2022-07-23 00:16:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1178 states have (on average 1.403225806451613) internal successors, (1653), 1211 states have internal predecessors, (1653), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-23 00:16:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2318 transitions. [2022-07-23 00:16:23,799 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2318 transitions. Word has length 63 [2022-07-23 00:16:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:16:23,800 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2318 transitions. [2022-07-23 00:16:23,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-23 00:16:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2318 transitions. [2022-07-23 00:16:23,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-23 00:16:23,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:16:23,817 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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-23 00:16:23,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 00:16:23,817 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:16:23,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:16:23,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1548414277, now seen corresponding path program 1 times [2022-07-23 00:16:23,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:16:23,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432700176] [2022-07-23 00:16:23,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:16:23,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:16:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:23,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:16:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:24,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 00:16:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:24,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 00:16:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:24,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 00:16:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:24,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 00:16:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:24,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:16:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:24,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 00:16:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:24,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 00:16:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:24,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:16:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:24,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 00:16:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:24,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 00:16:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:24,073 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-23 00:16:24,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:16:24,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432700176] [2022-07-23 00:16:24,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432700176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:16:24,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:16:24,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:16:24,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133677405] [2022-07-23 00:16:24,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:16:24,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:16:24,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:16:24,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:16:24,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:16:24,079 INFO L87 Difference]: Start difference. First operand 1599 states and 2318 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-23 00:16:26,607 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:16:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:16:27,864 INFO L93 Difference]: Finished difference Result 3364 states and 4935 transitions. [2022-07-23 00:16:27,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 00:16:27,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2022-07-23 00:16:27,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:16:27,880 INFO L225 Difference]: With dead ends: 3364 [2022-07-23 00:16:27,881 INFO L226 Difference]: Without dead ends: 1789 [2022-07-23 00:16:27,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:16:27,894 INFO L413 NwaCegarLoop]: 1472 mSDtfsCounter, 1824 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 555 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 2556 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-23 00:16:27,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1955 Valid, 2556 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 766 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-07-23 00:16:27,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2022-07-23 00:16:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1599. [2022-07-23 00:16:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1178 states have (on average 1.401528013582343) internal successors, (1651), 1211 states have internal predecessors, (1651), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-23 00:16:27,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2316 transitions. [2022-07-23 00:16:27,982 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2316 transitions. Word has length 104 [2022-07-23 00:16:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:16:27,983 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2316 transitions. [2022-07-23 00:16:27,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-23 00:16:27,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2316 transitions. [2022-07-23 00:16:27,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-23 00:16:27,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:16:27,988 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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-23 00:16:27,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 00:16:27,989 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:16:27,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:16:27,989 INFO L85 PathProgramCache]: Analyzing trace with hash -480171833, now seen corresponding path program 1 times [2022-07-23 00:16:27,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:16:27,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207941654] [2022-07-23 00:16:27,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:16:27,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:16:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:28,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:16:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:28,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 00:16:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:28,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 00:16:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:28,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 00:16:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:28,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 00:16:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:28,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:16:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:28,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 00:16:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:28,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 00:16:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:28,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:16:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:28,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 00:16:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:28,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 00:16:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-23 00:16:28,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:16:28,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207941654] [2022-07-23 00:16:28,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207941654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:16:28,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:16:28,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 00:16:28,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881849129] [2022-07-23 00:16:28,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:16:28,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:16:28,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:16:28,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:16:28,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:16:28,171 INFO L87 Difference]: Start difference. First operand 1599 states and 2316 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-23 00:16:30,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:16:32,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:16:32,312 INFO L93 Difference]: Finished difference Result 3368 states and 4935 transitions. [2022-07-23 00:16:32,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:16:32,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2022-07-23 00:16:32,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:16:32,321 INFO L225 Difference]: With dead ends: 3368 [2022-07-23 00:16:32,321 INFO L226 Difference]: Without dead ends: 1789 [2022-07-23 00:16:32,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:16:32,329 INFO L413 NwaCegarLoop]: 1484 mSDtfsCounter, 557 mSDsluCounter, 2887 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 257 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 4371 SdHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:16:32,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 4371 Invalid, 2474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 2216 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-07-23 00:16:32,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2022-07-23 00:16:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1599. [2022-07-23 00:16:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1178 states have (on average 1.399830220713073) internal successors, (1649), 1211 states have internal predecessors, (1649), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-23 00:16:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2314 transitions. [2022-07-23 00:16:32,401 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2314 transitions. Word has length 104 [2022-07-23 00:16:32,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:16:32,401 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2314 transitions. [2022-07-23 00:16:32,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-23 00:16:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2314 transitions. [2022-07-23 00:16:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-23 00:16:32,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:16:32,406 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:16:32,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 00:16:32,406 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:16:32,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:16:32,407 INFO L85 PathProgramCache]: Analyzing trace with hash -899814917, now seen corresponding path program 1 times [2022-07-23 00:16:32,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:16:32,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957096573] [2022-07-23 00:16:32,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:16:32,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:16:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:32,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:16:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:32,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 00:16:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:32,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 00:16:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:32,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 00:16:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:32,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 00:16:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:32,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:16:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:32,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 00:16:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:32,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 00:16:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:32,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:16:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:32,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 00:16:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:32,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:16:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 00:16:32,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:16:32,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957096573] [2022-07-23 00:16:32,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957096573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:16:32,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:16:32,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 00:16:32,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499534524] [2022-07-23 00:16:32,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:16:32,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:16:32,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:16:32,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:16:32,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:16:32,603 INFO L87 Difference]: Start difference. First operand 1599 states and 2314 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-23 00:16:34,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:16:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:16:38,764 INFO L93 Difference]: Finished difference Result 2380 states and 3634 transitions. [2022-07-23 00:16:38,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 00:16:38,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2022-07-23 00:16:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:16:38,782 INFO L225 Difference]: With dead ends: 2380 [2022-07-23 00:16:38,782 INFO L226 Difference]: Without dead ends: 2377 [2022-07-23 00:16:38,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:16:38,785 INFO L413 NwaCegarLoop]: 2082 mSDtfsCounter, 1808 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 732 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1928 SdHoareTripleChecker+Valid, 5203 SdHoareTripleChecker+Invalid, 2830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 732 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:16:38,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1928 Valid, 5203 Invalid, 2830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [732 Valid, 2097 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-07-23 00:16:38,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2022-07-23 00:16:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1601. [2022-07-23 00:16:38,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1180 states have (on average 1.3991525423728814) internal successors, (1651), 1213 states have internal predecessors, (1651), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-23 00:16:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2316 transitions. [2022-07-23 00:16:38,867 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2316 transitions. Word has length 107 [2022-07-23 00:16:38,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:16:38,868 INFO L495 AbstractCegarLoop]: Abstraction has 1601 states and 2316 transitions. [2022-07-23 00:16:38,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-23 00:16:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2316 transitions. [2022-07-23 00:16:38,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-23 00:16:38,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:16:38,873 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:16:38,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 00:16:38,874 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:16:38,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:16:38,874 INFO L85 PathProgramCache]: Analyzing trace with hash 578773151, now seen corresponding path program 1 times [2022-07-23 00:16:38,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:16:38,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958938048] [2022-07-23 00:16:38,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:16:38,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:16:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:38,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:16:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:39,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 00:16:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:39,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 00:16:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:39,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 00:16:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:39,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 00:16:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:39,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:16:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:39,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 00:16:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:39,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 00:16:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:39,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:16:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:39,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 00:16:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:39,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:16:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:39,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 00:16:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 00:16:39,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:16:39,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958938048] [2022-07-23 00:16:39,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958938048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:16:39,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:16:39,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 00:16:39,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085938046] [2022-07-23 00:16:39,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:16:39,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:16:39,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:16:39,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:16:39,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:16:39,131 INFO L87 Difference]: Start difference. First operand 1601 states and 2316 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-23 00:16:41,691 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:16:44,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:16:44,369 INFO L93 Difference]: Finished difference Result 3957 states and 5919 transitions. [2022-07-23 00:16:44,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:16:44,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2022-07-23 00:16:44,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:16:44,383 INFO L225 Difference]: With dead ends: 3957 [2022-07-23 00:16:44,383 INFO L226 Difference]: Without dead ends: 2380 [2022-07-23 00:16:44,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-23 00:16:44,389 INFO L413 NwaCegarLoop]: 1837 mSDtfsCounter, 2450 mSDsluCounter, 2337 mSDsCounter, 0 mSdLazyCounter, 2141 mSolverCounterSat, 732 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2705 SdHoareTripleChecker+Valid, 4174 SdHoareTripleChecker+Invalid, 2873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 732 IncrementalHoareTripleChecker+Valid, 2141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:16:44,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2705 Valid, 4174 Invalid, 2873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [732 Valid, 2141 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-23 00:16:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2022-07-23 00:16:44,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1602. [2022-07-23 00:16:44,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1181 states have (on average 1.3988145639288738) internal successors, (1652), 1214 states have internal predecessors, (1652), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-23 00:16:44,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2317 transitions. [2022-07-23 00:16:44,468 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2317 transitions. Word has length 117 [2022-07-23 00:16:44,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:16:44,469 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 2317 transitions. [2022-07-23 00:16:44,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-23 00:16:44,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2317 transitions. [2022-07-23 00:16:44,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-23 00:16:44,474 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:16:44,475 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:16:44,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 00:16:44,475 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:16:44,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:16:44,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1349496606, now seen corresponding path program 1 times [2022-07-23 00:16:44,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:16:44,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54081614] [2022-07-23 00:16:44,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:16:44,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:16:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:44,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:16:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:44,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 00:16:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:44,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 00:16:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:44,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 00:16:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:44,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 00:16:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:44,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:16:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:44,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 00:16:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:44,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 00:16:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:44,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:16:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:44,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 00:16:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:44,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:16:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:44,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 00:16:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 00:16:44,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:16:44,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54081614] [2022-07-23 00:16:44,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54081614] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:16:44,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:16:44,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:16:44,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183237693] [2022-07-23 00:16:44,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:16:44,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:16:44,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:16:44,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:16:44,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:16:44,692 INFO L87 Difference]: Start difference. First operand 1602 states and 2317 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-23 00:16:47,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:16:49,965 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:16:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:16:53,501 INFO L93 Difference]: Finished difference Result 3312 states and 5203 transitions. [2022-07-23 00:16:53,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 00:16:53,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2022-07-23 00:16:53,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:16:53,522 INFO L225 Difference]: With dead ends: 3312 [2022-07-23 00:16:53,522 INFO L226 Difference]: Without dead ends: 3309 [2022-07-23 00:16:53,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-23 00:16:53,525 INFO L413 NwaCegarLoop]: 2513 mSDtfsCounter, 2306 mSDsluCounter, 6393 mSDsCounter, 0 mSdLazyCounter, 3798 mSolverCounterSat, 816 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2524 SdHoareTripleChecker+Valid, 8906 SdHoareTripleChecker+Invalid, 4615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 816 IncrementalHoareTripleChecker+Valid, 3798 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-07-23 00:16:53,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2524 Valid, 8906 Invalid, 4615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [816 Valid, 3798 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2022-07-23 00:16:53,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2022-07-23 00:16:53,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1604. [2022-07-23 00:16:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1182 states have (on average 1.398477157360406) internal successors, (1653), 1214 states have internal predecessors, (1653), 334 states have call successors, (334), 89 states have call predecessors, (334), 87 states have return successors, (333), 329 states have call predecessors, (333), 333 states have call successors, (333) [2022-07-23 00:16:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2320 transitions. [2022-07-23 00:16:53,639 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2320 transitions. Word has length 119 [2022-07-23 00:16:53,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:16:53,640 INFO L495 AbstractCegarLoop]: Abstraction has 1604 states and 2320 transitions. [2022-07-23 00:16:53,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-23 00:16:53,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2320 transitions. [2022-07-23 00:16:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-23 00:16:53,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:16:53,649 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:16:53,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 00:16:53,650 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:16:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:16:53,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1867335849, now seen corresponding path program 1 times [2022-07-23 00:16:53,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:16:53,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668323359] [2022-07-23 00:16:53,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:16:53,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:16:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:16:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 00:16:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 00:16:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 00:16:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 00:16:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:16:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 00:16:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 00:16:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:16:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 00:16:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:16:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 00:16:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 00:16:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 00:16:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-23 00:16:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 00:16:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:16:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-23 00:16:53,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:16:53,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668323359] [2022-07-23 00:16:53,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668323359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:16:53,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:16:53,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:16:53,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049113487] [2022-07-23 00:16:53,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:16:53,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:16:53,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:16:53,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:16:53,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:16:53,914 INFO L87 Difference]: Start difference. First operand 1604 states and 2320 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-23 00:16:57,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:16:59,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:17:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:17:00,978 INFO L93 Difference]: Finished difference Result 3997 states and 5840 transitions. [2022-07-23 00:17:00,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 00:17:00,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 149 [2022-07-23 00:17:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:17:00,996 INFO L225 Difference]: With dead ends: 3997 [2022-07-23 00:17:00,997 INFO L226 Difference]: Without dead ends: 2417 [2022-07-23 00:17:01,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:17:01,002 INFO L413 NwaCegarLoop]: 2208 mSDtfsCounter, 2304 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 886 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2489 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 886 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-23 00:17:01,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 3569 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [886 Valid, 1149 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-07-23 00:17:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2022-07-23 00:17:01,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2144. [2022-07-23 00:17:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 1571 states have (on average 1.3908338637810311) internal successors, (2185), 1612 states have internal predecessors, (2185), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-23 00:17:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 3080 transitions. [2022-07-23 00:17:01,147 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 3080 transitions. Word has length 149 [2022-07-23 00:17:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:17:01,147 INFO L495 AbstractCegarLoop]: Abstraction has 2144 states and 3080 transitions. [2022-07-23 00:17:01,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-23 00:17:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 3080 transitions. [2022-07-23 00:17:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-23 00:17:01,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:17:01,159 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:17:01,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 00:17:01,159 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:17:01,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:17:01,160 INFO L85 PathProgramCache]: Analyzing trace with hash 178046639, now seen corresponding path program 1 times [2022-07-23 00:17:01,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:17:01,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571280270] [2022-07-23 00:17:01,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:17:01,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:17:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:17:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 00:17:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 00:17:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 00:17:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 00:17:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:17:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 00:17:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 00:17:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:17:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 00:17:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:17:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 00:17:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-23 00:17:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-23 00:17:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 00:17:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 00:17:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:01,386 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-23 00:17:01,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:17:01,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571280270] [2022-07-23 00:17:01,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571280270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:17:01,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:17:01,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 00:17:01,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396614077] [2022-07-23 00:17:01,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:17:01,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:17:01,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:17:01,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:17:01,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:17:01,389 INFO L87 Difference]: Start difference. First operand 2144 states and 3080 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-23 00:17:04,517 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:17:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:17:06,859 INFO L93 Difference]: Finished difference Result 4586 states and 6826 transitions. [2022-07-23 00:17:06,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:17:06,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 151 [2022-07-23 00:17:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:17:06,877 INFO L225 Difference]: With dead ends: 4586 [2022-07-23 00:17:06,877 INFO L226 Difference]: Without dead ends: 3006 [2022-07-23 00:17:06,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-23 00:17:06,883 INFO L413 NwaCegarLoop]: 2006 mSDtfsCounter, 2750 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 941 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3005 SdHoareTripleChecker+Valid, 3730 SdHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 941 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-23 00:17:06,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3005 Valid, 3730 Invalid, 2702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [941 Valid, 1760 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-07-23 00:17:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2022-07-23 00:17:07,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2148. [2022-07-23 00:17:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 1575 states have (on average 1.3904761904761904) internal successors, (2190), 1616 states have internal predecessors, (2190), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-23 00:17:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 3085 transitions. [2022-07-23 00:17:07,043 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 3085 transitions. Word has length 151 [2022-07-23 00:17:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:17:07,044 INFO L495 AbstractCegarLoop]: Abstraction has 2148 states and 3085 transitions. [2022-07-23 00:17:07,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-23 00:17:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 3085 transitions. [2022-07-23 00:17:07,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-23 00:17:07,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:17:07,055 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:17:07,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 00:17:07,055 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:17:07,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:17:07,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1182989250, now seen corresponding path program 1 times [2022-07-23 00:17:07,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:17:07,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280832269] [2022-07-23 00:17:07,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:17:07,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:17:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:17:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 00:17:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 00:17:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 00:17:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 00:17:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:17:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 00:17:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 00:17:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:17:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 00:17:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:17:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 00:17:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 00:17:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 00:17:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-23 00:17:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-23 00:17:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-23 00:17:07,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:17:07,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280832269] [2022-07-23 00:17:07,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280832269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:17:07,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:17:07,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 00:17:07,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985246321] [2022-07-23 00:17:07,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:17:07,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 00:17:07,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:17:07,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 00:17:07,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 00:17:07,276 INFO L87 Difference]: Start difference. First operand 2148 states and 3085 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 00:17:09,404 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:17:12,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:17:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:17:13,907 INFO L93 Difference]: Finished difference Result 4546 states and 6642 transitions. [2022-07-23 00:17:13,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 00:17:13,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 154 [2022-07-23 00:17:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:17:13,924 INFO L225 Difference]: With dead ends: 4546 [2022-07-23 00:17:13,925 INFO L226 Difference]: Without dead ends: 2422 [2022-07-23 00:17:13,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:17:13,933 INFO L413 NwaCegarLoop]: 1478 mSDtfsCounter, 551 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 265 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 3470 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-23 00:17:13,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 3470 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1471 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-07-23 00:17:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2022-07-23 00:17:14,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2148. [2022-07-23 00:17:14,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 1575 states have (on average 1.3847619047619049) internal successors, (2181), 1616 states have internal predecessors, (2181), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-23 00:17:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 3076 transitions. [2022-07-23 00:17:14,075 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 3076 transitions. Word has length 154 [2022-07-23 00:17:14,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:17:14,076 INFO L495 AbstractCegarLoop]: Abstraction has 2148 states and 3076 transitions. [2022-07-23 00:17:14,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 00:17:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 3076 transitions. [2022-07-23 00:17:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-23 00:17:14,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:17:14,087 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 00:17:14,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 00:17:14,087 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:17:14,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:17:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1835092685, now seen corresponding path program 1 times [2022-07-23 00:17:14,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:17:14,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342364246] [2022-07-23 00:17:14,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:17:14,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:17:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:17:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 00:17:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 00:17:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 00:17:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 00:17:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:17:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 00:17:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 00:17:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:17:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 00:17:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:17:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 00:17:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 00:17:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 00:17:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-23 00:17:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-23 00:17:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-23 00:17:14,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:17:14,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342364246] [2022-07-23 00:17:14,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342364246] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:17:14,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186570180] [2022-07-23 00:17:14,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:17:14,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:17:14,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:17:14,331 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-23 00:17:14,367 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-23 00:17:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:14,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 00:17:14,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:17:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 00:17:15,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:17:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-23 00:17:15,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186570180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 00:17:15,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 00:17:15,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 12 [2022-07-23 00:17:15,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996919783] [2022-07-23 00:17:15,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 00:17:15,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 00:17:15,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:17:15,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 00:17:15,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-23 00:17:15,350 INFO L87 Difference]: Start difference. First operand 2148 states and 3076 transitions. Second operand has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 10 states have internal predecessors, (185), 4 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2022-07-23 00:17:17,576 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:17:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:17:22,864 INFO L93 Difference]: Finished difference Result 6340 states and 9749 transitions. [2022-07-23 00:17:22,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 00:17:22,865 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 10 states have internal predecessors, (185), 4 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) Word has length 157 [2022-07-23 00:17:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:17:22,889 INFO L225 Difference]: With dead ends: 6340 [2022-07-23 00:17:22,890 INFO L226 Difference]: Without dead ends: 4756 [2022-07-23 00:17:22,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-07-23 00:17:22,897 INFO L413 NwaCegarLoop]: 2674 mSDtfsCounter, 5998 mSDsluCounter, 4316 mSDsCounter, 0 mSdLazyCounter, 3990 mSolverCounterSat, 2195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6373 SdHoareTripleChecker+Valid, 6990 SdHoareTripleChecker+Invalid, 6185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2195 IncrementalHoareTripleChecker+Valid, 3990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:17:22,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6373 Valid, 6990 Invalid, 6185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2195 Valid, 3990 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-23 00:17:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2022-07-23 00:17:23,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 2155. [2022-07-23 00:17:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 1582 states have (on average 1.384323640960809) internal successors, (2190), 1623 states have internal predecessors, (2190), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-23 00:17:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 3085 transitions. [2022-07-23 00:17:23,093 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 3085 transitions. Word has length 157 [2022-07-23 00:17:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:17:23,094 INFO L495 AbstractCegarLoop]: Abstraction has 2155 states and 3085 transitions. [2022-07-23 00:17:23,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 10 states have internal predecessors, (185), 4 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2022-07-23 00:17:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 3085 transitions. [2022-07-23 00:17:23,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-23 00:17:23,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:17:23,104 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:17:23,138 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-23 00:17:23,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-23 00:17:23,328 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:17:23,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:17:23,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1991118289, now seen corresponding path program 1 times [2022-07-23 00:17:23,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:17:23,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180528956] [2022-07-23 00:17:23,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:17:23,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:17:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:17:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 00:17:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 00:17:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 00:17:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 00:17:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:17:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 00:17:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 00:17:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:17:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 00:17:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:17:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 00:17:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:17:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 00:17:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 00:17:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 00:17:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 00:17:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-23 00:17:23,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:17:23,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180528956] [2022-07-23 00:17:23,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180528956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:17:23,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992079258] [2022-07-23 00:17:23,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:17:23,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:17:23,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:17:23,724 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-23 00:17:23,725 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-23 00:17:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:24,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 00:17:24,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:17:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-23 00:17:24,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:17:24,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992079258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:17:24,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:17:24,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2022-07-23 00:17:24,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377620535] [2022-07-23 00:17:24,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:17:24,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 00:17:24,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:17:24,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 00:17:24,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-23 00:17:24,281 INFO L87 Difference]: Start difference. First operand 2155 states and 3085 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 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-23 00:17:24,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:17:24,764 INFO L93 Difference]: Finished difference Result 4676 states and 6864 transitions. [2022-07-23 00:17:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 00:17:24,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 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 166 [2022-07-23 00:17:24,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:17:24,794 INFO L225 Difference]: With dead ends: 4676 [2022-07-23 00:17:24,795 INFO L226 Difference]: Without dead ends: 3085 [2022-07-23 00:17:24,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-23 00:17:24,802 INFO L413 NwaCegarLoop]: 2170 mSDtfsCounter, 926 mSDsluCounter, 3624 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 5794 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 00:17:24,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 5794 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 00:17:24,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2022-07-23 00:17:24,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 2157. [2022-07-23 00:17:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 1584 states have (on average 1.3838383838383839) internal successors, (2192), 1625 states have internal predecessors, (2192), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-23 00:17:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 3087 transitions. [2022-07-23 00:17:25,024 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 3087 transitions. Word has length 166 [2022-07-23 00:17:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:17:25,025 INFO L495 AbstractCegarLoop]: Abstraction has 2157 states and 3087 transitions. [2022-07-23 00:17:25,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 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-23 00:17:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 3087 transitions. [2022-07-23 00:17:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-23 00:17:25,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:17:25,036 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:17:25,067 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-23 00:17:25,259 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,SelfDestructingSolverStorable10 [2022-07-23 00:17:25,260 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:17:25,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:17:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash -530211425, now seen corresponding path program 1 times [2022-07-23 00:17:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:17:25,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222393125] [2022-07-23 00:17:25,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:17:25,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:17:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:17:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 00:17:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 00:17:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 00:17:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 00:17:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:17:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 00:17:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 00:17:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:17:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 00:17:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:17:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 00:17:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:17:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 00:17:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 00:17:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 00:17:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 00:17:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-23 00:17:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 00:17:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-23 00:17:25,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:17:25,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222393125] [2022-07-23 00:17:25,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222393125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:17:25,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:17:25,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 00:17:25,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400692040] [2022-07-23 00:17:25,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:17:25,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:17:25,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:17:25,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:17:25,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:17:25,472 INFO L87 Difference]: Start difference. First operand 2157 states and 3087 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 00:17:27,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:17:30,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:17:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:17:33,567 INFO L93 Difference]: Finished difference Result 4652 states and 6903 transitions. [2022-07-23 00:17:33,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 00:17:33,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 175 [2022-07-23 00:17:33,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:17:33,582 INFO L225 Difference]: With dead ends: 4652 [2022-07-23 00:17:33,583 INFO L226 Difference]: Without dead ends: 3059 [2022-07-23 00:17:33,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-23 00:17:33,591 INFO L413 NwaCegarLoop]: 1984 mSDtfsCounter, 1541 mSDsluCounter, 3129 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 714 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1686 SdHoareTripleChecker+Valid, 5113 SdHoareTripleChecker+Invalid, 3263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 714 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-23 00:17:33,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1686 Valid, 5113 Invalid, 3263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [714 Valid, 2547 Invalid, 2 Unknown, 0 Unchecked, 7.7s Time] [2022-07-23 00:17:33,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2022-07-23 00:17:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2159. [2022-07-23 00:17:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2159 states, 1586 states have (on average 1.3833543505674653) internal successors, (2194), 1627 states have internal predecessors, (2194), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-23 00:17:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 3089 transitions. [2022-07-23 00:17:33,822 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 3089 transitions. Word has length 175 [2022-07-23 00:17:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:17:33,822 INFO L495 AbstractCegarLoop]: Abstraction has 2159 states and 3089 transitions. [2022-07-23 00:17:33,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 00:17:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 3089 transitions. [2022-07-23 00:17:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-23 00:17:33,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:17:33,833 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:17:33,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 00:17:33,834 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:17:33,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:17:33,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1482100280, now seen corresponding path program 1 times [2022-07-23 00:17:33,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:17:33,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931806019] [2022-07-23 00:17:33,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:17:33,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:17:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:17:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 00:17:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 00:17:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 00:17:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 00:17:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:17:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 00:17:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 00:17:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:17:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 00:17:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:17:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 00:17:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:17:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-23 00:17:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 00:17:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 00:17:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-23 00:17:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-23 00:17:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-23 00:17:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 00:17:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-23 00:17:34,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:17:34,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931806019] [2022-07-23 00:17:34,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931806019] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:17:34,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107366292] [2022-07-23 00:17:34,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:17:34,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:17:34,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:17:34,218 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-23 00:17:34,220 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-23 00:17:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:35,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 1502 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-23 00:17:35,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:17:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-23 00:17:35,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 00:17:35,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107366292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:17:35,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 00:17:35,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2022-07-23 00:17:35,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36093803] [2022-07-23 00:17:35,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:17:35,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:17:35,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:17:35,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:17:35,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-23 00:17:35,165 INFO L87 Difference]: Start difference. First operand 2159 states and 3089 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 00:17:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:17:35,703 INFO L93 Difference]: Finished difference Result 4849 states and 7125 transitions. [2022-07-23 00:17:35,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 00:17:35,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 183 [2022-07-23 00:17:35,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:17:35,714 INFO L225 Difference]: With dead ends: 4849 [2022-07-23 00:17:35,715 INFO L226 Difference]: Without dead ends: 3254 [2022-07-23 00:17:35,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-23 00:17:35,722 INFO L413 NwaCegarLoop]: 2279 mSDtfsCounter, 1174 mSDsluCounter, 8352 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 10631 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 00:17:35,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 10631 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 00:17:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2022-07-23 00:17:35,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 2164. [2022-07-23 00:17:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2164 states, 1590 states have (on average 1.3823899371069182) internal successors, (2198), 1631 states have internal predecessors, (2198), 448 states have call successors, (448), 126 states have call predecessors, (448), 125 states have return successors, (451), 442 states have call predecessors, (451), 447 states have call successors, (451) [2022-07-23 00:17:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 3097 transitions. [2022-07-23 00:17:35,945 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 3097 transitions. Word has length 183 [2022-07-23 00:17:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:17:35,949 INFO L495 AbstractCegarLoop]: Abstraction has 2164 states and 3097 transitions. [2022-07-23 00:17:35,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 00:17:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 3097 transitions. [2022-07-23 00:17:35,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-23 00:17:35,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:17:35,962 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:17:36,010 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-23 00:17:36,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:17:36,196 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:17:36,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:17:36,196 INFO L85 PathProgramCache]: Analyzing trace with hash 503652149, now seen corresponding path program 1 times [2022-07-23 00:17:36,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:17:36,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615685567] [2022-07-23 00:17:36,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:17:36,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:17:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:17:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 00:17:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 00:17:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 00:17:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 00:17:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:17:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 00:17:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 00:17:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:17:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-23 00:17:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 00:17:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 00:17:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 00:17:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:17:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 00:17:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 00:17:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-23 00:17:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 00:17:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-23 00:17:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 00:17:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 00:17:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-23 00:17:36,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:17:36,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615685567] [2022-07-23 00:17:36,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615685567] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:17:36,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544471569] [2022-07-23 00:17:36,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:17:36,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:17:36,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:17:36,595 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-23 00:17:36,596 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-23 00:17:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:17:37,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 152 conjunts are in the unsatisfiable core [2022-07-23 00:17:37,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:17:37,716 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-23 00:17:37,984 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-23 00:17:37,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-23 00:17:38,009 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-23 00:17:38,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,089 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 29 treesize of output 28 [2022-07-23 00:17:38,101 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-23 00:17:38,102 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 33 [2022-07-23 00:17:38,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,113 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 23 treesize of output 22 [2022-07-23 00:17:38,367 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-23 00:17:38,367 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 2 case distinctions, treesize of input 28 treesize of output 31 [2022-07-23 00:17:38,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2022-07-23 00:17:38,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-07-23 00:17:38,602 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-23 00:17:38,603 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-07-23 00:17:38,607 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 25 treesize of output 25 [2022-07-23 00:17:38,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2022-07-23 00:17:38,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2022-07-23 00:17:38,633 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 33 treesize of output 33 [2022-07-23 00:17:38,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 00:17:38,764 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-23 00:17:38,764 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2022-07-23 00:17:38,768 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 25 treesize of output 25 [2022-07-23 00:17:38,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,779 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-23 00:17:38,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,785 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-07-23 00:17:38,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 00:17:38,793 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 33 treesize of output 33 [2022-07-23 00:17:38,988 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-23 00:17:38,989 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 3 case distinctions, treesize of input 32 treesize of output 34 [2022-07-23 00:17:38,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:38,998 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 33 [2022-07-23 00:17:39,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:39,003 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 29 treesize of output 28 [2022-07-23 00:17:39,268 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-23 00:17:39,269 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 3 case distinctions, treesize of input 32 treesize of output 34 [2022-07-23 00:17:39,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:39,279 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 33 [2022-07-23 00:17:39,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:39,284 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 29 treesize of output 28 [2022-07-23 00:17:39,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:39,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:39,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 105 [2022-07-23 00:17:39,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:39,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 113 treesize of output 77 [2022-07-23 00:17:39,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:17:39,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 60 treesize of output 30 [2022-07-23 00:17:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 64 proven. 7 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-23 00:17:39,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:17:39,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_831) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_832) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_830) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (not (<= .cse0 2147483647)) (<= .cse0 0)))) is different from false [2022-07-23 00:17:39,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544471569] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:17:39,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 00:17:39,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 30] total 40 [2022-07-23 00:17:39,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693342855] [2022-07-23 00:17:39,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 00:17:39,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-23 00:17:39,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:17:39,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-23 00:17:39,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1441, Unknown=1, NotChecked=76, Total=1640 [2022-07-23 00:17:39,824 INFO L87 Difference]: Start difference. First operand 2164 states and 3097 transitions. Second operand has 40 states, 39 states have (on average 5.641025641025641) internal successors, (220), 29 states have internal predecessors, (220), 10 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (35), 14 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-23 00:17:43,839 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:17:46,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:17:50,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:17:52,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:17:56,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:07,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:18:07,555 INFO L93 Difference]: Finished difference Result 5266 states and 7930 transitions. [2022-07-23 00:18:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-23 00:18:07,555 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.641025641025641) internal successors, (220), 29 states have internal predecessors, (220), 10 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (35), 14 states have call predecessors, (35), 10 states have call successors, (35) Word has length 189 [2022-07-23 00:18:07,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:18:07,570 INFO L225 Difference]: With dead ends: 5266 [2022-07-23 00:18:07,570 INFO L226 Difference]: Without dead ends: 3645 [2022-07-23 00:18:07,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 205 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=417, Invalid=4278, Unknown=1, NotChecked=134, Total=4830 [2022-07-23 00:18:07,577 INFO L413 NwaCegarLoop]: 2369 mSDtfsCounter, 5190 mSDsluCounter, 22009 mSDsCounter, 0 mSdLazyCounter, 24903 mSolverCounterSat, 2800 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5370 SdHoareTripleChecker+Valid, 24378 SdHoareTripleChecker+Invalid, 30154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2800 IncrementalHoareTripleChecker+Valid, 24903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2451 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2022-07-23 00:18:07,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5370 Valid, 24378 Invalid, 30154 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2800 Valid, 24903 Invalid, 0 Unknown, 2451 Unchecked, 26.3s Time] [2022-07-23 00:18:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645 states. [2022-07-23 00:18:07,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 2180. [2022-07-23 00:18:07,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 1601 states have (on average 1.3797626483447845) internal successors, (2209), 1644 states have internal predecessors, (2209), 448 states have call successors, (448), 126 states have call predecessors, (448), 130 states have return successors, (465), 445 states have call predecessors, (465), 447 states have call successors, (465) [2022-07-23 00:18:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3122 transitions. [2022-07-23 00:18:07,849 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3122 transitions. Word has length 189 [2022-07-23 00:18:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:18:07,850 INFO L495 AbstractCegarLoop]: Abstraction has 2180 states and 3122 transitions. [2022-07-23 00:18:07,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.641025641025641) internal successors, (220), 29 states have internal predecessors, (220), 10 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (35), 14 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-23 00:18:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3122 transitions. [2022-07-23 00:18:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-23 00:18:07,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:18:07,862 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 00:18:07,899 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-23 00:18:08,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:18:08,080 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:18:08,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:18:08,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1115474398, now seen corresponding path program 1 times [2022-07-23 00:18:08,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:18:08,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385749258] [2022-07-23 00:18:08,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:18:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:18:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:18:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-23 00:18:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 00:18:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 00:18:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 00:18:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-23 00:18:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 00:18:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 00:18:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:18:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:18:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-23 00:18:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 00:18:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 00:18:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 00:18:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 00:18:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 00:18:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-23 00:18:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-23 00:18:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-23 00:18:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 00:18:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-23 00:18:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-23 00:18:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-23 00:18:09,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:18:09,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385749258] [2022-07-23 00:18:09,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385749258] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:18:09,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420045650] [2022-07-23 00:18:09,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:18:09,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 00:18:09,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:18:09,958 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-23 00:18:09,960 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-23 00:18:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:18:10,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 1554 conjuncts, 187 conjunts are in the unsatisfiable core [2022-07-23 00:18:10,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 00:18:10,719 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 00:18:11,249 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 5 treesize of output 3 [2022-07-23 00:18:11,492 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 5 treesize of output 3 [2022-07-23 00:18:11,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:11,850 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-07-23 00:18:11,851 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 4 case distinctions, treesize of input 20 treesize of output 30 [2022-07-23 00:18:12,030 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 5 treesize of output 3 [2022-07-23 00:18:12,172 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 00:18:12,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 00:18:12,385 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 13 treesize of output 9 [2022-07-23 00:18:12,853 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 13 treesize of output 9 [2022-07-23 00:18:12,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:12,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:12,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:12,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-23 00:18:12,877 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 13 treesize of output 9 [2022-07-23 00:18:12,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:12,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2022-07-23 00:18:13,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-23 00:18:13,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 00:18:13,381 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-23 00:18:13,381 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 2 case distinctions, treesize of input 28 treesize of output 31 [2022-07-23 00:18:13,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2022-07-23 00:18:13,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-07-23 00:18:13,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2022-07-23 00:18:13,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2022-07-23 00:18:13,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2022-07-23 00:18:13,746 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 22 treesize of output 24 [2022-07-23 00:18:13,752 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 33 treesize of output 33 [2022-07-23 00:18:13,758 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 16 treesize of output 18 [2022-07-23 00:18:13,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,952 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-23 00:18:13,966 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-23 00:18:13,967 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2022-07-23 00:18:13,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 00:18:13,977 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 42 treesize of output 40 [2022-07-23 00:18:13,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:13,988 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-23 00:18:13,994 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-23 00:18:14,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:14,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:14,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:14,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2022-07-23 00:18:14,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:14,411 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 29 treesize of output 28 [2022-07-23 00:18:14,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:14,428 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 23 treesize of output 22 [2022-07-23 00:18:14,945 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-23 00:18:14,946 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 23 treesize of output 22 [2022-07-23 00:18:14,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:14,955 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 29 treesize of output 28 [2022-07-23 00:18:14,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:14,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:14,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:14,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2022-07-23 00:18:15,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:15,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 132 treesize of output 102 [2022-07-23 00:18:15,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:15,821 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 00:18:15,821 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 1 case distinctions, treesize of input 122 treesize of output 80 [2022-07-23 00:18:15,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 00:18:15,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 60 treesize of output 30 [2022-07-23 00:18:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 64 proven. 13 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-23 00:18:15,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 00:18:15,930 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1105) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1107) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1106) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (<= .cse0 0) (not (<= .cse0 2147483647))))) is different from false [2022-07-23 00:18:15,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420045650] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 00:18:15,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 00:18:15,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 68 [2022-07-23 00:18:15,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683033976] [2022-07-23 00:18:15,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 00:18:15,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-07-23 00:18:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:18:15,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-07-23 00:18:15,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4355, Unknown=1, NotChecked=132, Total=4692 [2022-07-23 00:18:15,956 INFO L87 Difference]: Start difference. First operand 2180 states and 3122 transitions. Second operand has 68 states, 66 states have (on average 3.515151515151515) internal successors, (232), 54 states have internal predecessors, (232), 22 states have call successors, (45), 13 states have call predecessors, (45), 17 states have return successors, (37), 25 states have call predecessors, (37), 21 states have call successors, (37) [2022-07-23 00:18:19,331 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:21,426 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:23,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:29,876 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:31,966 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:34,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:36,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:38,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:40,284 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:42,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:44,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:46,527 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:48,608 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:50,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:52,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:54,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:56,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:18:58,994 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:19:01,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:19:03,178 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:19:05,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:19:07,340 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:19:09,437 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:19:15,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:19:17,104 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:19:19,190 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:19:43,568 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:19:46,638 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:19:49,702 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:19:53,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:20:02,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:20:04,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:20:05,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:20:07,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []