./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6037d9c0da39b47219c2a722405991c574e168b5c260e77abe20cfd9849699bc --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 12:29:29,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:29:29,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:29:29,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:29:29,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:29:29,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:29:29,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:29:29,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:29:29,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:29:29,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:29:29,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:29:29,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:29:29,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:29:29,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:29:29,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:29:29,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:29:29,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:29:29,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:29:29,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:29:29,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:29:29,728 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:29:29,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:29:29,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:29:29,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:29:29,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:29:29,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:29:29,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:29:29,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:29:29,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:29:29,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:29:29,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:29:29,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:29:29,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:29:29,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:29:29,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:29:29,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:29:29,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:29:29,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:29:29,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:29:29,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:29:29,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:29:29,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:29:29,746 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 12:29:29,769 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:29:29,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:29:29,770 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:29:29,770 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:29:29,771 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:29:29,771 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:29:29,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:29:29,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:29:29,772 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:29:29,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:29:29,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 12:29:29,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:29:29,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:29:29,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:29:29,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:29:29,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:29:29,774 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:29:29,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:29:29,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:29:29,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:29:29,774 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:29:29,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:29:29,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:29:29,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:29:29,775 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:29:29,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 12:29:29,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 12:29:29,775 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:29:29,776 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:29:29,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:29:29,776 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 -> 6037d9c0da39b47219c2a722405991c574e168b5c260e77abe20cfd9849699bc [2022-07-12 12:29:29,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:29:30,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:29:30,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:29:30,008 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:29:30,008 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:29:30,009 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i [2022-07-12 12:29:30,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab1306a4/94d1c71adf8f4d5e9724e5a8999e5fa7/FLAGb452b811b [2022-07-12 12:29:30,643 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:29:30,644 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i [2022-07-12 12:29:30,678 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab1306a4/94d1c71adf8f4d5e9724e5a8999e5fa7/FLAGb452b811b [2022-07-12 12:29:30,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab1306a4/94d1c71adf8f4d5e9724e5a8999e5fa7 [2022-07-12 12:29:30,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:29:30,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:29:30,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:29:30,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:29:30,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:29:30,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:29:30" (1/1) ... [2022-07-12 12:29:30,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f96949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:30, skipping insertion in model container [2022-07-12 12:29:30,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:29:30" (1/1) ... [2022-07-12 12:29:30,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:29:30,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:29:31,567 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-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i[158583,158596] [2022-07-12 12:29:31,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:29:31,996 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:29:32,125 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-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i[158583,158596] [2022-07-12 12:29:32,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:29:32,332 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:29:32,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:32 WrapperNode [2022-07-12 12:29:32,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:29:32,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:29:32,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:29:32,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:29:32,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:32" (1/1) ... [2022-07-12 12:29:32,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:32" (1/1) ... [2022-07-12 12:29:32,520 INFO L137 Inliner]: procedures = 220, calls = 1799, calls flagged for inlining = 81, calls inlined = 72, statements flattened = 3230 [2022-07-12 12:29:32,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:29:32,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:29:32,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:29:32,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:29:32,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:32" (1/1) ... [2022-07-12 12:29:32,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:32" (1/1) ... [2022-07-12 12:29:32,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:32" (1/1) ... [2022-07-12 12:29:32,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:32" (1/1) ... [2022-07-12 12:29:32,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:32" (1/1) ... [2022-07-12 12:29:32,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:32" (1/1) ... [2022-07-12 12:29:32,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:32" (1/1) ... [2022-07-12 12:29:32,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:29:32,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:29:32,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:29:32,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:29:32,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:32" (1/1) ... [2022-07-12 12:29:32,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:29:32,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:29:32,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 12:29:32,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 12:29:32,731 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_u32 [2022-07-12 12:29:32,731 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_u32 [2022-07-12 12:29:32,731 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_xmit [2022-07-12 12:29:32,731 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_xmit [2022-07-12 12:29:32,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 12:29:32,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 12:29:32,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:29:32,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:29:32,732 INFO L130 BoogieDeclarations]: Found specification of procedure nla_put_u32 [2022-07-12 12:29:32,732 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_put_u32 [2022-07-12 12:29:32,732 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_start_tx [2022-07-12 12:29:32,732 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_start_tx [2022-07-12 12:29:32,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 12:29:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 12:29:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2022-07-12 12:29:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2022-07-12 12:29:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure skb_copy_bits [2022-07-12 12:29:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_copy_bits [2022-07-12 12:29:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-07-12 12:29:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-07-12 12:29:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-12 12:29:32,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-12 12:29:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure dump_stack [2022-07-12 12:29:32,734 INFO L138 BoogieDeclarations]: Found implementation of procedure dump_stack [2022-07-12 12:29:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:29:32,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:29:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_release_4 [2022-07-12 12:29:32,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_release_4 [2022-07-12 12:29:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-12 12:29:32,735 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-12 12:29:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure __symbol_put [2022-07-12 12:29:32,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __symbol_put [2022-07-12 12:29:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:29:32,735 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:29:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-07-12 12:29:32,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-07-12 12:29:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 12:29:32,736 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 12:29:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure caif_hsi_fill_info [2022-07-12 12:29:32,736 INFO L138 BoogieDeclarations]: Found implementation of procedure caif_hsi_fill_info [2022-07-12 12:29:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:29:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-12 12:29:32,736 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-12 12:29:32,737 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_rx_desc [2022-07-12 12:29:32,737 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_rx_desc [2022-07-12 12:29:32,737 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_update_aggregation_stats [2022-07-12 12:29:32,737 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_update_aggregation_stats [2022-07-12 12:29:32,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:29:32,737 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-12 12:29:32,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-12 12:29:32,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:29:32,738 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_tx_frm [2022-07-12 12:29:32,738 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_tx_frm [2022-07-12 12:29:32,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:29:32,738 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 12:29:32,739 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 12:29:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_dequeue [2022-07-12 12:29:32,739 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_dequeue [2022-07-12 12:29:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 12:29:32,740 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 12:29:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-07-12 12:29:32,740 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-07-12 12:29:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-12 12:29:32,741 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-12 12:29:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_rx_desc_len [2022-07-12 12:29:32,741 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_rx_desc_len [2022-07-12 12:29:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 12:29:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 12:29:32,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 12:29:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_tx_queue_len [2022-07-12 12:29:32,741 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_tx_queue_len [2022-07-12 12:29:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 12:29:32,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 12:29:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 12:29:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-07-12 12:29:32,745 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-07-12 12:29:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 12:29:32,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_21 [2022-07-12 12:29:32,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_21 [2022-07-12 12:29:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-12 12:29:32,746 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-12 12:29:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 12:29:32,746 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 12:29:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-12 12:29:32,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-12 12:29:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-12 12:29:32,746 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-12 12:29:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure caif_hsi_get_size [2022-07-12 12:29:32,747 INFO L138 BoogieDeclarations]: Found implementation of procedure caif_hsi_get_size [2022-07-12 12:29:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_netlink_parms [2022-07-12 12:29:32,747 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_netlink_parms [2022-07-12 12:29:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2022-07-12 12:29:32,748 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2022-07-12 12:29:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 12:29:32,748 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 12:29:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 12:29:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 12:29:32,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 12:29:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:29:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-07-12 12:29:32,749 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-07-12 12:29:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-12 12:29:32,750 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-12 12:29:32,750 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-07-12 12:29:32,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-07-12 12:29:32,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:29:32,750 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~TO~int [2022-07-12 12:29:32,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~TO~int [2022-07-12 12:29:32,750 INFO L130 BoogieDeclarations]: Found specification of procedure caif_hsi_changelink [2022-07-12 12:29:32,750 INFO L138 BoogieDeclarations]: Found implementation of procedure caif_hsi_changelink [2022-07-12 12:29:32,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:29:32,751 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-12 12:29:32,751 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-07-12 12:29:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-07-12 12:29:32,751 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 12:29:32,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 12:29:32,752 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_lock [2022-07-12 12:29:32,752 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_lock [2022-07-12 12:29:32,753 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_open [2022-07-12 12:29:32,754 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_open [2022-07-12 12:29:32,754 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_rx_done [2022-07-12 12:29:32,755 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_rx_done [2022-07-12 12:29:32,755 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-12 12:29:32,757 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-12 12:29:32,757 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_is_locked [2022-07-12 12:29:32,757 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_is_locked [2022-07-12 12:29:32,757 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-07-12 12:29:32,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-07-12 12:29:32,762 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_can_send_aggregate [2022-07-12 12:29:32,762 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_can_send_aggregate [2022-07-12 12:29:32,763 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-12 12:29:32,763 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-12 12:29:32,763 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-12 12:29:32,763 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-12 12:29:32,764 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 12:29:32,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 12:29:32,764 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-07-12 12:29:32,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-07-12 12:29:32,764 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-12 12:29:32,764 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-12 12:29:32,764 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-12 12:29:32,764 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-12 12:29:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure caif_hsi_newlink [2022-07-12 12:29:32,765 INFO L138 BoogieDeclarations]: Found implementation of procedure caif_hsi_newlink [2022-07-12 12:29:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2022-07-12 12:29:32,765 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2022-07-12 12:29:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 12:29:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-07-12 12:29:32,765 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-07-12 12:29:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_close [2022-07-12 12:29:32,765 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_close [2022-07-12 12:29:32,765 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-07-12 12:29:32,766 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-07-12 12:29:32,766 INFO L130 BoogieDeclarations]: Found specification of procedure cfhsi_abort_tx [2022-07-12 12:29:32,766 INFO L138 BoogieDeclarations]: Found implementation of procedure cfhsi_abort_tx [2022-07-12 12:29:32,766 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2022-07-12 12:29:32,766 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2022-07-12 12:29:32,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:29:32,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:29:32,766 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-12 12:29:32,766 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-12 12:29:32,766 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2022-07-12 12:29:32,767 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2022-07-12 12:29:33,208 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:29:33,210 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:29:33,584 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:29:35,313 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:29:35,322 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:29:35,323 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 12:29:35,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:29:35 BoogieIcfgContainer [2022-07-12 12:29:35,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:29:35,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:29:35,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:29:35,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:29:35,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:29:30" (1/3) ... [2022-07-12 12:29:35,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2205cc14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:29:35, skipping insertion in model container [2022-07-12 12:29:35,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:32" (2/3) ... [2022-07-12 12:29:35,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2205cc14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:29:35, skipping insertion in model container [2022-07-12 12:29:35,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:29:35" (3/3) ... [2022-07-12 12:29:35,330 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--caif--caif_hsi.ko-entry_point.cil.out.i [2022-07-12 12:29:35,339 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:29:35,340 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:29:35,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:29:35,386 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@5dcec8cb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@447582e [2022-07-12 12:29:35,387 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:29:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 1087 states, 758 states have (on average 1.3364116094986807) internal successors, (1013), 777 states have internal predecessors, (1013), 255 states have call successors, (255), 73 states have call predecessors, (255), 72 states have return successors, (251), 251 states have call predecessors, (251), 251 states have call successors, (251) [2022-07-12 12:29:35,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 12:29:35,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:35,402 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:29:35,403 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:35,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:35,406 INFO L85 PathProgramCache]: Analyzing trace with hash 201705276, now seen corresponding path program 1 times [2022-07-12 12:29:35,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:35,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746733620] [2022-07-12 12:29:35,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:35,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:35,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:35,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:35,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:29:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:35,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 12:29:35,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:29:35,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746733620] [2022-07-12 12:29:35,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746733620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:35,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:29:35,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:29:35,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478798131] [2022-07-12 12:29:35,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:35,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:29:35,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:29:35,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:29:35,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:29:35,845 INFO L87 Difference]: Start difference. First operand has 1087 states, 758 states have (on average 1.3364116094986807) internal successors, (1013), 777 states have internal predecessors, (1013), 255 states have call successors, (255), 73 states have call predecessors, (255), 72 states have return successors, (251), 251 states have call predecessors, (251), 251 states have call successors, (251) Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:29:39,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:39,740 INFO L93 Difference]: Finished difference Result 3554 states and 5253 transitions. [2022-07-12 12:29:39,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 12:29:39,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-07-12 12:29:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:39,769 INFO L225 Difference]: With dead ends: 3554 [2022-07-12 12:29:39,769 INFO L226 Difference]: Without dead ends: 2437 [2022-07-12 12:29:39,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:29:39,780 INFO L413 NwaCegarLoop]: 1817 mSDtfsCounter, 2097 mSDsluCounter, 4646 mSDsCounter, 0 mSdLazyCounter, 2626 mSolverCounterSat, 742 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2291 SdHoareTripleChecker+Valid, 6463 SdHoareTripleChecker+Invalid, 3368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 742 IncrementalHoareTripleChecker+Valid, 2626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:39,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2291 Valid, 6463 Invalid, 3368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [742 Valid, 2626 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-12 12:29:39,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2022-07-12 12:29:39,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2233. [2022-07-12 12:29:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2233 states, 1564 states have (on average 1.3241687979539642) internal successors, (2071), 1597 states have internal predecessors, (2071), 518 states have call successors, (518), 141 states have call predecessors, (518), 150 states have return successors, (587), 523 states have call predecessors, (587), 517 states have call successors, (587) [2022-07-12 12:29:39,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 3176 transitions. [2022-07-12 12:29:39,981 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 3176 transitions. Word has length 39 [2022-07-12 12:29:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:39,982 INFO L495 AbstractCegarLoop]: Abstraction has 2233 states and 3176 transitions. [2022-07-12 12:29:39,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 12:29:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 3176 transitions. [2022-07-12 12:29:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 12:29:39,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:39,998 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:29:39,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 12:29:39,998 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:39,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:39,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2097784552, now seen corresponding path program 1 times [2022-07-12 12:29:39,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:40,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248042995] [2022-07-12 12:29:40,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:40,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:40,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:40,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:40,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:29:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:40,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:29:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:40,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:40,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:40,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:40,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:29:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:40,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:29:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:40,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:40,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:29:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:40,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:40,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:29:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:40,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:29:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:40,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 12:29:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-12 12:29:40,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:29:40,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248042995] [2022-07-12 12:29:40,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248042995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:40,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:29:40,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 12:29:40,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302094068] [2022-07-12 12:29:40,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:40,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 12:29:40,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:29:40,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 12:29:40,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:29:40,616 INFO L87 Difference]: Start difference. First operand 2233 states and 3176 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 12:29:48,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:48,366 INFO L93 Difference]: Finished difference Result 4862 states and 7173 transitions. [2022-07-12 12:29:48,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 12:29:48,370 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2022-07-12 12:29:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:48,389 INFO L225 Difference]: With dead ends: 4862 [2022-07-12 12:29:48,390 INFO L226 Difference]: Without dead ends: 2639 [2022-07-12 12:29:48,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2022-07-12 12:29:48,402 INFO L413 NwaCegarLoop]: 1498 mSDtfsCounter, 473 mSDsluCounter, 7970 mSDsCounter, 0 mSdLazyCounter, 7222 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 9468 SdHoareTripleChecker+Invalid, 7546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 7222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:48,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 9468 Invalid, 7546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 7222 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-07-12 12:29:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2022-07-12 12:29:48,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 2261. [2022-07-12 12:29:48,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 1586 states have (on average 1.3209331651954603) internal successors, (2095), 1620 states have internal predecessors, (2095), 518 states have call successors, (518), 141 states have call predecessors, (518), 156 states have return successors, (612), 528 states have call predecessors, (612), 517 states have call successors, (612) [2022-07-12 12:29:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3225 transitions. [2022-07-12 12:29:48,479 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3225 transitions. Word has length 126 [2022-07-12 12:29:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:48,481 INFO L495 AbstractCegarLoop]: Abstraction has 2261 states and 3225 transitions. [2022-07-12 12:29:48,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 12:29:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3225 transitions. [2022-07-12 12:29:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 12:29:48,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:48,491 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:29:48,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 12:29:48,491 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:48,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:48,492 INFO L85 PathProgramCache]: Analyzing trace with hash 885987727, now seen corresponding path program 1 times [2022-07-12 12:29:48,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:48,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288920293] [2022-07-12 12:29:48,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:48,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:48,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:48,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:48,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:29:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:48,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:29:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:48,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:48,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:48,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:48,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:29:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:48,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:29:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:48,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:48,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:29:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:48,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:48,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:29:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:48,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:29:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:48,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:29:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-12 12:29:48,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:29:48,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288920293] [2022-07-12 12:29:48,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288920293] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:29:48,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586416046] [2022-07-12 12:29:48,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:48,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:29:48,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:29:48,901 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:29:48,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 12:29:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 2537 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 12:29:49,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:29:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 12:29:49,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:29:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-12 12:29:49,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586416046] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 12:29:49,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 12:29:49,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2022-07-12 12:29:49,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137910085] [2022-07-12 12:29:49,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 12:29:49,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 12:29:49,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:29:49,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 12:29:49,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:29:49,654 INFO L87 Difference]: Start difference. First operand 2261 states and 3225 transitions. Second operand has 10 states, 10 states have (on average 10.1) internal successors, (101), 6 states have internal predecessors, (101), 4 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-12 12:29:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:53,409 INFO L93 Difference]: Finished difference Result 4966 states and 7355 transitions. [2022-07-12 12:29:53,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 12:29:53,409 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 6 states have internal predecessors, (101), 4 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 130 [2022-07-12 12:29:53,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:53,424 INFO L225 Difference]: With dead ends: 4966 [2022-07-12 12:29:53,424 INFO L226 Difference]: Without dead ends: 2715 [2022-07-12 12:29:53,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:29:53,435 INFO L413 NwaCegarLoop]: 1535 mSDtfsCounter, 846 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 1976 mSolverCounterSat, 665 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 3725 SdHoareTripleChecker+Invalid, 2641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 1976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:53,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 3725 Invalid, 2641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [665 Valid, 1976 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-12 12:29:53,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2022-07-12 12:29:53,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2333. [2022-07-12 12:29:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2333 states, 1650 states have (on average 1.312121212121212) internal successors, (2165), 1677 states have internal predecessors, (2165), 526 states have call successors, (526), 141 states have call predecessors, (526), 156 states have return successors, (639), 543 states have call predecessors, (639), 525 states have call successors, (639) [2022-07-12 12:29:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 3330 transitions. [2022-07-12 12:29:53,515 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 3330 transitions. Word has length 130 [2022-07-12 12:29:53,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:53,515 INFO L495 AbstractCegarLoop]: Abstraction has 2333 states and 3330 transitions. [2022-07-12 12:29:53,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 6 states have internal predecessors, (101), 4 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-12 12:29:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 3330 transitions. [2022-07-12 12:29:53,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 12:29:53,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:53,522 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:29:53,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 12:29:53,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:29:53,735 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:53,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:53,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1600831573, now seen corresponding path program 1 times [2022-07-12 12:29:53,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:53,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018016404] [2022-07-12 12:29:53,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:53,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:53,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:53,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:53,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:29:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:53,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:29:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:53,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:53,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:54,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:29:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:54,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:29:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:54,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:54,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:29:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:54,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:54,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:29:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:54,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 12:29:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:54,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 12:29:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:54,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 12:29:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-12 12:29:54,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:29:54,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018016404] [2022-07-12 12:29:54,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018016404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:54,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:29:54,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 12:29:54,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327478092] [2022-07-12 12:29:54,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:54,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 12:29:54,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:29:54,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 12:29:54,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:29:54,214 INFO L87 Difference]: Start difference. First operand 2333 states and 3330 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 12:29:59,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:59,869 INFO L93 Difference]: Finished difference Result 5060 states and 7438 transitions. [2022-07-12 12:29:59,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:29:59,869 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2022-07-12 12:29:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:59,885 INFO L225 Difference]: With dead ends: 5060 [2022-07-12 12:29:59,886 INFO L226 Difference]: Without dead ends: 2737 [2022-07-12 12:29:59,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:29:59,895 INFO L413 NwaCegarLoop]: 1536 mSDtfsCounter, 815 mSDsluCounter, 6819 mSDsCounter, 0 mSdLazyCounter, 5924 mSolverCounterSat, 639 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 8355 SdHoareTripleChecker+Invalid, 6563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 639 IncrementalHoareTripleChecker+Valid, 5924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:59,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 8355 Invalid, 6563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [639 Valid, 5924 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-12 12:29:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2022-07-12 12:29:59,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 2351. [2022-07-12 12:29:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2351 states, 1666 states have (on average 1.3103241296518608) internal successors, (2183), 1693 states have internal predecessors, (2183), 526 states have call successors, (526), 141 states have call predecessors, (526), 158 states have return successors, (648), 545 states have call predecessors, (648), 525 states have call successors, (648) [2022-07-12 12:29:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3357 transitions. [2022-07-12 12:29:59,977 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3357 transitions. Word has length 133 [2022-07-12 12:29:59,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:59,978 INFO L495 AbstractCegarLoop]: Abstraction has 2351 states and 3357 transitions. [2022-07-12 12:29:59,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 12:29:59,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3357 transitions. [2022-07-12 12:30:00,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 12:30:00,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:00,005 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:30:00,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 12:30:00,005 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:00,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:00,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1436537290, now seen corresponding path program 1 times [2022-07-12 12:30:00,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:30:00,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001739397] [2022-07-12 12:30:00,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:00,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:30:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:30:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:30:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:30:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 12:30:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:30:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 12:30:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 12:30:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:30:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:30:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:30:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:30:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:30:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 12:30:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:30:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-12 12:30:00,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:00,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001739397] [2022-07-12 12:30:00,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001739397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:00,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:00,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:30:00,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014214727] [2022-07-12 12:30:00,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:00,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:30:00,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:00,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:30:00,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:30:00,257 INFO L87 Difference]: Start difference. First operand 2351 states and 3357 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 12:30:05,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:05,099 INFO L93 Difference]: Finished difference Result 6763 states and 9755 transitions. [2022-07-12 12:30:05,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:30:05,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2022-07-12 12:30:05,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:05,122 INFO L225 Difference]: With dead ends: 6763 [2022-07-12 12:30:05,122 INFO L226 Difference]: Without dead ends: 4422 [2022-07-12 12:30:05,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:30:05,132 INFO L413 NwaCegarLoop]: 1614 mSDtfsCounter, 2192 mSDsluCounter, 2940 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 1078 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2353 SdHoareTripleChecker+Valid, 4554 SdHoareTripleChecker+Invalid, 3625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1078 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:05,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2353 Valid, 4554 Invalid, 3625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1078 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-12 12:30:05,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4422 states. [2022-07-12 12:30:05,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4422 to 3858. [2022-07-12 12:30:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3858 states, 2796 states have (on average 1.3204577968526467) internal successors, (3692), 2833 states have internal predecessors, (3692), 795 states have call successors, (795), 235 states have call predecessors, (795), 266 states have return successors, (991), 832 states have call predecessors, (991), 794 states have call successors, (991) [2022-07-12 12:30:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 5478 transitions. [2022-07-12 12:30:05,311 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 5478 transitions. Word has length 162 [2022-07-12 12:30:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:05,311 INFO L495 AbstractCegarLoop]: Abstraction has 3858 states and 5478 transitions. [2022-07-12 12:30:05,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 12:30:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 5478 transitions. [2022-07-12 12:30:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-12 12:30:05,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:05,318 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:30:05,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 12:30:05,318 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:05,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:05,319 INFO L85 PathProgramCache]: Analyzing trace with hash 716705549, now seen corresponding path program 1 times [2022-07-12 12:30:05,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:30:05,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267728451] [2022-07-12 12:30:05,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:05,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:30:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:30:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:30:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:30:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:30:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:30:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:30:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 12:30:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 12:30:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 12:30:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 12:30:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-12 12:30:05,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:05,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267728451] [2022-07-12 12:30:05,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267728451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:05,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:05,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:30:05,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74395079] [2022-07-12 12:30:05,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:05,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:30:05,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:05,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:30:05,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:30:05,618 INFO L87 Difference]: Start difference. First operand 3858 states and 5478 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 12:30:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:09,739 INFO L93 Difference]: Finished difference Result 8288 states and 12057 transitions. [2022-07-12 12:30:09,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 12:30:09,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 148 [2022-07-12 12:30:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:09,762 INFO L225 Difference]: With dead ends: 8288 [2022-07-12 12:30:09,763 INFO L226 Difference]: Without dead ends: 4440 [2022-07-12 12:30:09,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:30:09,779 INFO L413 NwaCegarLoop]: 1546 mSDtfsCounter, 518 mSDsluCounter, 1907 mSDsCounter, 0 mSdLazyCounter, 2208 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 3453 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 2208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:09,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 3453 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 2208 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-12 12:30:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4440 states. [2022-07-12 12:30:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4440 to 3882. [2022-07-12 12:30:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3882 states, 2816 states have (on average 1.3196022727272727) internal successors, (3716), 2853 states have internal predecessors, (3716), 799 states have call successors, (799), 235 states have call predecessors, (799), 266 states have return successors, (1005), 836 states have call predecessors, (1005), 798 states have call successors, (1005) [2022-07-12 12:30:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3882 states and 5520 transitions. [2022-07-12 12:30:09,991 INFO L78 Accepts]: Start accepts. Automaton has 3882 states and 5520 transitions. Word has length 148 [2022-07-12 12:30:09,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:09,992 INFO L495 AbstractCegarLoop]: Abstraction has 3882 states and 5520 transitions. [2022-07-12 12:30:09,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 12:30:09,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3882 states and 5520 transitions. [2022-07-12 12:30:10,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-12 12:30:10,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:10,003 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2022-07-12 12:30:10,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 12:30:10,003 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:10,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:10,004 INFO L85 PathProgramCache]: Analyzing trace with hash 293332432, now seen corresponding path program 1 times [2022-07-12 12:30:10,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:30:10,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153297636] [2022-07-12 12:30:10,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:10,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:30:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:30:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:30:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:30:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:30:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:30:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:30:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:30:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:30:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:30:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:30:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:30:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:30:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:30:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:30:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-12 12:30:10,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:10,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153297636] [2022-07-12 12:30:10,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153297636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:10,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:10,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:30:10,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567114790] [2022-07-12 12:30:10,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:10,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:30:10,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:10,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:30:10,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:30:10,466 INFO L87 Difference]: Start difference. First operand 3882 states and 5520 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 4 states have internal predecessors, (116), 4 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-12 12:30:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:20,046 INFO L93 Difference]: Finished difference Result 13448 states and 19801 transitions. [2022-07-12 12:30:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 12:30:20,047 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 4 states have internal predecessors, (116), 4 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 174 [2022-07-12 12:30:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:20,089 INFO L225 Difference]: With dead ends: 13448 [2022-07-12 12:30:20,089 INFO L226 Difference]: Without dead ends: 9576 [2022-07-12 12:30:20,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-12 12:30:20,106 INFO L413 NwaCegarLoop]: 2156 mSDtfsCounter, 3403 mSDsluCounter, 5194 mSDsCounter, 0 mSdLazyCounter, 6650 mSolverCounterSat, 2103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3649 SdHoareTripleChecker+Valid, 7350 SdHoareTripleChecker+Invalid, 8753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2103 IncrementalHoareTripleChecker+Valid, 6650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:20,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3649 Valid, 7350 Invalid, 8753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2103 Valid, 6650 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-07-12 12:30:20,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9576 states. [2022-07-12 12:30:20,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9576 to 7988. [2022-07-12 12:30:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7988 states, 5793 states have (on average 1.3188330744001382) internal successors, (7640), 5889 states have internal predecessors, (7640), 1646 states have call successors, (1646), 461 states have call predecessors, (1646), 548 states have return successors, (2273), 1733 states have call predecessors, (2273), 1645 states have call successors, (2273) [2022-07-12 12:30:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7988 states to 7988 states and 11559 transitions. [2022-07-12 12:30:20,445 INFO L78 Accepts]: Start accepts. Automaton has 7988 states and 11559 transitions. Word has length 174 [2022-07-12 12:30:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:20,445 INFO L495 AbstractCegarLoop]: Abstraction has 7988 states and 11559 transitions. [2022-07-12 12:30:20,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 4 states have internal predecessors, (116), 4 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-07-12 12:30:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 7988 states and 11559 transitions. [2022-07-12 12:30:20,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 12:30:20,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:20,462 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:30:20,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 12:30:20,462 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:20,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:20,463 INFO L85 PathProgramCache]: Analyzing trace with hash 503086365, now seen corresponding path program 1 times [2022-07-12 12:30:20,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:30:20,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24283196] [2022-07-12 12:30:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:20,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:30:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:30:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:30:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:30:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:30:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:30:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:30:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:30:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:30:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:30:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:30:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:30:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:30:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:30:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-12 12:30:20,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:20,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24283196] [2022-07-12 12:30:20,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24283196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:20,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:20,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 12:30:20,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072684354] [2022-07-12 12:30:20,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:20,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 12:30:20,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:20,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 12:30:20,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:30:20,835 INFO L87 Difference]: Start difference. First operand 7988 states and 11559 transitions. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 6 states have internal predecessors, (112), 4 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-12 12:30:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:31,415 INFO L93 Difference]: Finished difference Result 17242 states and 25322 transitions. [2022-07-12 12:30:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 12:30:31,415 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 6 states have internal predecessors, (112), 4 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 163 [2022-07-12 12:30:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:31,452 INFO L225 Difference]: With dead ends: 17242 [2022-07-12 12:30:31,452 INFO L226 Difference]: Without dead ends: 9264 [2022-07-12 12:30:31,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2022-07-12 12:30:31,474 INFO L413 NwaCegarLoop]: 2099 mSDtfsCounter, 3881 mSDsluCounter, 6889 mSDsCounter, 0 mSdLazyCounter, 8475 mSolverCounterSat, 2620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4103 SdHoareTripleChecker+Valid, 8988 SdHoareTripleChecker+Invalid, 11095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2620 IncrementalHoareTripleChecker+Valid, 8475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:31,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4103 Valid, 8988 Invalid, 11095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2620 Valid, 8475 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2022-07-12 12:30:31,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9264 states. [2022-07-12 12:30:31,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9264 to 8092. [2022-07-12 12:30:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8092 states, 5881 states have (on average 1.3195034858017345) internal successors, (7760), 5969 states have internal predecessors, (7760), 1654 states have call successors, (1654), 461 states have call predecessors, (1654), 556 states have return successors, (2313), 1757 states have call predecessors, (2313), 1653 states have call successors, (2313) [2022-07-12 12:30:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8092 states to 8092 states and 11727 transitions. [2022-07-12 12:30:31,802 INFO L78 Accepts]: Start accepts. Automaton has 8092 states and 11727 transitions. Word has length 163 [2022-07-12 12:30:31,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:31,802 INFO L495 AbstractCegarLoop]: Abstraction has 8092 states and 11727 transitions. [2022-07-12 12:30:31,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 6 states have internal predecessors, (112), 4 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-07-12 12:30:31,803 INFO L276 IsEmpty]: Start isEmpty. Operand 8092 states and 11727 transitions. [2022-07-12 12:30:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 12:30:31,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:31,820 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2022-07-12 12:30:31,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 12:30:31,820 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:31,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:31,821 INFO L85 PathProgramCache]: Analyzing trace with hash -57053180, now seen corresponding path program 1 times [2022-07-12 12:30:31,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:30:31,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188807879] [2022-07-12 12:30:31,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:31,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:30:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:31,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:31,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:31,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:30:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:31,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:30:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:31,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:30:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:32,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:30:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:32,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:30:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:32,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:30:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:30:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:32,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:30:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:32,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:30:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:32,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:30:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:32,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:30:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:32,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:30:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:32,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:30:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:32,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:32,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-12 12:30:32,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:32,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188807879] [2022-07-12 12:30:32,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188807879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:32,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:32,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 12:30:32,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506104445] [2022-07-12 12:30:32,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:32,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 12:30:32,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:32,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 12:30:32,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:30:32,299 INFO L87 Difference]: Start difference. First operand 8092 states and 11727 transitions. Second operand has 14 states, 14 states have (on average 8.357142857142858) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (18), 5 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:30:43,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:43,475 INFO L93 Difference]: Finished difference Result 17090 states and 25198 transitions. [2022-07-12 12:30:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-12 12:30:43,475 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.357142857142858) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (18), 5 states have call predecessors, (18), 2 states have call successors, (18) Word has length 171 [2022-07-12 12:30:43,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:43,507 INFO L225 Difference]: With dead ends: 17090 [2022-07-12 12:30:43,507 INFO L226 Difference]: Without dead ends: 9008 [2022-07-12 12:30:43,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=1553, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 12:30:43,530 INFO L413 NwaCegarLoop]: 2093 mSDtfsCounter, 3186 mSDsluCounter, 12514 mSDsCounter, 0 mSdLazyCounter, 13267 mSolverCounterSat, 1945 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3405 SdHoareTripleChecker+Valid, 14607 SdHoareTripleChecker+Invalid, 15212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1945 IncrementalHoareTripleChecker+Valid, 13267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:43,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3405 Valid, 14607 Invalid, 15212 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1945 Valid, 13267 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2022-07-12 12:30:43,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9008 states. [2022-07-12 12:30:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9008 to 8132. [2022-07-12 12:30:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8132 states, 5909 states have (on average 1.3179895075308852) internal successors, (7788), 6001 states have internal predecessors, (7788), 1654 states have call successors, (1654), 461 states have call predecessors, (1654), 568 states have return successors, (2403), 1765 states have call predecessors, (2403), 1653 states have call successors, (2403) [2022-07-12 12:30:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8132 states to 8132 states and 11845 transitions. [2022-07-12 12:30:43,916 INFO L78 Accepts]: Start accepts. Automaton has 8132 states and 11845 transitions. Word has length 171 [2022-07-12 12:30:43,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:43,917 INFO L495 AbstractCegarLoop]: Abstraction has 8132 states and 11845 transitions. [2022-07-12 12:30:43,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.357142857142858) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (18), 5 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:30:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 8132 states and 11845 transitions. [2022-07-12 12:30:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-12 12:30:43,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:43,932 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:30:43,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 12:30:43,932 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:43,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:43,933 INFO L85 PathProgramCache]: Analyzing trace with hash -354812196, now seen corresponding path program 1 times [2022-07-12 12:30:43,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:30:43,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211620606] [2022-07-12 12:30:43,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:43,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:30:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:30:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:30:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:30:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:30:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:30:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:30:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:30:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:30:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:30:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:30:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:30:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:30:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:30:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:30:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-12 12:30:44,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:44,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211620606] [2022-07-12 12:30:44,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211620606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:44,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:44,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 12:30:44,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350883840] [2022-07-12 12:30:44,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:44,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 12:30:44,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:44,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 12:30:44,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-12 12:30:44,328 INFO L87 Difference]: Start difference. First operand 8132 states and 11845 transitions. Second operand has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 9 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (19), 6 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 12:30:57,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:57,300 INFO L93 Difference]: Finished difference Result 17078 states and 25587 transitions. [2022-07-12 12:30:57,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 12:30:57,301 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 9 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (19), 6 states have call predecessors, (19), 3 states have call successors, (19) Word has length 175 [2022-07-12 12:30:57,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:57,335 INFO L225 Difference]: With dead ends: 17078 [2022-07-12 12:30:57,336 INFO L226 Difference]: Without dead ends: 8956 [2022-07-12 12:30:57,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 12:30:57,364 INFO L413 NwaCegarLoop]: 2115 mSDtfsCounter, 2112 mSDsluCounter, 14144 mSDsCounter, 0 mSdLazyCounter, 15978 mSolverCounterSat, 845 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2336 SdHoareTripleChecker+Valid, 16259 SdHoareTripleChecker+Invalid, 16823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 845 IncrementalHoareTripleChecker+Valid, 15978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:57,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2336 Valid, 16259 Invalid, 16823 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [845 Valid, 15978 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2022-07-12 12:30:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8956 states. [2022-07-12 12:30:57,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8956 to 8106. [2022-07-12 12:30:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8106 states, 5889 states have (on average 1.317031754117847) internal successors, (7756), 5981 states have internal predecessors, (7756), 1654 states have call successors, (1654), 461 states have call predecessors, (1654), 562 states have return successors, (2355), 1759 states have call predecessors, (2355), 1653 states have call successors, (2355) [2022-07-12 12:30:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8106 states to 8106 states and 11765 transitions. [2022-07-12 12:30:57,719 INFO L78 Accepts]: Start accepts. Automaton has 8106 states and 11765 transitions. Word has length 175 [2022-07-12 12:30:57,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:57,720 INFO L495 AbstractCegarLoop]: Abstraction has 8106 states and 11765 transitions. [2022-07-12 12:30:57,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 9 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (19), 6 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 12:30:57,720 INFO L276 IsEmpty]: Start isEmpty. Operand 8106 states and 11765 transitions. [2022-07-12 12:30:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-12 12:30:57,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:57,736 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-12 12:30:57,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 12:30:57,737 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:57,737 INFO L85 PathProgramCache]: Analyzing trace with hash -338859418, now seen corresponding path program 1 times [2022-07-12 12:30:57,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:30:57,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933471447] [2022-07-12 12:30:57,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:57,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:30:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:57,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:57,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:30:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:57,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:30:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:57,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:30:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:30:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:30:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:30:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:30:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:30:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 12:30:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 12:30:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 12:30:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2022-07-12 12:30:58,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:58,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933471447] [2022-07-12 12:30:58,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933471447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:58,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:58,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:30:58,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236782273] [2022-07-12 12:30:58,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:58,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:30:58,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:58,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:30:58,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:30:58,212 INFO L87 Difference]: Start difference. First operand 8106 states and 11765 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 12:31:03,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:31:03,355 INFO L93 Difference]: Finished difference Result 16700 states and 25041 transitions. [2022-07-12 12:31:03,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:31:03,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 177 [2022-07-12 12:31:03,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:31:03,389 INFO L225 Difference]: With dead ends: 16700 [2022-07-12 12:31:03,389 INFO L226 Difference]: Without dead ends: 8604 [2022-07-12 12:31:03,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:31:03,417 INFO L413 NwaCegarLoop]: 1535 mSDtfsCounter, 464 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 4209 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 5824 SdHoareTripleChecker+Invalid, 4540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 4209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:31:03,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 5824 Invalid, 4540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 4209 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-12 12:31:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8604 states. [2022-07-12 12:31:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8604 to 8018. [2022-07-12 12:31:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8018 states, 5813 states have (on average 1.3163598830208154) internal successors, (7652), 5897 states have internal predecessors, (7652), 1654 states have call successors, (1654), 461 states have call predecessors, (1654), 550 states have return successors, (2239), 1755 states have call predecessors, (2239), 1653 states have call successors, (2239) [2022-07-12 12:31:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8018 states to 8018 states and 11545 transitions. [2022-07-12 12:31:03,783 INFO L78 Accepts]: Start accepts. Automaton has 8018 states and 11545 transitions. Word has length 177 [2022-07-12 12:31:03,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:31:03,783 INFO L495 AbstractCegarLoop]: Abstraction has 8018 states and 11545 transitions. [2022-07-12 12:31:03,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 12:31:03,784 INFO L276 IsEmpty]: Start isEmpty. Operand 8018 states and 11545 transitions. [2022-07-12 12:31:03,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-12 12:31:03,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:31:03,798 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:31:03,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 12:31:03,798 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:31:03,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:31:03,798 INFO L85 PathProgramCache]: Analyzing trace with hash -741457368, now seen corresponding path program 1 times [2022-07-12 12:31:03,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:31:03,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274476128] [2022-07-12 12:31:03,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:31:03,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:31:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:03,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:31:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:03,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:31:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:03,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:31:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:03,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:31:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:03,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:31:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:03,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:31:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:31:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:31:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:31:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:31:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:31:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:31:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 12:31:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:31:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-07-12 12:31:04,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:31:04,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274476128] [2022-07-12 12:31:04,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274476128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:31:04,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:31:04,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:31:04,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842996309] [2022-07-12 12:31:04,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:31:04,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:31:04,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:31:04,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:31:04,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:31:04,127 INFO L87 Difference]: Start difference. First operand 8018 states and 11545 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 12:31:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:31:10,045 INFO L93 Difference]: Finished difference Result 16700 states and 24530 transitions. [2022-07-12 12:31:10,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:31:10,046 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 182 [2022-07-12 12:31:10,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:31:10,084 INFO L225 Difference]: With dead ends: 16700 [2022-07-12 12:31:10,085 INFO L226 Difference]: Without dead ends: 8692 [2022-07-12 12:31:10,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:31:10,110 INFO L413 NwaCegarLoop]: 1535 mSDtfsCounter, 429 mSDsluCounter, 4845 mSDsCounter, 0 mSdLazyCounter, 4697 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 6380 SdHoareTripleChecker+Invalid, 5008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 4697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:31:10,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 6380 Invalid, 5008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 4697 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-12 12:31:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8692 states. [2022-07-12 12:31:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8692 to 8066. [2022-07-12 12:31:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8066 states, 5849 states have (on average 1.31509659770901) internal successors, (7692), 5937 states have internal predecessors, (7692), 1654 states have call successors, (1654), 461 states have call predecessors, (1654), 562 states have return successors, (2275), 1763 states have call predecessors, (2275), 1653 states have call successors, (2275) [2022-07-12 12:31:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8066 states to 8066 states and 11621 transitions. [2022-07-12 12:31:10,429 INFO L78 Accepts]: Start accepts. Automaton has 8066 states and 11621 transitions. Word has length 182 [2022-07-12 12:31:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:31:10,430 INFO L495 AbstractCegarLoop]: Abstraction has 8066 states and 11621 transitions. [2022-07-12 12:31:10,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 12:31:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand 8066 states and 11621 transitions. [2022-07-12 12:31:10,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-12 12:31:10,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:31:10,442 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:31:10,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 12:31:10,443 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:31:10,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:31:10,443 INFO L85 PathProgramCache]: Analyzing trace with hash 327800441, now seen corresponding path program 1 times [2022-07-12 12:31:10,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:31:10,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290214408] [2022-07-12 12:31:10,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:31:10,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:31:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:31:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:31:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:31:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:31:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:31:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:31:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:31:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:31:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:31:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:31:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:31:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:31:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:31:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:31:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:31:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-12 12:31:10,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:31:10,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290214408] [2022-07-12 12:31:10,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290214408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:31:10,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:31:10,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 12:31:10,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221086999] [2022-07-12 12:31:10,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:31:10,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 12:31:10,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:31:10,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 12:31:10,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:31:10,852 INFO L87 Difference]: Start difference. First operand 8066 states and 11621 transitions. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 5 states have internal predecessors, (124), 3 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 12:31:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:31:18,517 INFO L93 Difference]: Finished difference Result 17936 states and 26448 transitions. [2022-07-12 12:31:18,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 12:31:18,517 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 5 states have internal predecessors, (124), 3 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 183 [2022-07-12 12:31:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:31:18,547 INFO L225 Difference]: With dead ends: 17936 [2022-07-12 12:31:18,548 INFO L226 Difference]: Without dead ends: 9880 [2022-07-12 12:31:18,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-07-12 12:31:18,563 INFO L413 NwaCegarLoop]: 2248 mSDtfsCounter, 2867 mSDsluCounter, 5711 mSDsCounter, 0 mSdLazyCounter, 6979 mSolverCounterSat, 1704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3149 SdHoareTripleChecker+Valid, 7959 SdHoareTripleChecker+Invalid, 8683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1704 IncrementalHoareTripleChecker+Valid, 6979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:31:18,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3149 Valid, 7959 Invalid, 8683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1704 Valid, 6979 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-12 12:31:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9880 states. [2022-07-12 12:31:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9880 to 8110. [2022-07-12 12:31:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8110 states, 5881 states have (on average 1.313382077877912) internal successors, (7724), 5977 states have internal predecessors, (7724), 1658 states have call successors, (1658), 461 states have call predecessors, (1658), 570 states have return successors, (2301), 1767 states have call predecessors, (2301), 1657 states have call successors, (2301) [2022-07-12 12:31:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8110 states to 8110 states and 11683 transitions. [2022-07-12 12:31:18,900 INFO L78 Accepts]: Start accepts. Automaton has 8110 states and 11683 transitions. Word has length 183 [2022-07-12 12:31:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:31:18,901 INFO L495 AbstractCegarLoop]: Abstraction has 8110 states and 11683 transitions. [2022-07-12 12:31:18,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 5 states have internal predecessors, (124), 3 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 12:31:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 8110 states and 11683 transitions. [2022-07-12 12:31:18,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-07-12 12:31:18,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:31:18,913 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:31:18,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 12:31:18,914 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:31:18,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:31:18,915 INFO L85 PathProgramCache]: Analyzing trace with hash 392880831, now seen corresponding path program 1 times [2022-07-12 12:31:18,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:31:18,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279778125] [2022-07-12 12:31:18,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:31:18,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:31:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:31:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:31:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:31:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:31:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:31:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:31:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:31:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:31:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:31:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:31:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:31:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:31:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:31:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 12:31:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:31:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:31:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:31:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-12 12:31:19,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:31:19,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279778125] [2022-07-12 12:31:19,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279778125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:31:19,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:31:19,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:31:19,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702460685] [2022-07-12 12:31:19,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:31:19,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:31:19,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:31:19,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:31:19,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:31:19,385 INFO L87 Difference]: Start difference. First operand 8110 states and 11683 transitions. Second operand has 9 states, 9 states have (on average 15.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 12:31:21,022 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:31:26,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:31:26,440 INFO L93 Difference]: Finished difference Result 17940 states and 26491 transitions. [2022-07-12 12:31:26,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:31:26,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 204 [2022-07-12 12:31:26,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:31:26,475 INFO L225 Difference]: With dead ends: 17940 [2022-07-12 12:31:26,475 INFO L226 Difference]: Without dead ends: 9840 [2022-07-12 12:31:26,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:31:26,495 INFO L413 NwaCegarLoop]: 1595 mSDtfsCounter, 1001 mSDsluCounter, 3081 mSDsCounter, 0 mSdLazyCounter, 3731 mSolverCounterSat, 709 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 4676 SdHoareTripleChecker+Invalid, 4440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 709 IncrementalHoareTripleChecker+Valid, 3731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:31:26,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 4676 Invalid, 4440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [709 Valid, 3731 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-07-12 12:31:26,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9840 states. [2022-07-12 12:31:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9840 to 8118. [2022-07-12 12:31:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8118 states, 5889 states have (on average 1.3129563593139753) internal successors, (7732), 5985 states have internal predecessors, (7732), 1658 states have call successors, (1658), 461 states have call predecessors, (1658), 570 states have return successors, (2301), 1767 states have call predecessors, (2301), 1657 states have call successors, (2301) [2022-07-12 12:31:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8118 states to 8118 states and 11691 transitions. [2022-07-12 12:31:26,830 INFO L78 Accepts]: Start accepts. Automaton has 8118 states and 11691 transitions. Word has length 204 [2022-07-12 12:31:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:31:26,830 INFO L495 AbstractCegarLoop]: Abstraction has 8118 states and 11691 transitions. [2022-07-12 12:31:26,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 12:31:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 8118 states and 11691 transitions. [2022-07-12 12:31:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-12 12:31:26,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:31:26,842 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:31:26,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 12:31:26,842 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:31:26,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:31:26,843 INFO L85 PathProgramCache]: Analyzing trace with hash 982161838, now seen corresponding path program 1 times [2022-07-12 12:31:26,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:31:26,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421118924] [2022-07-12 12:31:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:31:26,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:31:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:26,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:31:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:26,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:31:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:26,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:31:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:26,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:31:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:26,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:27,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:31:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:27,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:31:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:27,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:31:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:27,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:31:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:27,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:31:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:27,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:31:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:27,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:31:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:27,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 12:31:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:27,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:31:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:27,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:31:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:27,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:27,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:27,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:27,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:31:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-12 12:31:27,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:31:27,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421118924] [2022-07-12 12:31:27,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421118924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:31:27,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:31:27,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 12:31:27,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203127821] [2022-07-12 12:31:27,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:31:27,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 12:31:27,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:31:27,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 12:31:27,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:31:27,158 INFO L87 Difference]: Start difference. First operand 8118 states and 11691 transitions. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 4 states have internal predecessors, (123), 3 states have call successors, (21), 8 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-12 12:31:37,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:31:37,563 INFO L93 Difference]: Finished difference Result 17916 states and 26444 transitions. [2022-07-12 12:31:37,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 12:31:37,564 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 4 states have internal predecessors, (123), 3 states have call successors, (21), 8 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 178 [2022-07-12 12:31:37,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:31:37,599 INFO L225 Difference]: With dead ends: 17916 [2022-07-12 12:31:37,599 INFO L226 Difference]: Without dead ends: 9808 [2022-07-12 12:31:37,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2022-07-12 12:31:37,619 INFO L413 NwaCegarLoop]: 2227 mSDtfsCounter, 2291 mSDsluCounter, 5243 mSDsCounter, 0 mSdLazyCounter, 8393 mSolverCounterSat, 1043 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2576 SdHoareTripleChecker+Valid, 7470 SdHoareTripleChecker+Invalid, 9436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1043 IncrementalHoareTripleChecker+Valid, 8393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:31:37,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2576 Valid, 7470 Invalid, 9436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1043 Valid, 8393 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2022-07-12 12:31:37,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9808 states. [2022-07-12 12:31:37,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9808 to 8126. [2022-07-12 12:31:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8126 states, 5897 states have (on average 1.3125317958283873) internal successors, (7740), 5993 states have internal predecessors, (7740), 1658 states have call successors, (1658), 461 states have call predecessors, (1658), 570 states have return successors, (2301), 1767 states have call predecessors, (2301), 1657 states have call successors, (2301) [2022-07-12 12:31:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8126 states to 8126 states and 11699 transitions. [2022-07-12 12:31:38,020 INFO L78 Accepts]: Start accepts. Automaton has 8126 states and 11699 transitions. Word has length 178 [2022-07-12 12:31:38,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:31:38,021 INFO L495 AbstractCegarLoop]: Abstraction has 8126 states and 11699 transitions. [2022-07-12 12:31:38,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 4 states have internal predecessors, (123), 3 states have call successors, (21), 8 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-12 12:31:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 8126 states and 11699 transitions. [2022-07-12 12:31:38,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-12 12:31:38,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:31:38,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:31:38,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 12:31:38,032 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:31:38,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:31:38,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1051927289, now seen corresponding path program 1 times [2022-07-12 12:31:38,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:31:38,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053101643] [2022-07-12 12:31:38,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:31:38,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:31:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:31:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:31:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:31:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:31:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:31:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:31:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:31:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:31:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:31:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:31:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 12:31:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 12:31:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:31:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:31:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:31:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:38,419 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-12 12:31:38,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:31:38,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053101643] [2022-07-12 12:31:38,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053101643] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:31:38,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:31:38,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 12:31:38,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719887356] [2022-07-12 12:31:38,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:31:38,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 12:31:38,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:31:38,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 12:31:38,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:31:38,422 INFO L87 Difference]: Start difference. First operand 8126 states and 11699 transitions. Second operand has 14 states, 14 states have (on average 8.642857142857142) internal successors, (121), 7 states have internal predecessors, (121), 4 states have call successors, (21), 8 states have call predecessors, (21), 4 states have return successors, (20), 6 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-12 12:31:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:31:50,649 INFO L93 Difference]: Finished difference Result 18992 states and 28188 transitions. [2022-07-12 12:31:50,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 12:31:50,650 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.642857142857142) internal successors, (121), 7 states have internal predecessors, (121), 4 states have call successors, (21), 8 states have call predecessors, (21), 4 states have return successors, (20), 6 states have call predecessors, (20), 4 states have call successors, (20) Word has length 176 [2022-07-12 12:31:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:31:50,693 INFO L225 Difference]: With dead ends: 18992 [2022-07-12 12:31:50,693 INFO L226 Difference]: Without dead ends: 10876 [2022-07-12 12:31:50,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2022-07-12 12:31:50,717 INFO L413 NwaCegarLoop]: 2122 mSDtfsCounter, 3232 mSDsluCounter, 6649 mSDsCounter, 0 mSdLazyCounter, 14823 mSolverCounterSat, 2074 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3501 SdHoareTripleChecker+Valid, 8771 SdHoareTripleChecker+Invalid, 16897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2074 IncrementalHoareTripleChecker+Valid, 14823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:31:50,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3501 Valid, 8771 Invalid, 16897 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2074 Valid, 14823 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2022-07-12 12:31:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10876 states. [2022-07-12 12:31:51,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10876 to 8810. [2022-07-12 12:31:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8810 states, 6399 states have (on average 1.3097358962337866) internal successors, (8381), 6482 states have internal predecessors, (8381), 1810 states have call successors, (1810), 461 states have call predecessors, (1810), 600 states have return successors, (2570), 1974 states have call predecessors, (2570), 1809 states have call successors, (2570) [2022-07-12 12:31:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8810 states to 8810 states and 12761 transitions. [2022-07-12 12:31:51,177 INFO L78 Accepts]: Start accepts. Automaton has 8810 states and 12761 transitions. Word has length 176 [2022-07-12 12:31:51,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:31:51,178 INFO L495 AbstractCegarLoop]: Abstraction has 8810 states and 12761 transitions. [2022-07-12 12:31:51,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.642857142857142) internal successors, (121), 7 states have internal predecessors, (121), 4 states have call successors, (21), 8 states have call predecessors, (21), 4 states have return successors, (20), 6 states have call predecessors, (20), 4 states have call successors, (20) [2022-07-12 12:31:51,178 INFO L276 IsEmpty]: Start isEmpty. Operand 8810 states and 12761 transitions. [2022-07-12 12:31:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-07-12 12:31:51,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:31:51,191 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:31:51,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 12:31:51,192 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:31:51,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:31:51,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2064649252, now seen corresponding path program 1 times [2022-07-12 12:31:51,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:31:51,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414925484] [2022-07-12 12:31:51,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:31:51,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:31:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:31:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:31:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:31:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:31:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:31:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:31:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:31:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:31:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:31:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:31:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:31:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:31:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 12:31:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 12:31:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 12:31:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-07-12 12:31:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:31:51,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414925484] [2022-07-12 12:31:51,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414925484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:31:51,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:31:51,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:31:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230040397] [2022-07-12 12:31:51,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:31:51,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:31:51,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:31:51,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:31:51,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:31:51,509 INFO L87 Difference]: Start difference. First operand 8810 states and 12761 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 12:31:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:31:55,574 INFO L93 Difference]: Finished difference Result 18452 states and 27353 transitions. [2022-07-12 12:31:55,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:31:55,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 188 [2022-07-12 12:31:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:31:55,617 INFO L225 Difference]: With dead ends: 18452 [2022-07-12 12:31:55,617 INFO L226 Difference]: Without dead ends: 9652 [2022-07-12 12:31:55,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:31:55,641 INFO L413 NwaCegarLoop]: 1512 mSDtfsCounter, 436 mSDsluCounter, 2462 mSDsCounter, 0 mSdLazyCounter, 2605 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 3974 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 2605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:31:55,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 3974 Invalid, 2920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 2605 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-12 12:31:55,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9652 states. [2022-07-12 12:31:55,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9652 to 8818. [2022-07-12 12:31:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8818 states, 6407 states have (on average 1.3093491493678788) internal successors, (8389), 6490 states have internal predecessors, (8389), 1810 states have call successors, (1810), 461 states have call predecessors, (1810), 600 states have return successors, (2570), 1974 states have call predecessors, (2570), 1809 states have call successors, (2570) [2022-07-12 12:31:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8818 states to 8818 states and 12769 transitions. [2022-07-12 12:31:55,976 INFO L78 Accepts]: Start accepts. Automaton has 8818 states and 12769 transitions. Word has length 188 [2022-07-12 12:31:55,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:31:55,977 INFO L495 AbstractCegarLoop]: Abstraction has 8818 states and 12769 transitions. [2022-07-12 12:31:55,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 12:31:55,977 INFO L276 IsEmpty]: Start isEmpty. Operand 8818 states and 12769 transitions. [2022-07-12 12:31:55,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-12 12:31:55,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:31:55,989 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:31:55,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 12:31:55,989 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:31:55,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:31:55,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1126153574, now seen corresponding path program 1 times [2022-07-12 12:31:55,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:31:55,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957905633] [2022-07-12 12:31:55,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:31:55,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:31:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:31:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:31:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:31:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:31:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:31:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:31:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:31:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:31:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:31:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:31:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:31:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:31:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:31:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:31:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:31:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:31:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-12 12:31:56,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:31:56,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957905633] [2022-07-12 12:31:56,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957905633] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:31:56,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330565213] [2022-07-12 12:31:56,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:31:56,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:31:56,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:31:56,395 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:31:56,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 12:31:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:57,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 3012 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 12:31:57,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:31:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-12 12:31:57,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:31:57,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330565213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:31:57,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:31:57,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2022-07-12 12:31:57,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673794091] [2022-07-12 12:31:57,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:31:57,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:31:57,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:31:57,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:31:57,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-07-12 12:31:57,334 INFO L87 Difference]: Start difference. First operand 8818 states and 12769 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-12 12:31:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:31:57,725 INFO L93 Difference]: Finished difference Result 17806 states and 25894 transitions. [2022-07-12 12:31:57,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:31:57,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 1 states have call successors, (21) Word has length 192 [2022-07-12 12:31:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:31:57,760 INFO L225 Difference]: With dead ends: 17806 [2022-07-12 12:31:57,760 INFO L226 Difference]: Without dead ends: 8998 [2022-07-12 12:31:57,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-07-12 12:31:57,783 INFO L413 NwaCegarLoop]: 1508 mSDtfsCounter, 10 mSDsluCounter, 4504 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6012 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:31:57,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6012 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 12:31:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8998 states. [2022-07-12 12:31:58,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8998 to 8866. [2022-07-12 12:31:58,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8866 states, 6443 states have (on average 1.307620673599255) internal successors, (8425), 6526 states have internal predecessors, (8425), 1810 states have call successors, (1810), 461 states have call predecessors, (1810), 612 states have return successors, (2618), 1986 states have call predecessors, (2618), 1809 states have call successors, (2618) [2022-07-12 12:31:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8866 states to 8866 states and 12853 transitions. [2022-07-12 12:31:58,126 INFO L78 Accepts]: Start accepts. Automaton has 8866 states and 12853 transitions. Word has length 192 [2022-07-12 12:31:58,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:31:58,126 INFO L495 AbstractCegarLoop]: Abstraction has 8866 states and 12853 transitions. [2022-07-12 12:31:58,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-12 12:31:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 8866 states and 12853 transitions. [2022-07-12 12:31:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-12 12:31:58,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:31:58,139 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:31:58,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 12:31:58,348 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,SelfDestructingSolverStorable17 [2022-07-12 12:31:58,349 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:31:58,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:31:58,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1097035060, now seen corresponding path program 1 times [2022-07-12 12:31:58,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:31:58,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5214366] [2022-07-12 12:31:58,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:31:58,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:31:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:31:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:31:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:31:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:31:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:31:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 12:31:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:31:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:31:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:31:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:31:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:31:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:31:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:31:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:31:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:31:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:31:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:31:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:31:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:58,778 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-12 12:31:58,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:31:58,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5214366] [2022-07-12 12:31:58,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5214366] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:31:58,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:31:58,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 12:31:58,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376183290] [2022-07-12 12:31:58,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:31:58,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 12:31:58,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:31:58,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 12:31:58,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:31:58,780 INFO L87 Difference]: Start difference. First operand 8866 states and 12853 transitions. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (23), 8 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-12 12:32:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:32:06,305 INFO L93 Difference]: Finished difference Result 19964 states and 29793 transitions. [2022-07-12 12:32:06,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 12:32:06,306 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (23), 8 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 1 states have call successors, (23) Word has length 206 [2022-07-12 12:32:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:32:06,349 INFO L225 Difference]: With dead ends: 19964 [2022-07-12 12:32:06,349 INFO L226 Difference]: Without dead ends: 11108 [2022-07-12 12:32:06,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-07-12 12:32:06,376 INFO L413 NwaCegarLoop]: 1592 mSDtfsCounter, 1331 mSDsluCounter, 5601 mSDsCounter, 0 mSdLazyCounter, 6045 mSolverCounterSat, 1055 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1454 SdHoareTripleChecker+Valid, 7193 SdHoareTripleChecker+Invalid, 7100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1055 IncrementalHoareTripleChecker+Valid, 6045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:32:06,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1454 Valid, 7193 Invalid, 7100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1055 Valid, 6045 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-07-12 12:32:06,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11108 states. [2022-07-12 12:32:06,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11108 to 8890. [2022-07-12 12:32:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8890 states, 6467 states have (on average 1.3064790474717798) internal successors, (8449), 6538 states have internal predecessors, (8449), 1810 states have call successors, (1810), 461 states have call predecessors, (1810), 612 states have return successors, (2618), 1998 states have call predecessors, (2618), 1809 states have call successors, (2618) [2022-07-12 12:32:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8890 states to 8890 states and 12877 transitions. [2022-07-12 12:32:06,838 INFO L78 Accepts]: Start accepts. Automaton has 8890 states and 12877 transitions. Word has length 206 [2022-07-12 12:32:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:32:06,838 INFO L495 AbstractCegarLoop]: Abstraction has 8890 states and 12877 transitions. [2022-07-12 12:32:06,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (23), 8 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 1 states have call successors, (23) [2022-07-12 12:32:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 8890 states and 12877 transitions. [2022-07-12 12:32:06,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-12 12:32:06,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:32:06,851 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:32:06,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 12:32:06,851 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:32:06,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:32:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1179649477, now seen corresponding path program 1 times [2022-07-12 12:32:06,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:32:06,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656219357] [2022-07-12 12:32:06,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:06,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:32:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:06,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:32:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:06,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:32:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:06,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:32:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:06,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:32:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:06,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:32:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:32:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:32:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:32:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 12:32:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 12:32:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:32:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:32:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 12:32:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 12:32:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 12:32:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-07-12 12:32:07,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:32:07,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656219357] [2022-07-12 12:32:07,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656219357] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:32:07,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476370287] [2022-07-12 12:32:07,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:07,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:32:07,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:32:07,135 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:32:07,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 12:32:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:07,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 2845 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 12:32:07,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:32:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2022-07-12 12:32:07,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:32:07,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476370287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:32:07,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:32:07,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-12 12:32:07,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446733633] [2022-07-12 12:32:07,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:32:07,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 12:32:07,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:32:07,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 12:32:07,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:32:07,959 INFO L87 Difference]: Start difference. First operand 8890 states and 12877 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-12 12:32:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:32:08,271 INFO L93 Difference]: Finished difference Result 17994 states and 26318 transitions. [2022-07-12 12:32:08,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 12:32:08,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 191 [2022-07-12 12:32:08,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:32:08,306 INFO L225 Difference]: With dead ends: 17994 [2022-07-12 12:32:08,307 INFO L226 Difference]: Without dead ends: 9114 [2022-07-12 12:32:08,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:32:08,330 INFO L413 NwaCegarLoop]: 1530 mSDtfsCounter, 13 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3032 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:32:08,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3032 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 12:32:08,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9114 states. [2022-07-12 12:32:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9114 to 8898. [2022-07-12 12:32:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8898 states, 6475 states have (on average 1.3061003861003861) internal successors, (8457), 6546 states have internal predecessors, (8457), 1810 states have call successors, (1810), 461 states have call predecessors, (1810), 612 states have return successors, (2618), 1998 states have call predecessors, (2618), 1809 states have call successors, (2618) [2022-07-12 12:32:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8898 states to 8898 states and 12885 transitions. [2022-07-12 12:32:08,757 INFO L78 Accepts]: Start accepts. Automaton has 8898 states and 12885 transitions. Word has length 191 [2022-07-12 12:32:08,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:32:08,757 INFO L495 AbstractCegarLoop]: Abstraction has 8898 states and 12885 transitions. [2022-07-12 12:32:08,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-12 12:32:08,757 INFO L276 IsEmpty]: Start isEmpty. Operand 8898 states and 12885 transitions. [2022-07-12 12:32:08,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-07-12 12:32:08,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:32:08,768 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:32:08,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 12:32:08,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:32:08,972 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:32:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:32:08,972 INFO L85 PathProgramCache]: Analyzing trace with hash -909332615, now seen corresponding path program 1 times [2022-07-12 12:32:08,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:32:08,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671475069] [2022-07-12 12:32:08,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:08,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:32:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:32:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:32:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:32:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:32:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:32:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 12:32:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:32:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:32:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:32:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:32:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:32:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:32:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:32:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:32:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:32:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:32:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:32:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 12:32:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 12:32:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 12:32:09,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:32:09,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671475069] [2022-07-12 12:32:09,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671475069] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:32:09,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982325037] [2022-07-12 12:32:09,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:09,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:32:09,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:32:09,375 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:32:09,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 12:32:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:10,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 3179 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 12:32:10,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:32:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 65 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 12:32:10,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:32:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 12:32:10,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982325037] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 12:32:10,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 12:32:10,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 22 [2022-07-12 12:32:10,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888352664] [2022-07-12 12:32:10,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 12:32:10,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 12:32:10,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:32:10,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 12:32:10,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2022-07-12 12:32:10,687 INFO L87 Difference]: Start difference. First operand 8898 states and 12885 transitions. Second operand has 22 states, 18 states have (on average 12.222222222222221) internal successors, (220), 13 states have internal predecessors, (220), 6 states have call successors, (60), 7 states have call predecessors, (60), 4 states have return successors, (49), 6 states have call predecessors, (49), 6 states have call successors, (49) [2022-07-12 12:32:14,824 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-12 12:32:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:32:22,857 INFO L93 Difference]: Finished difference Result 20788 states and 31223 transitions. [2022-07-12 12:32:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 12:32:22,858 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 12.222222222222221) internal successors, (220), 13 states have internal predecessors, (220), 6 states have call successors, (60), 7 states have call predecessors, (60), 4 states have return successors, (49), 6 states have call predecessors, (49), 6 states have call successors, (49) Word has length 219 [2022-07-12 12:32:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:32:22,902 INFO L225 Difference]: With dead ends: 20788 [2022-07-12 12:32:22,902 INFO L226 Difference]: Without dead ends: 11900 [2022-07-12 12:32:22,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2022-07-12 12:32:22,929 INFO L413 NwaCegarLoop]: 1598 mSDtfsCounter, 1348 mSDsluCounter, 12581 mSDsCounter, 0 mSdLazyCounter, 11956 mSolverCounterSat, 834 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 14179 SdHoareTripleChecker+Invalid, 12791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 834 IncrementalHoareTripleChecker+Valid, 11956 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:32:22,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 14179 Invalid, 12791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [834 Valid, 11956 Invalid, 1 Unknown, 0 Unchecked, 11.2s Time] [2022-07-12 12:32:22,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2022-07-12 12:32:23,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 8954. [2022-07-12 12:32:23,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8954 states, 6515 states have (on average 1.3017651573292401) internal successors, (8481), 6590 states have internal predecessors, (8481), 1822 states have call successors, (1822), 461 states have call predecessors, (1822), 616 states have return successors, (2642), 2010 states have call predecessors, (2642), 1821 states have call successors, (2642) [2022-07-12 12:32:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8954 states to 8954 states and 12945 transitions. [2022-07-12 12:32:23,336 INFO L78 Accepts]: Start accepts. Automaton has 8954 states and 12945 transitions. Word has length 219 [2022-07-12 12:32:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:32:23,337 INFO L495 AbstractCegarLoop]: Abstraction has 8954 states and 12945 transitions. [2022-07-12 12:32:23,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 12.222222222222221) internal successors, (220), 13 states have internal predecessors, (220), 6 states have call successors, (60), 7 states have call predecessors, (60), 4 states have return successors, (49), 6 states have call predecessors, (49), 6 states have call successors, (49) [2022-07-12 12:32:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 8954 states and 12945 transitions. [2022-07-12 12:32:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-12 12:32:23,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:32:23,349 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:32:23,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 12:32:23,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:32:23,555 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:32:23,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:32:23,556 INFO L85 PathProgramCache]: Analyzing trace with hash -67282068, now seen corresponding path program 1 times [2022-07-12 12:32:23,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:32:23,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551986999] [2022-07-12 12:32:23,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:23,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:32:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:32:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:32:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:32:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:32:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:32:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:32:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:32:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:32:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:32:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:32:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:32:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:32:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:32:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:32:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:32:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 12:32:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 12:32:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-12 12:32:23,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:32:23,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551986999] [2022-07-12 12:32:23,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551986999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:32:23,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:32:23,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 12:32:23,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307019] [2022-07-12 12:32:23,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:32:23,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 12:32:23,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:32:23,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 12:32:23,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:32:23,969 INFO L87 Difference]: Start difference. First operand 8954 states and 12945 transitions. Second operand has 12 states, 12 states have (on average 10.666666666666666) internal successors, (128), 7 states have internal predecessors, (128), 5 states have call successors, (23), 7 states have call predecessors, (23), 3 states have return successors, (22), 5 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-12 12:32:36,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:32:36,228 INFO L93 Difference]: Finished difference Result 20512 states and 30870 transitions. [2022-07-12 12:32:36,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 12:32:36,229 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.666666666666666) internal successors, (128), 7 states have internal predecessors, (128), 5 states have call successors, (23), 7 states have call predecessors, (23), 3 states have return successors, (22), 5 states have call predecessors, (22), 4 states have call successors, (22) Word has length 193 [2022-07-12 12:32:36,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:32:36,276 INFO L225 Difference]: With dead ends: 20512 [2022-07-12 12:32:36,277 INFO L226 Difference]: Without dead ends: 11568 [2022-07-12 12:32:36,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=668, Unknown=0, NotChecked=0, Total=930 [2022-07-12 12:32:36,306 INFO L413 NwaCegarLoop]: 1962 mSDtfsCounter, 4072 mSDsluCounter, 5365 mSDsCounter, 0 mSdLazyCounter, 12055 mSolverCounterSat, 2705 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4364 SdHoareTripleChecker+Valid, 7327 SdHoareTripleChecker+Invalid, 14760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2705 IncrementalHoareTripleChecker+Valid, 12055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:32:36,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4364 Valid, 7327 Invalid, 14760 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2705 Valid, 12055 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2022-07-12 12:32:36,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11568 states. [2022-07-12 12:32:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11568 to 8920. [2022-07-12 12:32:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8920 states, 6497 states have (on average 1.3032168693243036) internal successors, (8467), 6570 states have internal predecessors, (8467), 1806 states have call successors, (1806), 461 states have call predecessors, (1806), 616 states have return successors, (2618), 1988 states have call predecessors, (2618), 1805 states have call successors, (2618) [2022-07-12 12:32:36,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8920 states to 8920 states and 12891 transitions. [2022-07-12 12:32:36,725 INFO L78 Accepts]: Start accepts. Automaton has 8920 states and 12891 transitions. Word has length 193 [2022-07-12 12:32:36,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:32:36,726 INFO L495 AbstractCegarLoop]: Abstraction has 8920 states and 12891 transitions. [2022-07-12 12:32:36,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.666666666666666) internal successors, (128), 7 states have internal predecessors, (128), 5 states have call successors, (23), 7 states have call predecessors, (23), 3 states have return successors, (22), 5 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-12 12:32:36,726 INFO L276 IsEmpty]: Start isEmpty. Operand 8920 states and 12891 transitions. [2022-07-12 12:32:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-12 12:32:36,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:32:36,738 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:32:36,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 12:32:36,739 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:32:36,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:32:36,739 INFO L85 PathProgramCache]: Analyzing trace with hash 607878058, now seen corresponding path program 1 times [2022-07-12 12:32:36,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:32:36,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896838941] [2022-07-12 12:32:36,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:36,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:32:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:36,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:32:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:36,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:32:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:36,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:32:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:36,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:32:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:32:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:32:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:32:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:32:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:32:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:32:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:32:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:32:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:32:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:32:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:32:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 12:32:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 12:32:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-12 12:32:37,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:32:37,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896838941] [2022-07-12 12:32:37,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896838941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:32:37,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:32:37,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 12:32:37,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564813783] [2022-07-12 12:32:37,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:32:37,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 12:32:37,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:32:37,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 12:32:37,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:32:37,191 INFO L87 Difference]: Start difference. First operand 8920 states and 12891 transitions. Second operand has 11 states, 10 states have (on average 13.0) internal successors, (130), 5 states have internal predecessors, (130), 3 states have call successors, (23), 7 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-12 12:32:43,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:32:43,713 INFO L93 Difference]: Finished difference Result 19926 states and 29675 transitions. [2022-07-12 12:32:43,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 12:32:43,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.0) internal successors, (130), 5 states have internal predecessors, (130), 3 states have call successors, (23), 7 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 193 [2022-07-12 12:32:43,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:32:43,758 INFO L225 Difference]: With dead ends: 19926 [2022-07-12 12:32:43,758 INFO L226 Difference]: Without dead ends: 11016 [2022-07-12 12:32:43,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-07-12 12:32:43,783 INFO L413 NwaCegarLoop]: 1580 mSDtfsCounter, 1046 mSDsluCounter, 5769 mSDsCounter, 0 mSdLazyCounter, 5507 mSolverCounterSat, 731 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 7349 SdHoareTripleChecker+Invalid, 6238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 731 IncrementalHoareTripleChecker+Valid, 5507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:32:43,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 7349 Invalid, 6238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [731 Valid, 5507 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-12 12:32:43,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11016 states. [2022-07-12 12:32:44,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11016 to 8920. [2022-07-12 12:32:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8920 states, 6497 states have (on average 1.3004463598583962) internal successors, (8449), 6570 states have internal predecessors, (8449), 1806 states have call successors, (1806), 461 states have call predecessors, (1806), 616 states have return successors, (2618), 1988 states have call predecessors, (2618), 1805 states have call successors, (2618) [2022-07-12 12:32:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8920 states to 8920 states and 12873 transitions. [2022-07-12 12:32:44,257 INFO L78 Accepts]: Start accepts. Automaton has 8920 states and 12873 transitions. Word has length 193 [2022-07-12 12:32:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:32:44,258 INFO L495 AbstractCegarLoop]: Abstraction has 8920 states and 12873 transitions. [2022-07-12 12:32:44,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.0) internal successors, (130), 5 states have internal predecessors, (130), 3 states have call successors, (23), 7 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-12 12:32:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 8920 states and 12873 transitions. [2022-07-12 12:32:44,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-12 12:32:44,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:32:44,269 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:32:44,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 12:32:44,269 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:32:44,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:32:44,270 INFO L85 PathProgramCache]: Analyzing trace with hash -981710288, now seen corresponding path program 1 times [2022-07-12 12:32:44,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:32:44,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137007259] [2022-07-12 12:32:44,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:44,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:32:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:45,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:32:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:45,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:32:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:45,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:32:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:45,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:32:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:45,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:45,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:32:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:45,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:45,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:32:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:45,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:32:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:45,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:32:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:45,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:32:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:45,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:32:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:45,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:32:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:45,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:32:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:45,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:32:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:45,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:32:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:46,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:46,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:46,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:32:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:46,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:32:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:46,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 12:32:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:46,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 12:32:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:46,384 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 12:32:46,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:32:46,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137007259] [2022-07-12 12:32:46,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137007259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:32:46,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:32:46,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-12 12:32:46,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924367385] [2022-07-12 12:32:46,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:32:46,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 12:32:46,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:32:46,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 12:32:46,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2022-07-12 12:32:46,388 INFO L87 Difference]: Start difference. First operand 8920 states and 12873 transitions. Second operand has 21 states, 20 states have (on average 6.35) internal successors, (127), 12 states have internal predecessors, (127), 4 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-12 12:32:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:32:59,458 INFO L93 Difference]: Finished difference Result 20646 states and 30881 transitions. [2022-07-12 12:32:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 12:32:59,458 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.35) internal successors, (127), 12 states have internal predecessors, (127), 4 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22) Word has length 191 [2022-07-12 12:32:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:32:59,505 INFO L225 Difference]: With dead ends: 20646 [2022-07-12 12:32:59,505 INFO L226 Difference]: Without dead ends: 11736 [2022-07-12 12:32:59,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2022-07-12 12:32:59,532 INFO L413 NwaCegarLoop]: 1652 mSDtfsCounter, 1464 mSDsluCounter, 14685 mSDsCounter, 0 mSdLazyCounter, 13402 mSolverCounterSat, 1128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1604 SdHoareTripleChecker+Valid, 16337 SdHoareTripleChecker+Invalid, 14530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1128 IncrementalHoareTripleChecker+Valid, 13402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:32:59,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1604 Valid, 16337 Invalid, 14530 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1128 Valid, 13402 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2022-07-12 12:32:59,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11736 states. [2022-07-12 12:32:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11736 to 8968. [2022-07-12 12:32:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8968 states, 6541 states have (on average 1.2984253172297813) internal successors, (8493), 6602 states have internal predecessors, (8493), 1810 states have call successors, (1810), 461 states have call predecessors, (1810), 616 states have return successors, (2618), 2004 states have call predecessors, (2618), 1809 states have call successors, (2618) [2022-07-12 12:32:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8968 states to 8968 states and 12921 transitions. [2022-07-12 12:32:59,971 INFO L78 Accepts]: Start accepts. Automaton has 8968 states and 12921 transitions. Word has length 191 [2022-07-12 12:32:59,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:32:59,972 INFO L495 AbstractCegarLoop]: Abstraction has 8968 states and 12921 transitions. [2022-07-12 12:32:59,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.35) internal successors, (127), 12 states have internal predecessors, (127), 4 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-12 12:32:59,972 INFO L276 IsEmpty]: Start isEmpty. Operand 8968 states and 12921 transitions. [2022-07-12 12:33:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-12 12:33:00,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:33:00,033 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:33:00,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 12:33:00,033 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:33:00,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:33:00,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1256335762, now seen corresponding path program 1 times [2022-07-12 12:33:00,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:33:00,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610507916] [2022-07-12 12:33:00,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:33:00,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:33:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:33:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:33:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:33:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:33:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:33:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:33:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:33:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:33:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:33:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:33:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:33:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 12:33:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:33:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:33:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:33:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:33:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:33:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:33:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 12:33:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 12:33:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-12 12:33:00,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:33:00,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610507916] [2022-07-12 12:33:00,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610507916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:33:00,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:33:00,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:33:00,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924416980] [2022-07-12 12:33:00,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:33:00,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:33:00,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:33:00,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:33:00,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:33:00,474 INFO L87 Difference]: Start difference. First operand 8968 states and 12921 transitions. Second operand has 9 states, 9 states have (on average 15.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 12:33:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:33:06,333 INFO L93 Difference]: Finished difference Result 21294 states and 31841 transitions. [2022-07-12 12:33:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:33:06,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 202 [2022-07-12 12:33:06,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:33:06,377 INFO L225 Difference]: With dead ends: 21294 [2022-07-12 12:33:06,378 INFO L226 Difference]: Without dead ends: 12336 [2022-07-12 12:33:06,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:33:06,398 INFO L413 NwaCegarLoop]: 1601 mSDtfsCounter, 2140 mSDsluCounter, 2684 mSDsCounter, 0 mSdLazyCounter, 2840 mSolverCounterSat, 1873 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2292 SdHoareTripleChecker+Valid, 4285 SdHoareTripleChecker+Invalid, 4713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1873 IncrementalHoareTripleChecker+Valid, 2840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:33:06,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2292 Valid, 4285 Invalid, 4713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1873 Valid, 2840 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-12 12:33:06,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12336 states. [2022-07-12 12:33:06,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12336 to 9976. [2022-07-12 12:33:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9976 states, 7285 states have (on average 1.3058339052848318) internal successors, (9513), 7370 states have internal predecessors, (9513), 2074 states have call successors, (2074), 461 states have call predecessors, (2074), 616 states have return successors, (2942), 2280 states have call predecessors, (2942), 2073 states have call successors, (2942) [2022-07-12 12:33:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9976 states to 9976 states and 14529 transitions. [2022-07-12 12:33:06,863 INFO L78 Accepts]: Start accepts. Automaton has 9976 states and 14529 transitions. Word has length 202 [2022-07-12 12:33:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:33:06,864 INFO L495 AbstractCegarLoop]: Abstraction has 9976 states and 14529 transitions. [2022-07-12 12:33:06,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (24), 8 states have call predecessors, (24), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 12:33:06,864 INFO L276 IsEmpty]: Start isEmpty. Operand 9976 states and 14529 transitions. [2022-07-12 12:33:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-12 12:33:06,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:33:06,877 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:33:06,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 12:33:06,877 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:33:06,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:33:06,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1256285117, now seen corresponding path program 1 times [2022-07-12 12:33:06,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:33:06,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871331444] [2022-07-12 12:33:06,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:33:06,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:33:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:33:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:33:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:33:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:33:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:33:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 12:33:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:33:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:33:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:33:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 12:33:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:33:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 12:33:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:33:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 12:33:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 12:33:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:07,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:08,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:33:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:08,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 12:33:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:08,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 12:33:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:08,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 12:33:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 12:33:08,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:33:08,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871331444] [2022-07-12 12:33:08,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871331444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:33:08,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392982481] [2022-07-12 12:33:08,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:33:08,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:33:08,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:33:08,152 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 12:33:08,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 12:33:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:09,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 3006 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-12 12:33:09,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:33:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 12:33:09,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:33:09,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392982481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:33:09,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:33:09,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [24] total 36 [2022-07-12 12:33:09,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704621329] [2022-07-12 12:33:09,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:33:09,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 12:33:09,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:33:09,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 12:33:09,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 12:33:09,685 INFO L87 Difference]: Start difference. First operand 9976 states and 14529 transitions. Second operand has 16 states, 15 states have (on average 8.866666666666667) internal successors, (133), 12 states have internal predecessors, (133), 4 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-12 12:33:10,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:33:10,518 INFO L93 Difference]: Finished difference Result 20182 states and 29634 transitions. [2022-07-12 12:33:10,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 12:33:10,519 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 8.866666666666667) internal successors, (133), 12 states have internal predecessors, (133), 4 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22) Word has length 191 [2022-07-12 12:33:10,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:33:10,559 INFO L225 Difference]: With dead ends: 20182 [2022-07-12 12:33:10,559 INFO L226 Difference]: Without dead ends: 10216 [2022-07-12 12:33:10,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=1594, Unknown=0, NotChecked=0, Total=1722 [2022-07-12 12:33:10,589 INFO L413 NwaCegarLoop]: 1521 mSDtfsCounter, 43 mSDsluCounter, 19654 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 21175 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:33:10,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 21175 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 12:33:10,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10216 states. [2022-07-12 12:33:11,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10216 to 10000. [2022-07-12 12:33:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10000 states, 7309 states have (on average 1.3048296620604733) internal successors, (9537), 7386 states have internal predecessors, (9537), 2074 states have call successors, (2074), 461 states have call predecessors, (2074), 616 states have return successors, (2942), 2288 states have call predecessors, (2942), 2073 states have call successors, (2942) [2022-07-12 12:33:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10000 states to 10000 states and 14553 transitions. [2022-07-12 12:33:11,133 INFO L78 Accepts]: Start accepts. Automaton has 10000 states and 14553 transitions. Word has length 191 [2022-07-12 12:33:11,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:33:11,134 INFO L495 AbstractCegarLoop]: Abstraction has 10000 states and 14553 transitions. [2022-07-12 12:33:11,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 8.866666666666667) internal successors, (133), 12 states have internal predecessors, (133), 4 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-12 12:33:11,134 INFO L276 IsEmpty]: Start isEmpty. Operand 10000 states and 14553 transitions. [2022-07-12 12:33:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-12 12:33:11,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:33:11,150 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:33:11,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 12:33:11,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 12:33:11,360 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:33:11,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:33:11,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1364544696, now seen corresponding path program 1 times [2022-07-12 12:33:11,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:33:11,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263417595] [2022-07-12 12:33:11,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:33:11,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:33:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:33:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:33:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:33:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 12:33:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:33:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:33:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:33:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:33:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:33:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 12:33:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:33:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:33:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 12:33:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 12:33:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 12:33:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:33:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 12:33:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 12:33:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 12:33:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 12:33:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:33:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-12 12:33:11,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:33:11,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263417595] [2022-07-12 12:33:11,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263417595] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:33:11,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:33:11,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 12:33:11,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195709122] [2022-07-12 12:33:11,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:33:11,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 12:33:11,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:33:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 12:33:11,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:33:11,812 INFO L87 Difference]: Start difference. First operand 10000 states and 14553 transitions. Second operand has 10 states, 10 states have (on average 13.2) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (24), 8 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 12:33:18,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:33:18,153 INFO L93 Difference]: Finished difference Result 21108 states and 31528 transitions. [2022-07-12 12:33:18,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 12:33:18,153 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (24), 8 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 193 [2022-07-12 12:33:18,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:33:18,197 INFO L225 Difference]: With dead ends: 21108 [2022-07-12 12:33:18,197 INFO L226 Difference]: Without dead ends: 11102 [2022-07-12 12:33:18,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-07-12 12:33:18,227 INFO L413 NwaCegarLoop]: 1484 mSDtfsCounter, 928 mSDsluCounter, 3560 mSDsCounter, 0 mSdLazyCounter, 3218 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 5044 SdHoareTripleChecker+Invalid, 3955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 3218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:33:18,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 5044 Invalid, 3955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 3218 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-12 12:33:18,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11102 states.