./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--atm--atmtcp.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--atm--atmtcp.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 e6823a3e354b35bf05bec5e81d72dc7306859bf56793457624e681693cebdf0b --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 00:12:19,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 00:12:19,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 00:12:19,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 00:12:19,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 00:12:19,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 00:12:19,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 00:12:19,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 00:12:19,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 00:12:19,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 00:12:19,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 00:12:19,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 00:12:19,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 00:12:19,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 00:12:19,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 00:12:19,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 00:12:19,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 00:12:19,318 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 00:12:19,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 00:12:19,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 00:12:19,322 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 00:12:19,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 00:12:19,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 00:12:19,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 00:12:19,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 00:12:19,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 00:12:19,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 00:12:19,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 00:12:19,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 00:12:19,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 00:12:19,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 00:12:19,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 00:12:19,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 00:12:19,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 00:12:19,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 00:12:19,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 00:12:19,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 00:12:19,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 00:12:19,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 00:12:19,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 00:12:19,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 00:12:19,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 00:12:19,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 00:12:19,380 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 00:12:19,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 00:12:19,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 00:12:19,382 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 00:12:19,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 00:12:19,383 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 00:12:19,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 00:12:19,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 00:12:19,383 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 00:12:19,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 00:12:19,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 00:12:19,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 00:12:19,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 00:12:19,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 00:12:19,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 00:12:19,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 00:12:19,386 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 00:12:19,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 00:12:19,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 00:12:19,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 00:12:19,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 00:12:19,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 00:12:19,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 00:12:19,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 00:12:19,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 00:12:19,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 00:12:19,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 00:12:19,388 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 00:12:19,388 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 00:12:19,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 00:12:19,389 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 -> e6823a3e354b35bf05bec5e81d72dc7306859bf56793457624e681693cebdf0b [2022-07-20 00:12:19,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 00:12:19,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 00:12:19,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 00:12:19,701 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 00:12:19,702 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 00:12:19,704 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--atm--atmtcp.ko-entry_point.cil.out.i [2022-07-20 00:12:19,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77bcff9fa/41856cb99cb6464fbfc8820ed15561ab/FLAGa60400d2f [2022-07-20 00:12:20,519 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 00:12:20,520 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--atm--atmtcp.ko-entry_point.cil.out.i [2022-07-20 00:12:20,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77bcff9fa/41856cb99cb6464fbfc8820ed15561ab/FLAGa60400d2f [2022-07-20 00:12:20,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77bcff9fa/41856cb99cb6464fbfc8820ed15561ab [2022-07-20 00:12:20,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 00:12:20,740 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 00:12:20,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 00:12:20,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 00:12:20,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 00:12:20,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:12:20" (1/1) ... [2022-07-20 00:12:20,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740fd782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:12:20, skipping insertion in model container [2022-07-20 00:12:20,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:12:20" (1/1) ... [2022-07-20 00:12:20,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 00:12:20,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 00:12:22,086 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--atm--atmtcp.ko-entry_point.cil.out.i[225078,225091] [2022-07-20 00:12:22,130 WARN L611 FunctionHandler]: implicit declaration of function ldv_xmalloc [2022-07-20 00:12:22,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:12:22,177 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 00:12:22,497 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--atm--atmtcp.ko-entry_point.cil.out.i[225078,225091] [2022-07-20 00:12:22,523 WARN L611 FunctionHandler]: implicit declaration of function ldv_xmalloc [2022-07-20 00:12:22,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:12:22,580 INFO L208 MainTranslator]: Completed translation [2022-07-20 00:12:22,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:12:22 WrapperNode [2022-07-20 00:12:22,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 00:12:22,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 00:12:22,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 00:12:22,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 00:12:22,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:12:22" (1/1) ... [2022-07-20 00:12:22,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:12:22" (1/1) ... [2022-07-20 00:12:22,785 INFO L137 Inliner]: procedures = 141, calls = 1103, calls flagged for inlining = 57, calls inlined = 55, statements flattened = 2436 [2022-07-20 00:12:22,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 00:12:22,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 00:12:22,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 00:12:22,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 00:12:22,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:12:22" (1/1) ... [2022-07-20 00:12:22,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:12:22" (1/1) ... [2022-07-20 00:12:22,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:12:22" (1/1) ... [2022-07-20 00:12:22,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:12:22" (1/1) ... [2022-07-20 00:12:22,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:12:22" (1/1) ... [2022-07-20 00:12:22,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:12:22" (1/1) ... [2022-07-20 00:12:23,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:12:22" (1/1) ... [2022-07-20 00:12:23,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 00:12:23,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 00:12:23,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 00:12:23,044 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 00:12:23,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:12:22" (1/1) ... [2022-07-20 00:12:23,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 00:12:23,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:12:23,085 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-20 00:12:23,109 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-20 00:12:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure atm_sk [2022-07-20 00:12:23,130 INFO L138 BoogieDeclarations]: Found implementation of procedure atm_sk [2022-07-20 00:12:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure skb_copy_from_linear_data [2022-07-20 00:12:23,130 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_copy_from_linear_data [2022-07-20 00:12:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 00:12:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure change_bit [2022-07-20 00:12:23,131 INFO L138 BoogieDeclarations]: Found implementation of procedure change_bit [2022-07-20 00:12:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure atm_alloc_charge [2022-07-20 00:12:23,131 INFO L138 BoogieDeclarations]: Found implementation of procedure atm_alloc_charge [2022-07-20 00:12:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-20 00:12:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-20 00:12:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-20 00:12:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 00:12:23,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 00:12:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 00:12:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 00:12:23,132 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 00:12:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2022-07-20 00:12:23,133 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2022-07-20 00:12:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-20 00:12:23,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-20 00:12:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-20 00:12:23,133 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-20 00:12:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 00:12:23,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 00:12:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure sk_sleep [2022-07-20 00:12:23,134 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_sleep [2022-07-20 00:12:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-20 00:12:23,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-20 00:12:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure atmtcp_v_ioctl [2022-07-20 00:12:23,134 INFO L138 BoogieDeclarations]: Found implementation of procedure atmtcp_v_ioctl [2022-07-20 00:12:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 00:12:23,135 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 00:12:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 00:12:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-20 00:12:23,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-20 00:12:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 00:12:23,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 00:12:23,136 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-20 00:12:23,136 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-20 00:12:23,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-20 00:12:23,136 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-20 00:12:23,136 INFO L130 BoogieDeclarations]: Found specification of procedure atmtcp_v_dev_close [2022-07-20 00:12:23,137 INFO L138 BoogieDeclarations]: Found implementation of procedure atmtcp_v_dev_close [2022-07-20 00:12:23,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-20 00:12:23,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-20 00:12:23,137 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-20 00:12:23,137 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-20 00:12:23,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 00:12:23,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-07-20 00:12:23,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-07-20 00:12:23,138 INFO L130 BoogieDeclarations]: Found specification of procedure sk_atm [2022-07-20 00:12:23,138 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_atm [2022-07-20 00:12:23,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 00:12:23,139 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2022-07-20 00:12:23,139 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2022-07-20 00:12:23,140 INFO L130 BoogieDeclarations]: Found specification of procedure atmtcp_c_send [2022-07-20 00:12:23,140 INFO L138 BoogieDeclarations]: Found implementation of procedure atmtcp_c_send [2022-07-20 00:12:23,140 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-20 00:12:23,141 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-20 00:12:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 00:12:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 00:12:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-20 00:12:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 00:12:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-20 00:12:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure atmtcp_create [2022-07-20 00:12:23,142 INFO L138 BoogieDeclarations]: Found implementation of procedure atmtcp_create [2022-07-20 00:12:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure atmtcp_c_close [2022-07-20 00:12:23,142 INFO L138 BoogieDeclarations]: Found implementation of procedure atmtcp_c_close [2022-07-20 00:12:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure atm_dev_deregister [2022-07-20 00:12:23,142 INFO L138 BoogieDeclarations]: Found implementation of procedure atm_dev_deregister [2022-07-20 00:12:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 00:12:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 00:12:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure atmtcp_v_close [2022-07-20 00:12:23,143 INFO L138 BoogieDeclarations]: Found implementation of procedure atmtcp_v_close [2022-07-20 00:12:23,144 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-20 00:12:23,144 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-20 00:12:23,144 INFO L130 BoogieDeclarations]: Found specification of procedure atm_dev_put [2022-07-20 00:12:23,144 INFO L138 BoogieDeclarations]: Found implementation of procedure atm_dev_put [2022-07-20 00:12:23,144 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-20 00:12:23,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-20 00:12:23,145 INFO L130 BoogieDeclarations]: Found specification of procedure atm_dev_lookup [2022-07-20 00:12:23,145 INFO L138 BoogieDeclarations]: Found implementation of procedure atm_dev_lookup [2022-07-20 00:12:23,145 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-20 00:12:23,145 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-20 00:12:23,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 00:12:23,145 INFO L130 BoogieDeclarations]: Found specification of procedure atmtcp_v_send [2022-07-20 00:12:23,146 INFO L138 BoogieDeclarations]: Found implementation of procedure atmtcp_v_send [2022-07-20 00:12:23,146 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-20 00:12:23,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-20 00:12:23,147 INFO L130 BoogieDeclarations]: Found specification of procedure atmtcp_send_control [2022-07-20 00:12:23,147 INFO L138 BoogieDeclarations]: Found implementation of procedure atmtcp_send_control [2022-07-20 00:12:23,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-20 00:12:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_read_unlock [2022-07-20 00:12:23,148 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_read_unlock [2022-07-20 00:12:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 00:12:23,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 00:12:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_read_lock [2022-07-20 00:12:23,148 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_read_lock [2022-07-20 00:12:23,625 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 00:12:23,627 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 00:12:27,399 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 00:12:36,557 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 00:12:36,571 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 00:12:36,572 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 00:12:36,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:12:36 BoogieIcfgContainer [2022-07-20 00:12:36,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 00:12:36,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 00:12:36,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 00:12:36,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 00:12:36,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 12:12:20" (1/3) ... [2022-07-20 00:12:36,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe12c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:12:36, skipping insertion in model container [2022-07-20 00:12:36,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:12:22" (2/3) ... [2022-07-20 00:12:36,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe12c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:12:36, skipping insertion in model container [2022-07-20 00:12:36,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:12:36" (3/3) ... [2022-07-20 00:12:36,585 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--atm--atmtcp.ko-entry_point.cil.out.i [2022-07-20 00:12:36,600 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 00:12:36,603 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 00:12:36,681 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 00:12:36,696 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@1fefdd93, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@76951415 [2022-07-20 00:12:36,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 00:12:36,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 628 states, 450 states have (on average 1.3444444444444446) internal successors, (605), 467 states have internal predecessors, (605), 137 states have call successors, (137), 40 states have call predecessors, (137), 39 states have return successors, (132), 129 states have call predecessors, (132), 132 states have call successors, (132) [2022-07-20 00:12:36,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-20 00:12:36,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:12:36,731 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-20 00:12:36,732 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:12:36,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:12:36,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1856106833, now seen corresponding path program 1 times [2022-07-20 00:12:36,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:12:36,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020734056] [2022-07-20 00:12:36,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:12:36,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:12:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:12:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:12:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:12:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:12:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:12:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:12:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:12:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:12:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:12:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:12:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:12:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:12:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 00:12:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:12:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:12:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:12:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:12:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:12:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 00:12:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:12:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 00:12:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:12:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2022-07-20 00:12:37,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:12:37,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020734056] [2022-07-20 00:12:37,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020734056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:12:37,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:12:37,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 00:12:37,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640994502] [2022-07-20 00:12:37,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:12:37,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 00:12:37,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:12:37,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 00:12:37,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:12:37,715 INFO L87 Difference]: Start difference. First operand has 628 states, 450 states have (on average 1.3444444444444446) internal successors, (605), 467 states have internal predecessors, (605), 137 states have call successors, (137), 40 states have call predecessors, (137), 39 states have return successors, (132), 129 states have call predecessors, (132), 132 states have call successors, (132) Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-20 00:12:40,113 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:12:43,801 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:12:45,974 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:12:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:12:46,384 INFO L93 Difference]: Finished difference Result 1372 states and 1975 transitions. [2022-07-20 00:12:46,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 00:12:46,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 133 [2022-07-20 00:12:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:12:46,408 INFO L225 Difference]: With dead ends: 1372 [2022-07-20 00:12:46,408 INFO L226 Difference]: Without dead ends: 736 [2022-07-20 00:12:46,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:12:46,425 INFO L413 NwaCegarLoop]: 812 mSDtfsCounter, 558 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 401 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-07-20 00:12:46,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 1581 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 509 Invalid, 3 Unknown, 0 Unchecked, 8.4s Time] [2022-07-20 00:12:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2022-07-20 00:12:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 615. [2022-07-20 00:12:46,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 444 states have (on average 1.3288288288288288) internal successors, (590), 454 states have internal predecessors, (590), 132 states have call successors, (132), 39 states have call predecessors, (132), 38 states have return successors, (130), 127 states have call predecessors, (130), 130 states have call successors, (130) [2022-07-20 00:12:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 852 transitions. [2022-07-20 00:12:46,528 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 852 transitions. Word has length 133 [2022-07-20 00:12:46,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:12:46,528 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 852 transitions. [2022-07-20 00:12:46,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-20 00:12:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 852 transitions. [2022-07-20 00:12:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-20 00:12:46,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:12:46,532 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-20 00:12:46,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 00:12:46,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:12:46,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:12:46,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1666389307, now seen corresponding path program 1 times [2022-07-20 00:12:46,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:12:46,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200516600] [2022-07-20 00:12:46,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:12:46,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:12:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:12:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:12:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:12:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:12:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:12:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:12:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:12:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:12:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:12:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:12:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:12:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:12:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 00:12:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:12:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:12:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:12:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:12:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:12:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 00:12:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:12:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 00:12:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:12:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:12:46,942 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2022-07-20 00:12:46,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:12:46,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200516600] [2022-07-20 00:12:46,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200516600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:12:46,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:12:46,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 00:12:46,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898209779] [2022-07-20 00:12:46,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:12:46,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:12:46,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:12:46,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:12:46,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:12:46,947 INFO L87 Difference]: Start difference. First operand 615 states and 852 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-20 00:12:49,550 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:12:52,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:12:54,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:12:56,794 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:02,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:04,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:06,069 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-20 00:13:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:13:07,156 INFO L93 Difference]: Finished difference Result 2011 states and 2837 transitions. [2022-07-20 00:13:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:13:07,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 133 [2022-07-20 00:13:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:13:07,166 INFO L225 Difference]: With dead ends: 2011 [2022-07-20 00:13:07,167 INFO L226 Difference]: Without dead ends: 1420 [2022-07-20 00:13:07,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:13:07,171 INFO L413 NwaCegarLoop]: 901 mSDtfsCounter, 1566 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 805 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 2688 SdHoareTripleChecker+Invalid, 2171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 805 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2022-07-20 00:13:07,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1665 Valid, 2688 Invalid, 2171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [805 Valid, 1359 Invalid, 7 Unknown, 0 Unchecked, 19.9s Time] [2022-07-20 00:13:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2022-07-20 00:13:07,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1186. [2022-07-20 00:13:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 860 states have (on average 1.3325581395348838) internal successors, (1146), 879 states have internal predecessors, (1146), 250 states have call successors, (250), 75 states have call predecessors, (250), 75 states have return successors, (252), 243 states have call predecessors, (252), 248 states have call successors, (252) [2022-07-20 00:13:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1648 transitions. [2022-07-20 00:13:07,250 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1648 transitions. Word has length 133 [2022-07-20 00:13:07,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:13:07,253 INFO L495 AbstractCegarLoop]: Abstraction has 1186 states and 1648 transitions. [2022-07-20 00:13:07,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-20 00:13:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1648 transitions. [2022-07-20 00:13:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-20 00:13:07,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:13:07,265 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-20 00:13:07,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 00:13:07,266 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:13:07,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:13:07,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1873060620, now seen corresponding path program 1 times [2022-07-20 00:13:07,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:13:07,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186536542] [2022-07-20 00:13:07,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:07,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:13:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:13:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:13:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:13:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 00:13:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:13:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 00:13:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 00:13:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2022-07-20 00:13:07,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:13:07,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186536542] [2022-07-20 00:13:07,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186536542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:13:07,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:13:07,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:13:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43387503] [2022-07-20 00:13:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:13:07,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:13:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:13:07,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:13:07,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:13:07,795 INFO L87 Difference]: Start difference. First operand 1186 states and 1648 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-20 00:13:10,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:13,783 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:15,794 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:20,705 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:22,970 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:24,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:13:25,834 INFO L93 Difference]: Finished difference Result 2623 states and 3679 transitions. [2022-07-20 00:13:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 00:13:25,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 136 [2022-07-20 00:13:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:13:25,849 INFO L225 Difference]: With dead ends: 2623 [2022-07-20 00:13:25,849 INFO L226 Difference]: Without dead ends: 1461 [2022-07-20 00:13:25,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-20 00:13:25,859 INFO L413 NwaCegarLoop]: 1008 mSDtfsCounter, 1419 mSDsluCounter, 2267 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 584 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 3275 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2022-07-20 00:13:25,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 3275 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 1260 Invalid, 6 Unknown, 0 Unchecked, 17.7s Time] [2022-07-20 00:13:25,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2022-07-20 00:13:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1212. [2022-07-20 00:13:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 880 states have (on average 1.3295454545454546) internal successors, (1170), 899 states have internal predecessors, (1170), 251 states have call successors, (251), 80 states have call predecessors, (251), 80 states have return successors, (253), 244 states have call predecessors, (253), 249 states have call successors, (253) [2022-07-20 00:13:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1674 transitions. [2022-07-20 00:13:25,945 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1674 transitions. Word has length 136 [2022-07-20 00:13:25,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:13:25,946 INFO L495 AbstractCegarLoop]: Abstraction has 1212 states and 1674 transitions. [2022-07-20 00:13:25,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-20 00:13:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1674 transitions. [2022-07-20 00:13:25,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-20 00:13:25,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:13:25,950 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-20 00:13:25,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 00:13:25,951 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:13:25,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:13:25,955 INFO L85 PathProgramCache]: Analyzing trace with hash -764946523, now seen corresponding path program 1 times [2022-07-20 00:13:25,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:13:25,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636028718] [2022-07-20 00:13:25,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:25,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:13:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:13:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:13:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:13:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 00:13:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:13:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 00:13:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 00:13:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-20 00:13:26,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:13:26,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636028718] [2022-07-20 00:13:26,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636028718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:13:26,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:13:26,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 00:13:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200134596] [2022-07-20 00:13:26,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:13:26,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:13:26,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:13:26,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:13:26,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:13:26,440 INFO L87 Difference]: Start difference. First operand 1212 states and 1674 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-20 00:13:28,758 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:32,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:34,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:38,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:40,700 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:41,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:13:41,412 INFO L93 Difference]: Finished difference Result 4018 states and 5662 transitions. [2022-07-20 00:13:41,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:13:41,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 144 [2022-07-20 00:13:41,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:13:41,431 INFO L225 Difference]: With dead ends: 4018 [2022-07-20 00:13:41,432 INFO L226 Difference]: Without dead ends: 2826 [2022-07-20 00:13:41,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:13:41,440 INFO L413 NwaCegarLoop]: 912 mSDtfsCounter, 1574 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 807 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 2364 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-07-20 00:13:41,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1668 Valid, 2364 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 1048 Invalid, 5 Unknown, 0 Unchecked, 14.6s Time] [2022-07-20 00:13:41,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2022-07-20 00:13:41,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2337. [2022-07-20 00:13:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2337 states, 1701 states have (on average 1.332745443856555) internal successors, (2267), 1734 states have internal predecessors, (2267), 483 states have call successors, (483), 152 states have call predecessors, (483), 152 states have return successors, (489), 472 states have call predecessors, (489), 481 states have call successors, (489) [2022-07-20 00:13:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3239 transitions. [2022-07-20 00:13:41,559 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3239 transitions. Word has length 144 [2022-07-20 00:13:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:13:41,560 INFO L495 AbstractCegarLoop]: Abstraction has 2337 states and 3239 transitions. [2022-07-20 00:13:41,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-20 00:13:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3239 transitions. [2022-07-20 00:13:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-20 00:13:41,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:13:41,563 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-20 00:13:41,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 00:13:41,564 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:13:41,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:13:41,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1630948905, now seen corresponding path program 1 times [2022-07-20 00:13:41,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:13:41,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617654592] [2022-07-20 00:13:41,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:41,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:13:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:13:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:13:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:13:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 00:13:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:13:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 00:13:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 00:13:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:41,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:42,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-20 00:13:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:42,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-20 00:13:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2022-07-20 00:13:42,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:13:42,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617654592] [2022-07-20 00:13:42,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617654592] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:13:42,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:13:42,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:13:42,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945857094] [2022-07-20 00:13:42,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:13:42,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:13:42,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:13:42,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:13:42,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:13:42,026 INFO L87 Difference]: Start difference. First operand 2337 states and 3239 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 00:13:45,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:47,096 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:50,577 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:52,620 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:13:53,015 INFO L93 Difference]: Finished difference Result 4849 states and 6763 transitions. [2022-07-20 00:13:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:13:53,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 150 [2022-07-20 00:13:53,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:13:53,031 INFO L225 Difference]: With dead ends: 4849 [2022-07-20 00:13:53,031 INFO L226 Difference]: Without dead ends: 2536 [2022-07-20 00:13:53,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-20 00:13:53,042 INFO L413 NwaCegarLoop]: 683 mSDtfsCounter, 1185 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 592 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 592 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-07-20 00:13:53,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 1662 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [592 Valid, 639 Invalid, 4 Unknown, 0 Unchecked, 10.7s Time] [2022-07-20 00:13:53,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2022-07-20 00:13:53,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2005. [2022-07-20 00:13:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 1460 states have (on average 1.3253424657534247) internal successors, (1935), 1485 states have internal predecessors, (1935), 403 states have call successors, (403), 142 states have call predecessors, (403), 141 states have return successors, (401), 393 states have call predecessors, (401), 401 states have call successors, (401) [2022-07-20 00:13:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2739 transitions. [2022-07-20 00:13:53,137 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2739 transitions. Word has length 150 [2022-07-20 00:13:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:13:53,137 INFO L495 AbstractCegarLoop]: Abstraction has 2005 states and 2739 transitions. [2022-07-20 00:13:53,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 00:13:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2739 transitions. [2022-07-20 00:13:53,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-20 00:13:53,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:13:53,145 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:13:53,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 00:13:53,146 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:13:53,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:13:53,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2114242925, now seen corresponding path program 1 times [2022-07-20 00:13:53,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:13:53,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719213372] [2022-07-20 00:13:53,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:13:53,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:13:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:13:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:13:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:13:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:13:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 00:13:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:13:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:13:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 00:13:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 00:13:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:13:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-20 00:13:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 00:13:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 00:13:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 00:13:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:13:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2022-07-20 00:13:53,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:13:53,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719213372] [2022-07-20 00:13:53,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719213372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:13:53,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:13:53,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:13:53,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180824795] [2022-07-20 00:13:53,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:13:53,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:13:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:13:53,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:13:53,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:13:53,558 INFO L87 Difference]: Start difference. First operand 2005 states and 2739 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-20 00:13:57,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:13:59,053 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:02,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:04,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:14:05,897 INFO L93 Difference]: Finished difference Result 4611 states and 6384 transitions. [2022-07-20 00:14:05,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 00:14:05,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 175 [2022-07-20 00:14:05,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:14:05,914 INFO L225 Difference]: With dead ends: 4611 [2022-07-20 00:14:05,914 INFO L226 Difference]: Without dead ends: 2630 [2022-07-20 00:14:05,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 00:14:05,924 INFO L413 NwaCegarLoop]: 765 mSDtfsCounter, 1116 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 628 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-07-20 00:14:05,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 2355 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 1131 Invalid, 4 Unknown, 0 Unchecked, 12.0s Time] [2022-07-20 00:14:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2022-07-20 00:14:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2080. [2022-07-20 00:14:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2080 states, 1512 states have (on average 1.3326719576719577) internal successors, (2015), 1537 states have internal predecessors, (2015), 416 states have call successors, (416), 152 states have call predecessors, (416), 151 states have return successors, (414), 410 states have call predecessors, (414), 414 states have call successors, (414) [2022-07-20 00:14:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 2845 transitions. [2022-07-20 00:14:06,023 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 2845 transitions. Word has length 175 [2022-07-20 00:14:06,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:14:06,024 INFO L495 AbstractCegarLoop]: Abstraction has 2080 states and 2845 transitions. [2022-07-20 00:14:06,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-20 00:14:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 2845 transitions. [2022-07-20 00:14:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-20 00:14:06,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:14:06,030 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 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] [2022-07-20 00:14:06,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 00:14:06,030 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:14:06,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:14:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1065041216, now seen corresponding path program 1 times [2022-07-20 00:14:06,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:14:06,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847157665] [2022-07-20 00:14:06,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:14:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:14:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:14:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:14:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:14:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:14:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 00:14:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:14:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 00:14:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 00:14:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:14:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 00:14:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-07-20 00:14:06,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:14:06,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847157665] [2022-07-20 00:14:06,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847157665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:14:06,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:14:06,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:14:06,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788943189] [2022-07-20 00:14:06,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:14:06,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:14:06,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:14:06,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:14:06,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:14:06,540 INFO L87 Difference]: Start difference. First operand 2080 states and 2845 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-20 00:14:10,271 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:14,317 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:14:14,972 INFO L93 Difference]: Finished difference Result 4838 states and 6911 transitions. [2022-07-20 00:14:14,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:14:14,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 178 [2022-07-20 00:14:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:14:14,997 INFO L225 Difference]: With dead ends: 4838 [2022-07-20 00:14:14,997 INFO L226 Difference]: Without dead ends: 3141 [2022-07-20 00:14:15,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-20 00:14:15,007 INFO L413 NwaCegarLoop]: 858 mSDtfsCounter, 695 mSDsluCounter, 2055 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 321 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 2913 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-20 00:14:15,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 2913 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1231 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2022-07-20 00:14:15,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2022-07-20 00:14:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2084. [2022-07-20 00:14:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 1516 states have (on average 1.3317941952506596) internal successors, (2019), 1541 states have internal predecessors, (2019), 416 states have call successors, (416), 152 states have call predecessors, (416), 151 states have return successors, (414), 410 states have call predecessors, (414), 414 states have call successors, (414) [2022-07-20 00:14:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2849 transitions. [2022-07-20 00:14:15,134 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2849 transitions. Word has length 178 [2022-07-20 00:14:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:14:15,135 INFO L495 AbstractCegarLoop]: Abstraction has 2084 states and 2849 transitions. [2022-07-20 00:14:15,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-20 00:14:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2849 transitions. [2022-07-20 00:14:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-20 00:14:15,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:14:15,141 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 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] [2022-07-20 00:14:15,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 00:14:15,142 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:14:15,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:14:15,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1338240510, now seen corresponding path program 1 times [2022-07-20 00:14:15,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:14:15,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18065908] [2022-07-20 00:14:15,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:14:15,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:14:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:14:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:14:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:14:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:14:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 00:14:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:14:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 00:14:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 00:14:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:14:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 00:14:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-07-20 00:14:15,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:14:15,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18065908] [2022-07-20 00:14:15,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18065908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:14:15,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:14:15,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:14:15,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854277600] [2022-07-20 00:14:15,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:14:15,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:14:15,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:14:15,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:14:15,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:14:15,609 INFO L87 Difference]: Start difference. First operand 2084 states and 2849 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-20 00:14:19,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:23,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:25,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:14:26,174 INFO L93 Difference]: Finished difference Result 4846 states and 6919 transitions. [2022-07-20 00:14:26,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:14:26,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 179 [2022-07-20 00:14:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:14:26,197 INFO L225 Difference]: With dead ends: 4846 [2022-07-20 00:14:26,197 INFO L226 Difference]: Without dead ends: 3145 [2022-07-20 00:14:26,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-20 00:14:26,207 INFO L413 NwaCegarLoop]: 868 mSDtfsCounter, 788 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 348 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 2916 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-07-20 00:14:26,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 2916 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1113 Invalid, 3 Unknown, 0 Unchecked, 10.3s Time] [2022-07-20 00:14:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2022-07-20 00:14:26,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 2084. [2022-07-20 00:14:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 1516 states have (on average 1.3317941952506596) internal successors, (2019), 1541 states have internal predecessors, (2019), 416 states have call successors, (416), 152 states have call predecessors, (416), 151 states have return successors, (414), 410 states have call predecessors, (414), 414 states have call successors, (414) [2022-07-20 00:14:26,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2849 transitions. [2022-07-20 00:14:26,338 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2849 transitions. Word has length 179 [2022-07-20 00:14:26,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:14:26,338 INFO L495 AbstractCegarLoop]: Abstraction has 2084 states and 2849 transitions. [2022-07-20 00:14:26,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-20 00:14:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2849 transitions. [2022-07-20 00:14:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-07-20 00:14:26,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:14:26,345 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-20 00:14:26,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 00:14:26,345 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:14:26,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:14:26,346 INFO L85 PathProgramCache]: Analyzing trace with hash -463674758, now seen corresponding path program 1 times [2022-07-20 00:14:26,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:14:26,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572606053] [2022-07-20 00:14:26,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:14:26,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:14:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:14:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:14:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:14:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:14:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 00:14:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:14:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 00:14:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 00:14:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:14:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 00:14:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-20 00:14:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-20 00:14:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-07-20 00:14:26,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:14:26,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572606053] [2022-07-20 00:14:26,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572606053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:14:26,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:14:26,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:14:26,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231196116] [2022-07-20 00:14:26,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:14:26,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:14:26,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:14:26,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:14:26,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:14:26,887 INFO L87 Difference]: Start difference. First operand 2084 states and 2849 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-20 00:14:30,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:32,671 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:34,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:38,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:40,870 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:42,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:14:43,673 INFO L93 Difference]: Finished difference Result 4334 states and 6019 transitions. [2022-07-20 00:14:43,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:14:43,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 185 [2022-07-20 00:14:43,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:14:43,689 INFO L225 Difference]: With dead ends: 4334 [2022-07-20 00:14:43,689 INFO L226 Difference]: Without dead ends: 2633 [2022-07-20 00:14:43,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-20 00:14:43,697 INFO L413 NwaCegarLoop]: 662 mSDtfsCounter, 397 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 321 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2022-07-20 00:14:43,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 2605 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1242 Invalid, 6 Unknown, 0 Unchecked, 16.5s Time] [2022-07-20 00:14:43,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2022-07-20 00:14:43,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2088. [2022-07-20 00:14:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 1520 states have (on average 1.330921052631579) internal successors, (2023), 1545 states have internal predecessors, (2023), 416 states have call successors, (416), 152 states have call predecessors, (416), 151 states have return successors, (414), 410 states have call predecessors, (414), 414 states have call successors, (414) [2022-07-20 00:14:43,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2853 transitions. [2022-07-20 00:14:43,810 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2853 transitions. Word has length 185 [2022-07-20 00:14:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:14:43,811 INFO L495 AbstractCegarLoop]: Abstraction has 2088 states and 2853 transitions. [2022-07-20 00:14:43,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-20 00:14:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2853 transitions. [2022-07-20 00:14:43,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-07-20 00:14:43,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:14:43,817 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 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] [2022-07-20 00:14:43,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 00:14:43,817 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:14:43,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:14:43,818 INFO L85 PathProgramCache]: Analyzing trace with hash 255512636, now seen corresponding path program 1 times [2022-07-20 00:14:43,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:14:43,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680971111] [2022-07-20 00:14:43,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:14:43,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:14:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:14:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:14:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:14:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:14:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 00:14:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:14:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:14:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 00:14:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 00:14:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:14:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-20 00:14:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:14:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:14:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-07-20 00:14:44,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:14:44,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680971111] [2022-07-20 00:14:44,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680971111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:14:44,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:14:44,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 00:14:44,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573935707] [2022-07-20 00:14:44,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:14:44,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 00:14:44,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:14:44,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 00:14:44,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-20 00:14:44,521 INFO L87 Difference]: Start difference. First operand 2088 states and 2853 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (15), 7 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-20 00:14:49,075 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:51,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:56,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:14:58,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:15:01,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:15:03,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:15:06,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:15:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:15:07,136 INFO L93 Difference]: Finished difference Result 5662 states and 8325 transitions. [2022-07-20 00:15:07,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 00:15:07,137 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (15), 7 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 185 [2022-07-20 00:15:07,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:15:07,164 INFO L225 Difference]: With dead ends: 5662 [2022-07-20 00:15:07,164 INFO L226 Difference]: Without dead ends: 3957 [2022-07-20 00:15:07,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-07-20 00:15:07,175 INFO L413 NwaCegarLoop]: 904 mSDtfsCounter, 1412 mSDsluCounter, 4452 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 518 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 5356 SdHoareTripleChecker+Invalid, 3092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2022-07-20 00:15:07,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 5356 Invalid, 3092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 2567 Invalid, 7 Unknown, 0 Unchecked, 22.0s Time] [2022-07-20 00:15:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3957 states. [2022-07-20 00:15:07,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3957 to 2096. [2022-07-20 00:15:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 1526 states have (on average 1.3296199213630406) internal successors, (2029), 1551 states have internal predecessors, (2029), 416 states have call successors, (416), 152 states have call predecessors, (416), 153 states have return successors, (418), 412 states have call predecessors, (418), 414 states have call successors, (418) [2022-07-20 00:15:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 2863 transitions. [2022-07-20 00:15:07,353 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 2863 transitions. Word has length 185 [2022-07-20 00:15:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:15:07,354 INFO L495 AbstractCegarLoop]: Abstraction has 2096 states and 2863 transitions. [2022-07-20 00:15:07,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (15), 7 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-20 00:15:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 2863 transitions. [2022-07-20 00:15:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-07-20 00:15:07,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:15:07,362 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-20 00:15:07,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 00:15:07,362 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:15:07,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:15:07,363 INFO L85 PathProgramCache]: Analyzing trace with hash -388615980, now seen corresponding path program 1 times [2022-07-20 00:15:07,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:15:07,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618519972] [2022-07-20 00:15:07,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:15:07,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:15:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:15:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:15:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:15:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:15:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 00:15:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:15:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 00:15:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 00:15:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:07,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:15:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:08,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 00:15:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:08,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:08,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 00:15:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:08,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-20 00:15:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:08,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-20 00:15:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-07-20 00:15:08,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:15:08,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618519972] [2022-07-20 00:15:08,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618519972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:15:08,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:15:08,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-20 00:15:08,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770213684] [2022-07-20 00:15:08,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:15:08,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 00:15:08,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:15:08,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 00:15:08,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-20 00:15:08,384 INFO L87 Difference]: Start difference. First operand 2096 states and 2863 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (21), 7 states have call predecessors, (21), 3 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-20 00:15:12,810 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:15:14,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:15:19,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:15:21,996 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-20 00:15:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:15:23,274 INFO L93 Difference]: Finished difference Result 4364 states and 6055 transitions. [2022-07-20 00:15:23,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 00:15:23,275 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (21), 7 states have call predecessors, (21), 3 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) Word has length 197 [2022-07-20 00:15:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:15:23,292 INFO L225 Difference]: With dead ends: 4364 [2022-07-20 00:15:23,292 INFO L226 Difference]: Without dead ends: 2651 [2022-07-20 00:15:23,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-07-20 00:15:23,300 INFO L413 NwaCegarLoop]: 684 mSDtfsCounter, 790 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 655 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 4481 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 655 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-07-20 00:15:23,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 4481 Invalid, 2676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [655 Valid, 2017 Invalid, 4 Unknown, 0 Unchecked, 14.3s Time] [2022-07-20 00:15:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2651 states. [2022-07-20 00:15:23,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2651 to 2108. [2022-07-20 00:15:23,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 1534 states have (on average 1.3279009126466754) internal successors, (2037), 1559 states have internal predecessors, (2037), 416 states have call successors, (416), 152 states have call predecessors, (416), 157 states have return successors, (434), 416 states have call predecessors, (434), 414 states have call successors, (434) [2022-07-20 00:15:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 2887 transitions. [2022-07-20 00:15:23,477 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 2887 transitions. Word has length 197 [2022-07-20 00:15:23,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:15:23,478 INFO L495 AbstractCegarLoop]: Abstraction has 2108 states and 2887 transitions. [2022-07-20 00:15:23,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (21), 7 states have call predecessors, (21), 3 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-20 00:15:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2887 transitions. [2022-07-20 00:15:23,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-20 00:15:23,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:15:23,485 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-20 00:15:23,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 00:15:23,485 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:15:23,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:15:23,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1443188453, now seen corresponding path program 1 times [2022-07-20 00:15:23,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:15:23,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747081192] [2022-07-20 00:15:23,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:15:23,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:15:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:15:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:15:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:15:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:15:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 00:15:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:15:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 00:15:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 00:15:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:23,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:15:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:24,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-20 00:15:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:24,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:24,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-20 00:15:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:24,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-20 00:15:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:24,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-20 00:15:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-07-20 00:15:24,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:15:24,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747081192] [2022-07-20 00:15:24,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747081192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:15:24,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:15:24,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 00:15:24,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750399616] [2022-07-20 00:15:24,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:15:24,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 00:15:24,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:15:24,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 00:15:24,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-20 00:15:24,395 INFO L87 Difference]: Start difference. First operand 2108 states and 2887 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (21), 7 states have call predecessors, (21), 3 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-20 00:15:28,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:15:30,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:15:36,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:15:38,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:15:40,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:15:42,480 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:15:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:15:43,756 INFO L93 Difference]: Finished difference Result 4763 states and 6744 transitions. [2022-07-20 00:15:43,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 00:15:43,757 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (21), 7 states have call predecessors, (21), 3 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) Word has length 196 [2022-07-20 00:15:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:15:43,770 INFO L225 Difference]: With dead ends: 4763 [2022-07-20 00:15:43,771 INFO L226 Difference]: Without dead ends: 3038 [2022-07-20 00:15:43,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-07-20 00:15:43,779 INFO L413 NwaCegarLoop]: 882 mSDtfsCounter, 672 mSDsluCounter, 5304 mSDsCounter, 0 mSdLazyCounter, 2199 mSolverCounterSat, 450 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 6186 SdHoareTripleChecker+Invalid, 2655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 2199 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2022-07-20 00:15:43,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 6186 Invalid, 2655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 2199 Invalid, 6 Unknown, 0 Unchecked, 18.9s Time] [2022-07-20 00:15:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2022-07-20 00:15:43,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 2112. [2022-07-20 00:15:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 1538 states have (on average 1.3270481144343302) internal successors, (2041), 1561 states have internal predecessors, (2041), 416 states have call successors, (416), 152 states have call predecessors, (416), 157 states have return successors, (434), 418 states have call predecessors, (434), 414 states have call successors, (434) [2022-07-20 00:15:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2891 transitions. [2022-07-20 00:15:43,917 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2891 transitions. Word has length 196 [2022-07-20 00:15:43,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:15:43,918 INFO L495 AbstractCegarLoop]: Abstraction has 2112 states and 2891 transitions. [2022-07-20 00:15:43,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (21), 7 states have call predecessors, (21), 3 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-20 00:15:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2891 transitions. [2022-07-20 00:15:43,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-20 00:15:43,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:15:43,925 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-20 00:15:43,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 00:15:43,926 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:15:43,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:15:43,926 INFO L85 PathProgramCache]: Analyzing trace with hash 316291474, now seen corresponding path program 1 times [2022-07-20 00:15:43,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:15:43,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477596552] [2022-07-20 00:15:43,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:15:43,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:15:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:15:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:15:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:15:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:15:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 00:15:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:15:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 00:15:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 00:15:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:15:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 00:15:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:15:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 00:15:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-20 00:15:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 00:15:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-07-20 00:15:44,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:15:44,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477596552] [2022-07-20 00:15:44,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477596552] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:15:44,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564465729] [2022-07-20 00:15:44,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:15:44,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:15:44,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:15:44,666 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-20 00:15:44,668 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-20 00:15:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:45,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 2247 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 00:15:45,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:15:45,581 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-07-20 00:15:45,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:15:45,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564465729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:15:45,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:15:45,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2022-07-20 00:15:45,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613810546] [2022-07-20 00:15:45,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:15:45,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:15:45,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:15:45,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:15:45,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-20 00:15:45,585 INFO L87 Difference]: Start difference. First operand 2112 states and 2891 transitions. Second operand has 6 states, 5 states have (on average 19.0) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-20 00:15:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:15:45,902 INFO L93 Difference]: Finished difference Result 4216 states and 5809 transitions. [2022-07-20 00:15:45,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:15:45,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.0) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 203 [2022-07-20 00:15:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:15:45,927 INFO L225 Difference]: With dead ends: 4216 [2022-07-20 00:15:45,927 INFO L226 Difference]: Without dead ends: 2117 [2022-07-20 00:15:45,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-07-20 00:15:45,937 INFO L413 NwaCegarLoop]: 714 mSDtfsCounter, 6 mSDsluCounter, 2840 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3554 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 00:15:45,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3554 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 00:15:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2022-07-20 00:15:46,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 2117. [2022-07-20 00:15:46,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 1543 states have (on average 1.3259883344134802) internal successors, (2046), 1566 states have internal predecessors, (2046), 416 states have call successors, (416), 152 states have call predecessors, (416), 157 states have return successors, (434), 418 states have call predecessors, (434), 414 states have call successors, (434) [2022-07-20 00:15:46,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 2896 transitions. [2022-07-20 00:15:46,056 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 2896 transitions. Word has length 203 [2022-07-20 00:15:46,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:15:46,056 INFO L495 AbstractCegarLoop]: Abstraction has 2117 states and 2896 transitions. [2022-07-20 00:15:46,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.0) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-20 00:15:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2896 transitions. [2022-07-20 00:15:46,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-07-20 00:15:46,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:15:46,063 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2022-07-20 00:15:46,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 00:15:46,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-20 00:15:46,285 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:15:46,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:15:46,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1629733937, now seen corresponding path program 1 times [2022-07-20 00:15:46,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:15:46,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398870945] [2022-07-20 00:15:46,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:15:46,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:15:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:15:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:15:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:15:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:15:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 00:15:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:15:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:15:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 00:15:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:46,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:47,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 00:15:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:47,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:47,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 00:15:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:47,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-20 00:15:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:47,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:15:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:47,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:15:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:47,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-20 00:15:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:47,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 00:15:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:47,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-20 00:15:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-07-20 00:15:47,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:15:47,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398870945] [2022-07-20 00:15:47,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398870945] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:15:47,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211573553] [2022-07-20 00:15:47,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:15:47,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:15:47,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:15:47,177 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-20 00:15:47,202 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-20 00:15:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:15:47,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 2263 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 00:15:47,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:15:48,302 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 36 proven. 1 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2022-07-20 00:15:48,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:15:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-07-20 00:15:49,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211573553] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 00:15:49,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 00:15:49,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2022-07-20 00:15:49,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267168813] [2022-07-20 00:15:49,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 00:15:49,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 00:15:49,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:15:49,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 00:15:49,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-07-20 00:15:49,173 INFO L87 Difference]: Start difference. First operand 2117 states and 2896 transitions. Second operand has 18 states, 16 states have (on average 8.5) internal successors, (136), 13 states have internal predecessors, (136), 4 states have call successors, (47), 7 states have call predecessors, (47), 6 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2022-07-20 00:15:55,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:15:57,501 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:16:04,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:16:06,040 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:16:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:16:07,600 INFO L93 Difference]: Finished difference Result 4735 states and 6580 transitions. [2022-07-20 00:16:07,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 00:16:07,601 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.5) internal successors, (136), 13 states have internal predecessors, (136), 4 states have call successors, (47), 7 states have call predecessors, (47), 6 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) Word has length 204 [2022-07-20 00:16:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:16:07,609 INFO L225 Difference]: With dead ends: 4735 [2022-07-20 00:16:07,610 INFO L226 Difference]: Without dead ends: 2631 [2022-07-20 00:16:07,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 452 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2022-07-20 00:16:07,617 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 570 mSDsluCounter, 5589 mSDsCounter, 0 mSdLazyCounter, 2875 mSolverCounterSat, 499 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 6252 SdHoareTripleChecker+Invalid, 3378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 2875 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2022-07-20 00:16:07,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 6252 Invalid, 3378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 2875 Invalid, 4 Unknown, 0 Unchecked, 17.6s Time] [2022-07-20 00:16:07,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2022-07-20 00:16:07,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2127. [2022-07-20 00:16:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 1551 states have (on average 1.324306898774984) internal successors, (2054), 1574 states have internal predecessors, (2054), 417 states have call successors, (417), 153 states have call predecessors, (417), 158 states have return successors, (435), 419 states have call predecessors, (435), 415 states have call successors, (435) [2022-07-20 00:16:07,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 2906 transitions. [2022-07-20 00:16:07,744 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 2906 transitions. Word has length 204 [2022-07-20 00:16:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:16:07,745 INFO L495 AbstractCegarLoop]: Abstraction has 2127 states and 2906 transitions. [2022-07-20 00:16:07,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.5) internal successors, (136), 13 states have internal predecessors, (136), 4 states have call successors, (47), 7 states have call predecessors, (47), 6 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2022-07-20 00:16:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2906 transitions. [2022-07-20 00:16:07,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-20 00:16:07,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:16:07,752 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:16:07,786 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-20 00:16:07,971 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,SelfDestructingSolverStorable13 [2022-07-20 00:16:07,971 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:16:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:16:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1687797189, now seen corresponding path program 2 times [2022-07-20 00:16:07,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:16:07,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710767279] [2022-07-20 00:16:07,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:16:07,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:16:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:16:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:16:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:16:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:16:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:16:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:16:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:16:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:16:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 00:16:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:16:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 00:16:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:16:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 00:16:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 00:16:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 00:16:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 00:16:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:16:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:16:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-20 00:16:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-20 00:16:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-20 00:16:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:16:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2022-07-20 00:16:08,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:16:08,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710767279] [2022-07-20 00:16:08,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710767279] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:16:08,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898182499] [2022-07-20 00:16:08,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 00:16:08,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:16:08,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:16:08,895 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-20 00:16:08,896 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-20 00:16:09,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 00:16:09,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 00:16:09,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 2293 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 00:16:09,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:16:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 33 proven. 10 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-07-20 00:16:10,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:16:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2022-07-20 00:16:11,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898182499] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 00:16:11,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 00:16:11,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 22 [2022-07-20 00:16:11,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943714209] [2022-07-20 00:16:11,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 00:16:11,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 00:16:11,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:16:11,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 00:16:11,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2022-07-20 00:16:11,399 INFO L87 Difference]: Start difference. First operand 2127 states and 2906 transitions. Second operand has 22 states, 20 states have (on average 6.8) internal successors, (136), 17 states have internal predecessors, (136), 4 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (31), 5 states have call predecessors, (31), 4 states have call successors, (31) [2022-07-20 00:16:17,605 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:16:19,612 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []