./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.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 b83c28af83745ba79af1b1ebec4b495db7aa2efb3702685bbdc4b86421ef4c0a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 11:37:34,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 11:37:34,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 11:37:34,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 11:37:34,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 11:37:34,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 11:37:34,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 11:37:34,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 11:37:34,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 11:37:34,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 11:37:34,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 11:37:34,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 11:37:34,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 11:37:34,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 11:37:34,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 11:37:34,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 11:37:34,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 11:37:34,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 11:37:34,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 11:37:34,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 11:37:34,838 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 11:37:34,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 11:37:34,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 11:37:34,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 11:37:34,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 11:37:34,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 11:37:34,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 11:37:34,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 11:37:34,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 11:37:34,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 11:37:34,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 11:37:34,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 11:37:34,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 11:37:34,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 11:37:34,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 11:37:34,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 11:37:34,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 11:37:34,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 11:37:34,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 11:37:34,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 11:37:34,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 11:37:34,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 11:37:34,870 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 11:37:34,910 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 11:37:34,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 11:37:34,911 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 11:37:34,911 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 11:37:34,912 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 11:37:34,912 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 11:37:34,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 11:37:34,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 11:37:34,913 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 11:37:34,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 11:37:34,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 11:37:34,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 11:37:34,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 11:37:34,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 11:37:34,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 11:37:34,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 11:37:34,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 11:37:34,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 11:37:34,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 11:37:34,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 11:37:34,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 11:37:34,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:37:34,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 11:37:34,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 11:37:34,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 11:37:34,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 11:37:34,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 11:37:34,918 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 11:37:34,918 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 11:37:34,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 11:37:34,919 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 -> b83c28af83745ba79af1b1ebec4b495db7aa2efb3702685bbdc4b86421ef4c0a [2022-07-21 11:37:35,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 11:37:35,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 11:37:35,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 11:37:35,218 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 11:37:35,220 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 11:37:35,221 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-21 11:37:35,273 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b7a45f2a/ef581e7e3419429f820c95dcacf1fe7b/FLAG9615f1ecd [2022-07-21 11:37:35,950 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 11:37:35,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-21 11:37:35,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b7a45f2a/ef581e7e3419429f820c95dcacf1fe7b/FLAG9615f1ecd [2022-07-21 11:37:36,254 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b7a45f2a/ef581e7e3419429f820c95dcacf1fe7b [2022-07-21 11:37:36,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 11:37:36,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 11:37:36,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 11:37:36,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 11:37:36,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 11:37:36,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:37:36" (1/1) ... [2022-07-21 11:37:36,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@555853e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:36, skipping insertion in model container [2022-07-21 11:37:36,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:37:36" (1/1) ... [2022-07-21 11:37:36,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 11:37:36,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 11:37:37,479 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.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2022-07-21 11:37:37,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:37:37,524 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 11:37:37,774 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.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2022-07-21 11:37:37,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:37:37,874 INFO L208 MainTranslator]: Completed translation [2022-07-21 11:37:37,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:37 WrapperNode [2022-07-21 11:37:37,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 11:37:37,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 11:37:37,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 11:37:37,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 11:37:37,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:37" (1/1) ... [2022-07-21 11:37:37,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:37" (1/1) ... [2022-07-21 11:37:38,071 INFO L137 Inliner]: procedures = 187, calls = 873, calls flagged for inlining = 93, calls inlined = 91, statements flattened = 3223 [2022-07-21 11:37:38,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 11:37:38,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 11:37:38,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 11:37:38,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 11:37:38,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:37" (1/1) ... [2022-07-21 11:37:38,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:37" (1/1) ... [2022-07-21 11:37:38,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:37" (1/1) ... [2022-07-21 11:37:38,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:37" (1/1) ... [2022-07-21 11:37:38,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:37" (1/1) ... [2022-07-21 11:37:38,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:37" (1/1) ... [2022-07-21 11:37:38,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:37" (1/1) ... [2022-07-21 11:37:38,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 11:37:38,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 11:37:38,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 11:37:38,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 11:37:38,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:37" (1/1) ... [2022-07-21 11:37:38,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:37:38,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:37:38,328 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-21 11:37:38,359 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-21 11:37:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-07-21 11:37:38,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-07-21 11:37:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2022-07-21 11:37:38,366 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2022-07-21 11:37:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 11:37:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-21 11:37:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-07-21 11:37:38,366 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-07-21 11:37:38,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 11:37:38,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 11:37:38,367 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 11:37:38,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 11:37:38,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 11:37:38,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 11:37:38,367 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 11:37:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-21 11:37:38,368 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-21 11:37:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-21 11:37:38,368 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-21 11:37:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-07-21 11:37:38,368 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-07-21 11:37:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 11:37:38,369 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 11:37:38,369 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-21 11:37:38,369 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-21 11:37:38,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 11:37:38,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 11:37:38,369 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-21 11:37:38,369 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-21 11:37:38,370 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-07-21 11:37:38,370 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-07-21 11:37:38,370 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 11:37:38,370 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 11:37:38,370 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-07-21 11:37:38,370 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-07-21 11:37:38,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 11:37:38,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 11:37:38,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 11:37:38,371 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-21 11:37:38,371 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-21 11:37:38,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-21 11:37:38,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-21 11:37:38,372 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 11:37:38,372 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 11:37:38,372 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-21 11:37:38,372 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-21 11:37:38,372 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-07-21 11:37:38,372 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-07-21 11:37:38,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 11:37:38,373 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-07-21 11:37:38,373 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-07-21 11:37:38,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-07-21 11:37:38,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-07-21 11:37:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-07-21 11:37:38,374 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-07-21 11:37:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-07-21 11:37:38,374 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-07-21 11:37:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 11:37:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-21 11:37:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-21 11:37:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-07-21 11:37:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-07-21 11:37:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 11:37:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 11:37:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-21 11:37:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-07-21 11:37:38,377 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-07-21 11:37:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2022-07-21 11:37:38,377 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2022-07-21 11:37:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-21 11:37:38,377 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-21 11:37:38,378 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2022-07-21 11:37:38,378 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2022-07-21 11:37:38,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 11:37:38,378 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-21 11:37:38,378 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-21 11:37:38,379 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-21 11:37:38,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-21 11:37:38,379 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-21 11:37:38,379 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-21 11:37:38,379 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-07-21 11:37:38,379 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-07-21 11:37:38,379 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-07-21 11:37:38,380 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-07-21 11:37:38,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 11:37:38,380 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-07-21 11:37:38,380 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-07-21 11:37:38,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 11:37:38,380 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-07-21 11:37:38,381 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-07-21 11:37:38,381 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-21 11:37:38,381 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-21 11:37:38,381 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2022-07-21 11:37:38,381 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2022-07-21 11:37:38,382 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-21 11:37:38,382 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-21 11:37:38,382 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-21 11:37:38,382 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-21 11:37:38,383 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2022-07-21 11:37:38,383 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2022-07-21 11:37:38,384 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-07-21 11:37:38,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-07-21 11:37:38,384 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-21 11:37:38,384 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-21 11:37:38,384 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-21 11:37:38,384 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-21 11:37:38,384 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-21 11:37:38,384 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-21 11:37:38,385 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-21 11:37:38,385 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-21 11:37:38,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 11:37:38,385 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-21 11:37:38,385 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-21 11:37:38,386 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-07-21 11:37:38,386 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-07-21 11:37:38,386 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-21 11:37:38,386 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-21 11:37:38,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 11:37:38,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 11:37:38,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 11:37:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-07-21 11:37:38,389 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-07-21 11:37:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-21 11:37:38,390 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-21 11:37:38,968 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 11:37:38,971 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 11:37:39,145 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 11:37:42,724 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 11:37:42,743 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 11:37:42,744 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 11:37:42,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:37:42 BoogieIcfgContainer [2022-07-21 11:37:42,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 11:37:42,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 11:37:42,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 11:37:42,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 11:37:42,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:37:36" (1/3) ... [2022-07-21 11:37:42,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62971ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:37:42, skipping insertion in model container [2022-07-21 11:37:42,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:37:37" (2/3) ... [2022-07-21 11:37:42,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62971ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:37:42, skipping insertion in model container [2022-07-21 11:37:42,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:37:42" (3/3) ... [2022-07-21 11:37:42,754 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-21 11:37:42,768 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 11:37:42,768 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 11:37:42,851 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 11:37:42,861 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@ccb3a74, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2201ff96 [2022-07-21 11:37:42,861 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 11:37:42,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 1110 states, 820 states have (on average 1.425609756097561) internal successors, (1169), 852 states have internal predecessors, (1169), 236 states have call successors, (236), 53 states have call predecessors, (236), 52 states have return successors, (231), 229 states have call predecessors, (231), 231 states have call successors, (231) [2022-07-21 11:37:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-21 11:37:42,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:37:42,896 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:37:42,897 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:37:42,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:37:42,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1607484925, now seen corresponding path program 1 times [2022-07-21 11:37:42,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:37:42,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210466785] [2022-07-21 11:37:42,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:37:42,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:37:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:37:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:37:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:37:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:37:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:37:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:37:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:37:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:37:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:37:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:37:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:37:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:37:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:37:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:37:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-07-21 11:37:43,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:37:43,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210466785] [2022-07-21 11:37:43,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210466785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:37:43,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:37:43,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 11:37:43,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609767088] [2022-07-21 11:37:43,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:37:43,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:37:43,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:37:43,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:37:43,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:37:43,722 INFO L87 Difference]: Start difference. First operand has 1110 states, 820 states have (on average 1.425609756097561) internal successors, (1169), 852 states have internal predecessors, (1169), 236 states have call successors, (236), 53 states have call predecessors, (236), 52 states have return successors, (231), 229 states have call predecessors, (231), 231 states have call successors, (231) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 11:37:46,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:37:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:37:47,946 INFO L93 Difference]: Finished difference Result 2346 states and 3526 transitions. [2022-07-21 11:37:47,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:37:47,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 161 [2022-07-21 11:37:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:37:47,991 INFO L225 Difference]: With dead ends: 2346 [2022-07-21 11:37:47,991 INFO L226 Difference]: Without dead ends: 1198 [2022-07-21 11:37:48,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:37:48,007 INFO L413 NwaCegarLoop]: 1533 mSDtfsCounter, 1208 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 3193 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:37:48,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 3193 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [678 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-21 11:37:48,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2022-07-21 11:37:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1068. [2022-07-21 11:37:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 791 states have (on average 1.413400758533502) internal successors, (1118), 815 states have internal predecessors, (1118), 224 states have call successors, (224), 52 states have call predecessors, (224), 52 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2022-07-21 11:37:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1566 transitions. [2022-07-21 11:37:48,153 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1566 transitions. Word has length 161 [2022-07-21 11:37:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:37:48,154 INFO L495 AbstractCegarLoop]: Abstraction has 1068 states and 1566 transitions. [2022-07-21 11:37:48,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 11:37:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1566 transitions. [2022-07-21 11:37:48,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-21 11:37:48,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:37:48,160 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:37:48,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 11:37:48,160 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:37:48,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:37:48,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1068684857, now seen corresponding path program 1 times [2022-07-21 11:37:48,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:37:48,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310812252] [2022-07-21 11:37:48,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:37:48,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:37:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:37:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:37:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:37:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:37:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:37:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:37:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:37:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:37:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:37:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:37:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:37:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:37:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:37:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:37:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-07-21 11:37:48,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:37:48,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310812252] [2022-07-21 11:37:48,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310812252] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:37:48,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:37:48,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:37:48,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523028736] [2022-07-21 11:37:48,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:37:48,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:37:48,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:37:48,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:37:48,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:37:48,501 INFO L87 Difference]: Start difference. First operand 1068 states and 1566 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-21 11:37:51,311 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-21 11:37:55,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:37:55,093 INFO L93 Difference]: Finished difference Result 2892 states and 4264 transitions. [2022-07-21 11:37:55,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:37:55,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 161 [2022-07-21 11:37:55,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:37:55,106 INFO L225 Difference]: With dead ends: 2892 [2022-07-21 11:37:55,106 INFO L226 Difference]: Without dead ends: 1860 [2022-07-21 11:37:55,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:37:55,111 INFO L413 NwaCegarLoop]: 1535 mSDtfsCounter, 2564 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 1273 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2704 SdHoareTripleChecker+Valid, 3835 SdHoareTripleChecker+Invalid, 3732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1273 IncrementalHoareTripleChecker+Valid, 2458 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-21 11:37:55,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2704 Valid, 3835 Invalid, 3732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1273 Valid, 2458 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-07-21 11:37:55,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-07-21 11:37:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1628. [2022-07-21 11:37:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1195 states have (on average 1.397489539748954) internal successors, (1670), 1228 states have internal predecessors, (1670), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2022-07-21 11:37:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2352 transitions. [2022-07-21 11:37:55,192 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2352 transitions. Word has length 161 [2022-07-21 11:37:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:37:55,195 INFO L495 AbstractCegarLoop]: Abstraction has 1628 states and 2352 transitions. [2022-07-21 11:37:55,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-21 11:37:55,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2352 transitions. [2022-07-21 11:37:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-07-21 11:37:55,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:37:55,205 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:37:55,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 11:37:55,206 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:37:55,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:37:55,207 INFO L85 PathProgramCache]: Analyzing trace with hash -194454501, now seen corresponding path program 1 times [2022-07-21 11:37:55,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:37:55,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441782206] [2022-07-21 11:37:55,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:37:55,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:37:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:37:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:37:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:37:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:37:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:37:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:37:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:37:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:37:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:37:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:37:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:37:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:37:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:37:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:37:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:37:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 11:37:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 11:37:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2022-07-21 11:37:55,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:37:55,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441782206] [2022-07-21 11:37:55,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441782206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:37:55,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:37:55,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:37:55,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469032519] [2022-07-21 11:37:55,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:37:55,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:37:55,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:37:55,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:37:55,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:37:55,535 INFO L87 Difference]: Start difference. First operand 1628 states and 2352 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-21 11:37:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:37:58,532 INFO L93 Difference]: Finished difference Result 3442 states and 5039 transitions. [2022-07-21 11:37:58,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:37:58,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 222 [2022-07-21 11:37:58,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:37:58,545 INFO L225 Difference]: With dead ends: 3442 [2022-07-21 11:37:58,545 INFO L226 Difference]: Without dead ends: 1860 [2022-07-21 11:37:58,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-21 11:37:58,552 INFO L413 NwaCegarLoop]: 1455 mSDtfsCounter, 2869 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 1255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3012 SdHoareTripleChecker+Valid, 2531 SdHoareTripleChecker+Invalid, 2152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1255 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-21 11:37:58,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3012 Valid, 2531 Invalid, 2152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1255 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-21 11:37:58,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-07-21 11:37:58,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1628. [2022-07-21 11:37:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1195 states have (on average 1.39581589958159) internal successors, (1668), 1228 states have internal predecessors, (1668), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2022-07-21 11:37:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2350 transitions. [2022-07-21 11:37:58,669 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2350 transitions. Word has length 222 [2022-07-21 11:37:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:37:58,670 INFO L495 AbstractCegarLoop]: Abstraction has 1628 states and 2350 transitions. [2022-07-21 11:37:58,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-21 11:37:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2350 transitions. [2022-07-21 11:37:58,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-07-21 11:37:58,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:37:58,675 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:37:58,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 11:37:58,676 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:37:58,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:37:58,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1714003289, now seen corresponding path program 1 times [2022-07-21 11:37:58,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:37:58,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384080461] [2022-07-21 11:37:58,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:37:58,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:37:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:37:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:37:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:37:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:37:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:37:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:37:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:37:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:37:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:37:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:37:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:37:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:37:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:37:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:37:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:37:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 11:37:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 11:37:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:37:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:37:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:37:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2022-07-21 11:37:58,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:37:58,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384080461] [2022-07-21 11:37:58,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384080461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:37:58,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:37:58,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:37:58,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506040684] [2022-07-21 11:37:58,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:37:58,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:37:58,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:37:59,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:37:59,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:37:59,000 INFO L87 Difference]: Start difference. First operand 1628 states and 2350 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 11:38:01,233 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-21 11:38:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:38:05,726 INFO L93 Difference]: Finished difference Result 3446 states and 5039 transitions. [2022-07-21 11:38:05,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:38:05,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 222 [2022-07-21 11:38:05,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:38:05,738 INFO L225 Difference]: With dead ends: 3446 [2022-07-21 11:38:05,738 INFO L226 Difference]: Without dead ends: 1860 [2022-07-21 11:38:05,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-21 11:38:05,744 INFO L413 NwaCegarLoop]: 1466 mSDtfsCounter, 1205 mSDsluCounter, 3186 mSDsCounter, 0 mSdLazyCounter, 2935 mSolverCounterSat, 651 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 4652 SdHoareTripleChecker+Invalid, 3587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2935 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-21 11:38:05,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 4652 Invalid, 3587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2935 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-07-21 11:38:05,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-07-21 11:38:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1628. [2022-07-21 11:38:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1195 states have (on average 1.3941422594142259) internal successors, (1666), 1228 states have internal predecessors, (1666), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2022-07-21 11:38:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2348 transitions. [2022-07-21 11:38:05,817 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2348 transitions. Word has length 222 [2022-07-21 11:38:05,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:38:05,818 INFO L495 AbstractCegarLoop]: Abstraction has 1628 states and 2348 transitions. [2022-07-21 11:38:05,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 11:38:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2348 transitions. [2022-07-21 11:38:05,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-21 11:38:05,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:38:05,823 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:38:05,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 11:38:05,824 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:38:05,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:38:05,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1427997940, now seen corresponding path program 1 times [2022-07-21 11:38:05,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:38:05,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793974142] [2022-07-21 11:38:05,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:05,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:38:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:38:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:38:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:38:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:38:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:38:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:38:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:38:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:38:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:38:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:38:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:38:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:38:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:38:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:38:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 11:38:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:38:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-21 11:38:06,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:38:06,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793974142] [2022-07-21 11:38:06,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793974142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:38:06,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:38:06,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:38:06,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540063661] [2022-07-21 11:38:06,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:38:06,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:38:06,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:38:06,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:38:06,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:38:06,188 INFO L87 Difference]: Start difference. First operand 1628 states and 2348 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-21 11:38:08,454 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-21 11:38:10,534 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-21 11:38:13,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:38:15,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:38:18,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:38:18,423 INFO L93 Difference]: Finished difference Result 2450 states and 3737 transitions. [2022-07-21 11:38:18,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:38:18,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 225 [2022-07-21 11:38:18,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:38:18,437 INFO L225 Difference]: With dead ends: 2450 [2022-07-21 11:38:18,438 INFO L226 Difference]: Without dead ends: 2448 [2022-07-21 11:38:18,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-21 11:38:18,440 INFO L413 NwaCegarLoop]: 2076 mSDtfsCounter, 1995 mSDsluCounter, 4618 mSDsCounter, 0 mSdLazyCounter, 3436 mSolverCounterSat, 876 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2083 SdHoareTripleChecker+Valid, 6694 SdHoareTripleChecker+Invalid, 4314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 3436 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:38:18,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2083 Valid, 6694 Invalid, 4314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 3436 Invalid, 2 Unknown, 0 Unchecked, 12.0s Time] [2022-07-21 11:38:18,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2022-07-21 11:38:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 1630. [2022-07-21 11:38:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1197 states have (on average 1.3934837092731829) internal successors, (1668), 1230 states have internal predecessors, (1668), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2022-07-21 11:38:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2350 transitions. [2022-07-21 11:38:18,540 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2350 transitions. Word has length 225 [2022-07-21 11:38:18,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:38:18,541 INFO L495 AbstractCegarLoop]: Abstraction has 1630 states and 2350 transitions. [2022-07-21 11:38:18,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-21 11:38:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2350 transitions. [2022-07-21 11:38:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-07-21 11:38:18,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:38:18,547 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:38:18,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 11:38:18,547 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:38:18,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:38:18,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1191754029, now seen corresponding path program 1 times [2022-07-21 11:38:18,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:38:18,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051529554] [2022-07-21 11:38:18,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:18,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:38:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:38:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:38:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:38:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:38:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:38:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:38:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:38:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:38:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:38:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:38:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:38:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:38:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:38:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:38:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 11:38:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:38:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-21 11:38:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-21 11:38:18,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:38:18,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051529554] [2022-07-21 11:38:18,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051529554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:38:18,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:38:18,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:38:18,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163189903] [2022-07-21 11:38:18,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:38:18,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:38:18,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:38:18,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:38:18,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:38:18,976 INFO L87 Difference]: Start difference. First operand 1630 states and 2350 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-21 11:38:22,053 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:38:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:38:26,246 INFO L93 Difference]: Finished difference Result 4036 states and 6029 transitions. [2022-07-21 11:38:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:38:26,247 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 235 [2022-07-21 11:38:26,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:38:26,260 INFO L225 Difference]: With dead ends: 4036 [2022-07-21 11:38:26,260 INFO L226 Difference]: Without dead ends: 2452 [2022-07-21 11:38:26,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:38:26,267 INFO L413 NwaCegarLoop]: 1818 mSDtfsCounter, 2957 mSDsluCounter, 3630 mSDsCounter, 0 mSdLazyCounter, 3437 mSolverCounterSat, 1173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3230 SdHoareTripleChecker+Valid, 5448 SdHoareTripleChecker+Invalid, 4610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1173 IncrementalHoareTripleChecker+Valid, 3437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:38:26,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3230 Valid, 5448 Invalid, 4610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1173 Valid, 3437 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-21 11:38:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2022-07-21 11:38:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 1631. [2022-07-21 11:38:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1198 states have (on average 1.3931552587646077) internal successors, (1669), 1231 states have internal predecessors, (1669), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2022-07-21 11:38:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2351 transitions. [2022-07-21 11:38:26,352 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2351 transitions. Word has length 235 [2022-07-21 11:38:26,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:38:26,353 INFO L495 AbstractCegarLoop]: Abstraction has 1631 states and 2351 transitions. [2022-07-21 11:38:26,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-21 11:38:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2351 transitions. [2022-07-21 11:38:26,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-07-21 11:38:26,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:38:26,360 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:38:26,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 11:38:26,360 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:38:26,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:38:26,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1290014060, now seen corresponding path program 1 times [2022-07-21 11:38:26,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:38:26,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743317826] [2022-07-21 11:38:26,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:26,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:38:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:38:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:38:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:38:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:38:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:38:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:38:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:38:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:38:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:38:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:38:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:38:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:38:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:38:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:38:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 11:38:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:38:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-21 11:38:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-21 11:38:26,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:38:26,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743317826] [2022-07-21 11:38:26,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743317826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:38:26,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:38:26,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 11:38:26,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074438964] [2022-07-21 11:38:26,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:38:26,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 11:38:26,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:38:26,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 11:38:26,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:38:26,691 INFO L87 Difference]: Start difference. First operand 1631 states and 2351 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 11:38:30,608 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:38:36,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:38:36,096 INFO L93 Difference]: Finished difference Result 3383 states and 5318 transitions. [2022-07-21 11:38:36,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 11:38:36,096 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 237 [2022-07-21 11:38:36,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:38:36,118 INFO L225 Difference]: With dead ends: 3383 [2022-07-21 11:38:36,119 INFO L226 Difference]: Without dead ends: 3381 [2022-07-21 11:38:36,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-07-21 11:38:36,121 INFO L413 NwaCegarLoop]: 2505 mSDtfsCounter, 2809 mSDsluCounter, 8103 mSDsCounter, 0 mSdLazyCounter, 5763 mSolverCounterSat, 1210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2998 SdHoareTripleChecker+Valid, 10608 SdHoareTripleChecker+Invalid, 6973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1210 IncrementalHoareTripleChecker+Valid, 5763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:38:36,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2998 Valid, 10608 Invalid, 6973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1210 Valid, 5763 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-07-21 11:38:36,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2022-07-21 11:38:36,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 1633. [2022-07-21 11:38:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1199 states have (on average 1.3928273561301083) internal successors, (1670), 1231 states have internal predecessors, (1670), 342 states have call successors, (342), 91 states have call predecessors, (342), 91 states have return successors, (342), 339 states have call predecessors, (342), 342 states have call successors, (342) [2022-07-21 11:38:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2354 transitions. [2022-07-21 11:38:36,255 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2354 transitions. Word has length 237 [2022-07-21 11:38:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:38:36,255 INFO L495 AbstractCegarLoop]: Abstraction has 1633 states and 2354 transitions. [2022-07-21 11:38:36,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 11:38:36,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2354 transitions. [2022-07-21 11:38:36,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-21 11:38:36,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:38:36,264 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:38:36,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 11:38:36,264 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:38:36,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:38:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash -278810711, now seen corresponding path program 1 times [2022-07-21 11:38:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:38:36,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795406564] [2022-07-21 11:38:36,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:36,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:38:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:38:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:38:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:38:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:38:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:38:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:38:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:38:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:38:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:38:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:38:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:38:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:38:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:38:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:38:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 11:38:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:38:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-21 11:38:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-21 11:38:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-21 11:38:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-21 11:38:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-21 11:38:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-21 11:38:36,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:38:36,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795406564] [2022-07-21 11:38:36,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795406564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:38:36,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:38:36,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:38:36,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141891441] [2022-07-21 11:38:36,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:38:36,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:38:36,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:38:36,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:38:36,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:38:36,648 INFO L87 Difference]: Start difference. First operand 1633 states and 2354 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-21 11:38:38,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:38:40,266 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:38:42,312 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:38:43,874 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:38:45,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:38:47,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:38:47,332 INFO L93 Difference]: Finished difference Result 4096 states and 5975 transitions. [2022-07-21 11:38:47,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:38:47,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 267 [2022-07-21 11:38:47,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:38:47,343 INFO L225 Difference]: With dead ends: 4096 [2022-07-21 11:38:47,344 INFO L226 Difference]: Without dead ends: 2509 [2022-07-21 11:38:47,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:38:47,349 INFO L413 NwaCegarLoop]: 2165 mSDtfsCounter, 2322 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 1049 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2499 SdHoareTripleChecker+Valid, 4748 SdHoareTripleChecker+Invalid, 3504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1049 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-07-21 11:38:47,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2499 Valid, 4748 Invalid, 3504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1049 Valid, 2455 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2022-07-21 11:38:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2022-07-21 11:38:47,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2173. [2022-07-21 11:38:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 states, 1588 states have (on average 1.3866498740554156) internal successors, (2202), 1629 states have internal predecessors, (2202), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-21 11:38:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 3114 transitions. [2022-07-21 11:38:47,496 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 3114 transitions. Word has length 267 [2022-07-21 11:38:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:38:47,496 INFO L495 AbstractCegarLoop]: Abstraction has 2173 states and 3114 transitions. [2022-07-21 11:38:47,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-21 11:38:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 3114 transitions. [2022-07-21 11:38:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-07-21 11:38:47,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:38:47,510 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:38:47,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 11:38:47,510 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:38:47,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:38:47,511 INFO L85 PathProgramCache]: Analyzing trace with hash 245344003, now seen corresponding path program 1 times [2022-07-21 11:38:47,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:38:47,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754903450] [2022-07-21 11:38:47,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:47,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:38:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:38:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:38:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:38:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:38:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:38:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:38:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:38:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:38:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:38:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:38:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:38:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:38:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:38:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:38:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 11:38:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:38:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-21 11:38:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-21 11:38:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-07-21 11:38:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-21 11:38:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-21 11:38:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2022-07-21 11:38:47,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:38:47,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754903450] [2022-07-21 11:38:47,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754903450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:38:47,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:38:47,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:38:47,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232643022] [2022-07-21 11:38:47,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:38:47,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:38:47,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:38:47,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:38:47,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:38:47,892 INFO L87 Difference]: Start difference. First operand 2173 states and 3114 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-21 11:38:50,795 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-21 11:38:52,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:38:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:38:54,974 INFO L93 Difference]: Finished difference Result 4686 states and 6967 transitions. [2022-07-21 11:38:54,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:38:54,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 269 [2022-07-21 11:38:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:38:54,987 INFO L225 Difference]: With dead ends: 4686 [2022-07-21 11:38:54,988 INFO L226 Difference]: Without dead ends: 3099 [2022-07-21 11:38:54,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:38:54,993 INFO L413 NwaCegarLoop]: 1995 mSDtfsCounter, 3230 mSDsluCounter, 3255 mSDsCounter, 0 mSdLazyCounter, 2941 mSolverCounterSat, 1246 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3499 SdHoareTripleChecker+Valid, 5250 SdHoareTripleChecker+Invalid, 4188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 2941 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-21 11:38:54,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3499 Valid, 5250 Invalid, 4188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 2941 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-07-21 11:38:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2022-07-21 11:38:55,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 2177. [2022-07-21 11:38:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2177 states, 1592 states have (on average 1.3863065326633166) internal successors, (2207), 1633 states have internal predecessors, (2207), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-21 11:38:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 2177 states and 3119 transitions. [2022-07-21 11:38:55,142 INFO L78 Accepts]: Start accepts. Automaton has 2177 states and 3119 transitions. Word has length 269 [2022-07-21 11:38:55,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:38:55,143 INFO L495 AbstractCegarLoop]: Abstraction has 2177 states and 3119 transitions. [2022-07-21 11:38:55,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-21 11:38:55,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 3119 transitions. [2022-07-21 11:38:55,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-07-21 11:38:55,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:38:55,154 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:38:55,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 11:38:55,155 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:38:55,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:38:55,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1977117601, now seen corresponding path program 1 times [2022-07-21 11:38:55,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:38:55,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741248412] [2022-07-21 11:38:55,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:38:55,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:38:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:38:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:38:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:38:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:38:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:38:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:38:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:38:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:38:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:38:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:38:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:38:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:38:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:38:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:38:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:38:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 11:38:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:38:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:38:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:38:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-21 11:38:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-21 11:38:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-21 11:38:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-21 11:38:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-07-21 11:38:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:38:55,443 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2022-07-21 11:38:55,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:38:55,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741248412] [2022-07-21 11:38:55,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741248412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:38:55,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:38:55,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:38:55,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825087176] [2022-07-21 11:38:55,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:38:55,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:38:55,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:38:55,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:38:55,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:38:55,447 INFO L87 Difference]: Start difference. First operand 2177 states and 3119 transitions. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 11:38:57,955 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:38:59,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:39:02,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:39:02,202 INFO L93 Difference]: Finished difference Result 4645 states and 6777 transitions. [2022-07-21 11:39:02,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:39:02,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 272 [2022-07-21 11:39:02,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:39:02,213 INFO L225 Difference]: With dead ends: 4645 [2022-07-21 11:39:02,214 INFO L226 Difference]: Without dead ends: 2514 [2022-07-21 11:39:02,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:39:02,220 INFO L413 NwaCegarLoop]: 1461 mSDtfsCounter, 2056 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 1236 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2110 SdHoareTripleChecker+Valid, 3319 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1236 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-21 11:39:02,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2110 Valid, 3319 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1236 Valid, 1629 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-07-21 11:39:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2022-07-21 11:39:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2177. [2022-07-21 11:39:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2177 states, 1592 states have (on average 1.3806532663316582) internal successors, (2198), 1633 states have internal predecessors, (2198), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-21 11:39:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 2177 states and 3110 transitions. [2022-07-21 11:39:02,359 INFO L78 Accepts]: Start accepts. Automaton has 2177 states and 3110 transitions. Word has length 272 [2022-07-21 11:39:02,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:39:02,360 INFO L495 AbstractCegarLoop]: Abstraction has 2177 states and 3110 transitions. [2022-07-21 11:39:02,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 11:39:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 3110 transitions. [2022-07-21 11:39:02,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-07-21 11:39:02,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:39:02,372 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:39:02,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 11:39:02,372 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:39:02,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:39:02,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1130512862, now seen corresponding path program 1 times [2022-07-21 11:39:02,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:39:02,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862419939] [2022-07-21 11:39:02,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:39:02,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:39:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:39:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:39:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:39:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:39:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:39:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:39:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:39:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:39:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:39:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:39:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:39:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:39:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:39:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:39:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:39:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 11:39:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:39:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-21 11:39:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-21 11:39:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-21 11:39:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-07-21 11:39:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-07-21 11:39:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2022-07-21 11:39:02,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:39:02,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862419939] [2022-07-21 11:39:02,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862419939] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:39:02,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951472118] [2022-07-21 11:39:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:39:02,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:39:02,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:39:02,707 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-21 11:39:02,720 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-21 11:39:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:03,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 1907 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 11:39:03,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:39:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-21 11:39:03,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:39:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2022-07-21 11:39:04,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951472118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 11:39:04,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 11:39:04,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 5] total 14 [2022-07-21 11:39:04,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079813355] [2022-07-21 11:39:04,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 11:39:04,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 11:39:04,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:39:04,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 11:39:04,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-07-21 11:39:04,006 INFO L87 Difference]: Start difference. First operand 2177 states and 3110 transitions. Second operand has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 10 states have internal predecessors, (221), 4 states have call successors, (70), 7 states have call predecessors, (70), 3 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2022-07-21 11:39:06,157 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:39:08,428 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-21 11:39:13,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:39:13,338 INFO L93 Difference]: Finished difference Result 6443 states and 9908 transitions. [2022-07-21 11:39:13,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 11:39:13,339 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 10 states have internal predecessors, (221), 4 states have call successors, (70), 7 states have call predecessors, (70), 3 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) Word has length 275 [2022-07-21 11:39:13,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:39:13,362 INFO L225 Difference]: With dead ends: 6443 [2022-07-21 11:39:13,362 INFO L226 Difference]: Without dead ends: 4852 [2022-07-21 11:39:13,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2022-07-21 11:39:13,369 INFO L413 NwaCegarLoop]: 2545 mSDtfsCounter, 6758 mSDsluCounter, 6589 mSDsCounter, 0 mSdLazyCounter, 5220 mSolverCounterSat, 2982 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7151 SdHoareTripleChecker+Valid, 9134 SdHoareTripleChecker+Invalid, 8202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2982 IncrementalHoareTripleChecker+Valid, 5220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-07-21 11:39:13,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7151 Valid, 9134 Invalid, 8202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2982 Valid, 5220 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-07-21 11:39:13,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4852 states. [2022-07-21 11:39:13,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4852 to 2184. [2022-07-21 11:39:13,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 1599 states have (on average 1.3802376485303314) internal successors, (2207), 1640 states have internal predecessors, (2207), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-21 11:39:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 3119 transitions. [2022-07-21 11:39:13,595 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 3119 transitions. Word has length 275 [2022-07-21 11:39:13,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:39:13,596 INFO L495 AbstractCegarLoop]: Abstraction has 2184 states and 3119 transitions. [2022-07-21 11:39:13,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 10 states have internal predecessors, (221), 4 states have call successors, (70), 7 states have call predecessors, (70), 3 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2022-07-21 11:39:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3119 transitions. [2022-07-21 11:39:13,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2022-07-21 11:39:13,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:39:13,608 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:39:13,640 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-21 11:39:13,831 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,SelfDestructingSolverStorable10 [2022-07-21 11:39:13,832 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:39:13,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:39:13,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1723971340, now seen corresponding path program 1 times [2022-07-21 11:39:13,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:39:13,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89429595] [2022-07-21 11:39:13,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:39:13,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:39:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:39:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:39:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:39:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:39:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:39:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:39:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:39:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:39:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:39:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:39:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:39:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:39:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:39:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:39:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:39:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 11:39:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:39:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-21 11:39:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-21 11:39:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-21 11:39:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-21 11:39:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-21 11:39:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-21 11:39:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-07-21 11:39:14,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:39:14,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89429595] [2022-07-21 11:39:14,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89429595] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:39:14,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912911740] [2022-07-21 11:39:14,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:39:14,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:39:14,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:39:14,419 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-21 11:39:14,420 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-21 11:39:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:15,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 1969 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 11:39:15,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:39:15,210 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2022-07-21 11:39:15,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:39:15,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912911740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:39:15,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:39:15,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2022-07-21 11:39:15,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352374970] [2022-07-21 11:39:15,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:39:15,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:39:15,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:39:15,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:39:15,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-21 11:39:15,213 INFO L87 Difference]: Start difference. First operand 2184 states and 3119 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 11:39:15,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:39:15,646 INFO L93 Difference]: Finished difference Result 4712 states and 6904 transitions. [2022-07-21 11:39:15,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 11:39:15,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 284 [2022-07-21 11:39:15,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:39:15,661 INFO L225 Difference]: With dead ends: 4712 [2022-07-21 11:39:15,661 INFO L226 Difference]: Without dead ends: 3114 [2022-07-21 11:39:15,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-21 11:39:15,668 INFO L413 NwaCegarLoop]: 2222 mSDtfsCounter, 906 mSDsluCounter, 3688 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 5910 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-21 11:39:15,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 5910 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 11:39:15,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2022-07-21 11:39:15,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 2186. [2022-07-21 11:39:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2186 states, 1601 states have (on average 1.3797626483447845) internal successors, (2209), 1642 states have internal predecessors, (2209), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-21 11:39:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 3121 transitions. [2022-07-21 11:39:15,864 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 3121 transitions. Word has length 284 [2022-07-21 11:39:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:39:15,865 INFO L495 AbstractCegarLoop]: Abstraction has 2186 states and 3121 transitions. [2022-07-21 11:39:15,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 11:39:15,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 3121 transitions. [2022-07-21 11:39:15,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-07-21 11:39:15,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:39:15,876 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:39:15,908 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-21 11:39:16,091 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,SelfDestructingSolverStorable11 [2022-07-21 11:39:16,092 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:39:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:39:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1388851498, now seen corresponding path program 1 times [2022-07-21 11:39:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:39:16,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041350417] [2022-07-21 11:39:16,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:39:16,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:39:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:39:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:39:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:39:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:39:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:39:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:39:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:39:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:39:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:39:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:39:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:39:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:39:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:39:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:39:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:39:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 11:39:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:39:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-21 11:39:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-21 11:39:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-21 11:39:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-21 11:39:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-07-21 11:39:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-07-21 11:39:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-07-21 11:39:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-21 11:39:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2022-07-21 11:39:16,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:39:16,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041350417] [2022-07-21 11:39:16,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041350417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:39:16,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:39:16,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:39:16,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170090168] [2022-07-21 11:39:16,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:39:16,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:39:16,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:39:16,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:39:16,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:39:16,416 INFO L87 Difference]: Start difference. First operand 2186 states and 3121 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 11:39:18,132 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:39:20,637 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-21 11:39:24,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:39:24,564 INFO L93 Difference]: Finished difference Result 4751 states and 7044 transitions. [2022-07-21 11:39:24,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:39:24,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 293 [2022-07-21 11:39:24,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:39:24,598 INFO L225 Difference]: With dead ends: 4751 [2022-07-21 11:39:24,598 INFO L226 Difference]: Without dead ends: 3151 [2022-07-21 11:39:24,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-21 11:39:24,602 INFO L413 NwaCegarLoop]: 1980 mSDtfsCounter, 2204 mSDsluCounter, 3854 mSDsCounter, 0 mSdLazyCounter, 3262 mSolverCounterSat, 1127 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2337 SdHoareTripleChecker+Valid, 5834 SdHoareTripleChecker+Invalid, 4390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1127 IncrementalHoareTripleChecker+Valid, 3262 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-07-21 11:39:24,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2337 Valid, 5834 Invalid, 4390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1127 Valid, 3262 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2022-07-21 11:39:24,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2022-07-21 11:39:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 2188. [2022-07-21 11:39:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2188 states, 1603 states have (on average 1.379288833437305) internal successors, (2211), 1644 states have internal predecessors, (2211), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-21 11:39:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 3123 transitions. [2022-07-21 11:39:24,777 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 3123 transitions. Word has length 293 [2022-07-21 11:39:24,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:39:24,778 INFO L495 AbstractCegarLoop]: Abstraction has 2188 states and 3123 transitions. [2022-07-21 11:39:24,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 11:39:24,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 3123 transitions. [2022-07-21 11:39:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-07-21 11:39:24,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:39:24,787 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:39:24,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 11:39:24,788 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:39:24,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:39:24,788 INFO L85 PathProgramCache]: Analyzing trace with hash -279572144, now seen corresponding path program 1 times [2022-07-21 11:39:24,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:39:24,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015281755] [2022-07-21 11:39:24,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:39:24,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:39:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:39:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:39:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:39:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:39:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:39:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:39:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:39:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:39:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:39:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:39:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:39:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:39:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:39:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:39:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:39:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 11:39:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 11:39:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:39:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:39:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-21 11:39:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-21 11:39:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-21 11:39:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-21 11:39:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-21 11:39:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-21 11:39:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-21 11:39:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-07-21 11:39:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2022-07-21 11:39:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2022-07-21 11:39:25,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:39:25,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015281755] [2022-07-21 11:39:25,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015281755] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:39:25,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217877076] [2022-07-21 11:39:25,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:39:25,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:39:25,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:39:25,366 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-21 11:39:25,396 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-21 11:39:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:39:26,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 2203 conjuncts, 200 conjunts are in the unsatisfiable core [2022-07-21 11:39:26,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:39:27,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 11:39:27,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 11:39:27,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 11:39:27,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:27,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:27,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:27,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2022-07-21 11:39:27,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 11:39:27,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:27,510 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 23 treesize of output 22 [2022-07-21 11:39:27,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:27,528 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 23 treesize of output 22 [2022-07-21 11:39:27,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:27,543 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 23 treesize of output 22 [2022-07-21 11:39:27,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:27,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:27,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:27,781 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 28 treesize of output 31 [2022-07-21 11:39:27,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:27,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:27,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:27,794 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 28 treesize of output 31 [2022-07-21 11:39:27,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:27,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:27,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:27,815 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 28 treesize of output 31 [2022-07-21 11:39:28,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 50 [2022-07-21 11:39:28,077 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-21 11:39:28,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 81 [2022-07-21 11:39:28,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 63 treesize of output 59 [2022-07-21 11:39:28,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,152 INFO L356 Elim1Store]: treesize reduction 66, result has 29.8 percent of original size [2022-07-21 11:39:28,152 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 3 case distinctions, treesize of input 83 treesize of output 52 [2022-07-21 11:39:28,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2022-07-21 11:39:28,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,348 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-21 11:39:28,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 64 [2022-07-21 11:39:28,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,362 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 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-21 11:39:28,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 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 11:39:28,371 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 64 treesize of output 56 [2022-07-21 11:39:28,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2022-07-21 11:39:28,394 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-07-21 11:39:28,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,705 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 29 treesize of output 28 [2022-07-21 11:39:28,730 INFO L356 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-07-21 11:39:28,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 58 [2022-07-21 11:39:28,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:28,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-07-21 11:39:29,131 INFO L356 Elim1Store]: treesize reduction 158, result has 20.6 percent of original size [2022-07-21 11:39:29,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 62 [2022-07-21 11:39:29,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:29,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:29,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:29,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:29,160 INFO L356 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-07-21 11:39:29,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 58 [2022-07-21 11:39:29,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:29,165 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 21 treesize of output 20 [2022-07-21 11:39:29,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:29,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:29,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:29,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:29,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:29,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:29,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 74 [2022-07-21 11:39:29,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:29,870 INFO L356 Elim1Store]: treesize reduction 59, result has 21.3 percent of original size [2022-07-21 11:39:29,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 75 [2022-07-21 11:39:29,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:29,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:39:29,881 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-21 11:39:29,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 60 [2022-07-21 11:39:29,886 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 56 treesize of output 44 [2022-07-21 11:39:29,889 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 35 treesize of output 33 [2022-07-21 11:39:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-07-21 11:39:29,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:39:30,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1957 (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_1955) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1957) |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_1956) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (<= .cse0 0) (not (<= .cse0 2147483647))))) is different from false [2022-07-21 11:39:30,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217877076] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:39:30,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:39:30,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 32] total 37 [2022-07-21 11:39:30,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769461522] [2022-07-21 11:39:30,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:39:30,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-21 11:39:30,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:39:30,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-21 11:39:30,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1215, Unknown=1, NotChecked=70, Total=1406 [2022-07-21 11:39:30,049 INFO L87 Difference]: Start difference. First operand 2188 states and 3123 transitions. Second operand has 37 states, 36 states have (on average 6.555555555555555) internal successors, (236), 26 states have internal predecessors, (236), 11 states have call successors, (61), 11 states have call predecessors, (61), 10 states have return successors, (44), 13 states have call predecessors, (44), 11 states have call successors, (44) [2022-07-21 11:39:35,413 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-21 11:39:39,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:39:47,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:40:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:40:00,571 INFO L93 Difference]: Finished difference Result 5353 states and 8062 transitions. [2022-07-21 11:40:00,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-21 11:40:00,572 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 6.555555555555555) internal successors, (236), 26 states have internal predecessors, (236), 11 states have call successors, (61), 11 states have call predecessors, (61), 10 states have return successors, (44), 13 states have call predecessors, (44), 11 states have call successors, (44) Word has length 301 [2022-07-21 11:40:00,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:40:00,584 INFO L225 Difference]: With dead ends: 5353 [2022-07-21 11:40:00,584 INFO L226 Difference]: Without dead ends: 3731 [2022-07-21 11:40:00,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 356 SyntacticMatches, 14 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=416, Invalid=4143, Unknown=1, NotChecked=132, Total=4692 [2022-07-21 11:40:00,595 INFO L413 NwaCegarLoop]: 2399 mSDtfsCounter, 5226 mSDsluCounter, 27159 mSDsCounter, 0 mSdLazyCounter, 29257 mSolverCounterSat, 2775 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5476 SdHoareTripleChecker+Valid, 29558 SdHoareTripleChecker+Invalid, 35768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2775 IncrementalHoareTripleChecker+Valid, 29257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 3735 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:40:00,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5476 Valid, 29558 Invalid, 35768 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2775 Valid, 29257 Invalid, 1 Unknown, 3735 Unchecked, 29.1s Time] [2022-07-21 11:40:00,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3731 states. [2022-07-21 11:40:00,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3731 to 2206. [2022-07-21 11:40:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2206 states, 1615 states have (on average 1.3764705882352941) internal successors, (2223), 1659 states have internal predecessors, (2223), 456 states have call successors, (456), 128 states have call predecessors, (456), 134 states have return successors, (476), 454 states have call predecessors, (476), 456 states have call successors, (476) [2022-07-21 11:40:00,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 3155 transitions. [2022-07-21 11:40:00,828 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 3155 transitions. Word has length 301 [2022-07-21 11:40:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:40:00,828 INFO L495 AbstractCegarLoop]: Abstraction has 2206 states and 3155 transitions. [2022-07-21 11:40:00,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 6.555555555555555) internal successors, (236), 26 states have internal predecessors, (236), 11 states have call successors, (61), 11 states have call predecessors, (61), 10 states have return successors, (44), 13 states have call predecessors, (44), 11 states have call successors, (44) [2022-07-21 11:40:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 3155 transitions. [2022-07-21 11:40:00,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2022-07-21 11:40:00,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:40:00,838 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 11:40:00,870 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-21 11:40:01,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:40:01,052 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:40:01,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:40:01,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1080048572, now seen corresponding path program 1 times [2022-07-21 11:40:01,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:40:01,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470212472] [2022-07-21 11:40:01,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:40:01,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:40:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:40:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:40:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:40:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:40:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:40:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:40:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:40:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:40:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:40:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:40:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:40:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:40:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:40:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:40:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:40:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:40:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:40:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:40:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:40:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:40:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:40:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:40:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:40:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:40:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:40:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:40:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:40:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 11:40:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:40:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:40:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-21 11:40:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:40:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:40:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-21 11:40:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-21 11:40:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-21 11:40:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-21 11:40:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-07-21 11:40:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-21 11:40:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-07-21 11:40:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2022-07-21 11:40:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-07-21 11:40:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:01,467 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2022-07-21 11:40:01,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:40:01,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470212472] [2022-07-21 11:40:01,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470212472] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:40:01,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:40:01,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 11:40:01,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796224430] [2022-07-21 11:40:01,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:40:01,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 11:40:01,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:40:01,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 11:40:01,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:40:01,470 INFO L87 Difference]: Start difference. First operand 2206 states and 3155 transitions. Second operand has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-21 11:40:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:40:09,365 INFO L93 Difference]: Finished difference Result 5379 states and 8104 transitions. [2022-07-21 11:40:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 11:40:09,366 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) Word has length 307 [2022-07-21 11:40:09,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:40:09,378 INFO L225 Difference]: With dead ends: 5379 [2022-07-21 11:40:09,379 INFO L226 Difference]: Without dead ends: 3765 [2022-07-21 11:40:09,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-07-21 11:40:09,385 INFO L413 NwaCegarLoop]: 2233 mSDtfsCounter, 3900 mSDsluCounter, 7212 mSDsCounter, 0 mSdLazyCounter, 6595 mSolverCounterSat, 1918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4064 SdHoareTripleChecker+Valid, 9445 SdHoareTripleChecker+Invalid, 8513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1918 IncrementalHoareTripleChecker+Valid, 6595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-21 11:40:09,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4064 Valid, 9445 Invalid, 8513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1918 Valid, 6595 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-07-21 11:40:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2022-07-21 11:40:09,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 2209. [2022-07-21 11:40:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 1618 states have (on average 1.3757725587144622) internal successors, (2226), 1661 states have internal predecessors, (2226), 456 states have call successors, (456), 128 states have call predecessors, (456), 134 states have return successors, (476), 455 states have call predecessors, (476), 456 states have call successors, (476) [2022-07-21 11:40:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 3158 transitions. [2022-07-21 11:40:09,582 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 3158 transitions. Word has length 307 [2022-07-21 11:40:09,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:40:09,582 INFO L495 AbstractCegarLoop]: Abstraction has 2209 states and 3158 transitions. [2022-07-21 11:40:09,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-21 11:40:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 3158 transitions. [2022-07-21 11:40:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2022-07-21 11:40:09,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:40:09,593 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:40:09,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 11:40:09,593 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:40:09,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:40:09,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1959306136, now seen corresponding path program 2 times [2022-07-21 11:40:09,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:40:09,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119781645] [2022-07-21 11:40:09,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:40:09,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:40:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:09,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:40:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:09,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:40:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:09,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:40:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:09,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 11:40:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:09,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:40:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:09,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:40:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:09,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 11:40:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:09,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:40:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:09,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:40:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:09,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 11:40:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:09,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 11:40:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:09,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 11:40:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:40:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:40:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 11:40:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:40:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:40:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:40:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 11:40:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:40:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:40:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:40:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:40:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:40:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 11:40:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:40:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:40:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 11:40:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:40:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:40:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-21 11:40:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:40:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 11:40:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-21 11:40:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-21 11:40:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:40:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-21 11:40:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-21 11:40:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-21 11:40:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-21 11:40:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-21 11:40:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-21 11:40:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-07-21 11:40:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:40:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2022-07-21 11:40:10,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:40:10,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119781645] [2022-07-21 11:40:10,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119781645] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:40:10,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973225189] [2022-07-21 11:40:10,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 11:40:10,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:40:10,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:40:10,208 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-21 11:40:10,213 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-21 11:40:12,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 11:40:12,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 11:40:12,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 2255 conjuncts, 197 conjunts are in the unsatisfiable core [2022-07-21 11:40:12,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:40:12,812 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-21 11:40:12,980 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-21 11:40:13,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 11:40:13,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 11:40:13,188 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 11:40:13,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 11:40:13,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 11:40:13,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 11:40:13,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 11:40:13,437 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-21 11:40:13,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-21 11:40:13,721 INFO L356 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-07-21 11:40:13,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 34 treesize of output 53 [2022-07-21 11:40:13,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-21 11:40:13,992 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-21 11:40:13,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-07-21 11:40:14,095 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-21 11:40:14,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,336 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-21 11:40:14,340 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-21 11:40:14,347 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-21 11:40:14,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,422 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-21 11:40:14,433 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-21 11:40:14,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-07-21 11:40:14,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,442 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-21 11:40:14,651 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-21 11:40:14,651 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-21 11:40:14,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,664 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-21 11:40:14,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,672 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-21 11:40:14,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,878 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-21 11:40:14,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,893 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-21 11:40:14,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:14,902 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-21 11:40:14,908 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 33 treesize of output 33 [2022-07-21 11:40:14,912 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 25 treesize of output 25 [2022-07-21 11:40:14,917 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 22 treesize of output 24 [2022-07-21 11:40:15,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:15,036 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-21 11:40:15,047 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-21 11:40:15,048 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-21 11:40:15,051 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-21 11:40:15,055 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-21 11:40:15,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:15,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:15,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:15,065 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2022-07-21 11:40:15,069 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-21 11:40:15,267 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-21 11:40:15,267 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-21 11:40:15,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:15,277 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-21 11:40:15,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:15,281 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-21 11:40:15,556 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-21 11:40:15,556 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-21 11:40:15,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:15,565 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-21 11:40:15,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:15,571 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-21 11:40:15,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:15,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:15,991 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 48 treesize of output 30 [2022-07-21 11:40:15,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:15,997 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 47 treesize of output 29 [2022-07-21 11:40:16,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:40:16,002 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 21 treesize of output 9 [2022-07-21 11:40:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 179 proven. 36 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-07-21 11:40:16,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:40:16,145 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2560 (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_2558) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_2560) |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_2559) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (not (<= .cse0 2147483647)) (<= .cse0 0)))) is different from false [2022-07-21 11:40:16,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973225189] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:40:16,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:40:16,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 42] total 49 [2022-07-21 11:40:16,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818682285] [2022-07-21 11:40:16,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:40:16,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-21 11:40:16,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:40:16,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-21 11:40:16,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2207, Unknown=1, NotChecked=94, Total=2450 [2022-07-21 11:40:16,160 INFO L87 Difference]: Start difference. First operand 2209 states and 3158 transitions. Second operand has 49 states, 47 states have (on average 5.595744680851064) internal successors, (263), 37 states have internal predecessors, (263), 15 states have call successors, (64), 14 states have call predecessors, (64), 13 states have return successors, (56), 16 states have call predecessors, (56), 15 states have call successors, (56) [2022-07-21 11:40:19,639 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-21 11:40:21,709 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-21 11:40:25,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:40:26,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:40:31,178 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:40:33,379 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-21 11:40:40,855 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-21 11:40:56,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:40:58,171 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:41:00,200 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:41:03,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:41:06,816 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:41:11,057 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 []