./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-cadence-macb.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c36dfa3b 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-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-cadence-macb.cil.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 3a2c6724f5301da85e20fbddd1914030623487cb494f00194a53042f01a1dafb --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-04 12:58:40,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 12:58:40,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 12:58:40,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 12:58:40,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 12:58:40,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 12:58:40,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 12:58:40,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 12:58:40,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 12:58:40,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 12:58:40,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 12:58:40,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 12:58:40,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 12:58:40,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 12:58:40,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 12:58:40,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 12:58:40,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 12:58:40,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 12:58:40,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 12:58:40,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 12:58:40,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 12:58:40,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 12:58:40,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 12:58:40,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 12:58:40,738 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 12:58:40,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 12:58:40,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 12:58:40,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 12:58:40,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 12:58:40,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 12:58:40,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 12:58:40,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 12:58:40,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 12:58:40,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 12:58:40,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 12:58:40,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 12:58:40,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 12:58:40,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 12:58:40,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 12:58:40,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 12:58:40,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 12:58:40,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-04 12:58:40,770 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 12:58:40,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 12:58:40,776 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 12:58:40,776 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 12:58:40,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 12:58:40,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 12:58:40,778 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 12:58:40,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 12:58:40,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-04 12:58:40,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 12:58:40,779 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 12:58:40,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 12:58:40,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 12:58:40,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 12:58:40,779 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 12:58:40,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 12:58:40,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 12:58:40,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 12:58:40,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 12:58:40,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 12:58:40,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 12:58:40,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 12:58:40,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 12:58:40,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-04 12:58:40,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-04 12:58:40,781 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 12:58:40,781 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 12:58:40,782 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 12:58:40,782 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 12:58:40,783 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 -> 3a2c6724f5301da85e20fbddd1914030623487cb494f00194a53042f01a1dafb [2021-11-04 12:58:40,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 12:58:41,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 12:58:41,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 12:58:41,020 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 12:58:41,022 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 12:58:41,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-cadence-macb.cil.i [2021-11-04 12:58:41,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ba58797/05a35daf69bb4b8a9511aff7bd4bb394/FLAGe1b372dab [2021-11-04 12:58:41,727 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 12:58:41,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-cadence-macb.cil.i [2021-11-04 12:58:41,775 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ba58797/05a35daf69bb4b8a9511aff7bd4bb394/FLAGe1b372dab [2021-11-04 12:58:42,102 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ba58797/05a35daf69bb4b8a9511aff7bd4bb394 [2021-11-04 12:58:42,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 12:58:42,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 12:58:42,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 12:58:42,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 12:58:42,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 12:58:42,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:58:42" (1/1) ... [2021-11-04 12:58:42,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249973a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:58:42, skipping insertion in model container [2021-11-04 12:58:42,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:58:42" (1/1) ... [2021-11-04 12:58:42,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 12:58:42,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 12:58:44,164 WARN L228 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-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-cadence-macb.cil.i[325844,325857] [2021-11-04 12:58:44,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 12:58:44,224 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 12:58:44,502 WARN L228 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-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-cadence-macb.cil.i[325844,325857] [2021-11-04 12:58:44,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 12:58:44,632 INFO L208 MainTranslator]: Completed translation [2021-11-04 12:58:44,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:58:44 WrapperNode [2021-11-04 12:58:44,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 12:58:44,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 12:58:44,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 12:58:44,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 12:58:44,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:58:44" (1/1) ... [2021-11-04 12:58:44,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:58:44" (1/1) ... [2021-11-04 12:58:45,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 12:58:45,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 12:58:45,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 12:58:45,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 12:58:45,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:58:44" (1/1) ... [2021-11-04 12:58:45,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:58:44" (1/1) ... [2021-11-04 12:58:45,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:58:44" (1/1) ... [2021-11-04 12:58:45,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:58:44" (1/1) ... [2021-11-04 12:58:45,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:58:44" (1/1) ... [2021-11-04 12:58:46,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:58:44" (1/1) ... [2021-11-04 12:58:46,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:58:44" (1/1) ... [2021-11-04 12:58:46,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 12:58:46,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 12:58:46,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 12:58:46,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 12:58:46,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:58:44" (1/1) ... [2021-11-04 12:58:46,252 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 12:58:46,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 12:58:46,272 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) [2021-11-04 12:58:46,291 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 [2021-11-04 12:58:46,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_netdev_open_9_6 [2021-11-04 12:58:46,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_netdev_open_9_6 [2021-11-04 12:58:46,302 INFO L130 BoogieDeclarations]: Found specification of procedure macb_probe [2021-11-04 12:58:46,303 INFO L138 BoogieDeclarations]: Found implementation of procedure macb_probe [2021-11-04 12:58:46,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 12:58:46,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-04 12:58:46,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-04 12:58:46,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-04 12:58:46,303 INFO L130 BoogieDeclarations]: Found specification of procedure macb_open [2021-11-04 12:58:46,303 INFO L138 BoogieDeclarations]: Found implementation of procedure macb_open [2021-11-04 12:58:46,303 INFO L130 BoogieDeclarations]: Found specification of procedure macb_alloc_consistent [2021-11-04 12:58:46,304 INFO L138 BoogieDeclarations]: Found implementation of procedure macb_alloc_consistent [2021-11-04 12:58:46,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-04 12:58:46,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_netdev [2021-11-04 12:58:46,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_netdev [2021-11-04 12:58:46,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 12:58:46,304 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-11-04 12:58:46,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-11-04 12:58:46,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 12:58:46,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 12:58:46,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-04 12:58:46,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-04 12:58:46,305 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_netdev_17 [2021-11-04 12:58:46,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_netdev_17 [2021-11-04 12:58:46,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 12:58:46,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 12:58:46,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 12:58:46,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-04 12:58:46,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-04 12:58:50,013 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint L10337: #t~ret1466 := main_#res; [2021-11-04 12:58:50,014 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-04 12:58:50,014 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_11_returnLabel: main_#res := 0; [2021-11-04 12:58:50,541 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 12:58:50,541 INFO L299 CfgBuilder]: Removed 6069 assume(true) statements. [2021-11-04 12:58:50,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:58:50 BoogieIcfgContainer [2021-11-04 12:58:50,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 12:58:50,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 12:58:50,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 12:58:50,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 12:58:50,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 12:58:42" (1/3) ... [2021-11-04 12:58:50,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f00a500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:58:50, skipping insertion in model container [2021-11-04 12:58:50,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:58:44" (2/3) ... [2021-11-04 12:58:50,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f00a500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:58:50, skipping insertion in model container [2021-11-04 12:58:50,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:58:50" (3/3) ... [2021-11-04 12:58:50,555 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_linux-drivers-clk1_drivers-net-ethernet-cadence-macb.cil.i [2021-11-04 12:58:50,558 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 12:58:50,559 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2021-11-04 12:58:50,607 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 12:58:50,613 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-04 12:58:50,613 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-11-04 12:58:50,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 5157 states, 5117 states have (on average 1.3083838186437367) internal successors, (6695), 5124 states have internal predecessors, (6695), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-04 12:58:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-04 12:58:50,683 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 12:58:50,683 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 12:58:50,683 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 12:58:50,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 12:58:50,687 INFO L85 PathProgramCache]: Analyzing trace with hash -378521565, now seen corresponding path program 1 times [2021-11-04 12:58:50,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 12:58:50,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877436134] [2021-11-04 12:58:50,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 12:58:50,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 12:58:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 12:58:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 12:58:51,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 12:58:51,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877436134] [2021-11-04 12:58:51,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877436134] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 12:58:51,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 12:58:51,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 12:58:51,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374559595] [2021-11-04 12:58:51,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 12:58:51,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 12:58:51,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 12:58:51,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 12:58:51,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 12:58:51,270 INFO L87 Difference]: Start difference. First operand has 5157 states, 5117 states have (on average 1.3083838186437367) internal successors, (6695), 5124 states have internal predecessors, (6695), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 12:58:56,276 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 12:59:09,337 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 12:59:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 12:59:12,245 INFO L93 Difference]: Finished difference Result 10606 states and 13900 transitions. [2021-11-04 12:59:12,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 12:59:12,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-04 12:59:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 12:59:12,303 INFO L225 Difference]: With dead ends: 10606 [2021-11-04 12:59:12,303 INFO L226 Difference]: Without dead ends: 5372 [2021-11-04 12:59:12,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.51ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 12:59:12,359 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 6641 mSDsluCounter, 7059 mSDsCounter, 0 mSdLazyCounter, 13417 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18097.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6642 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 13427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 54.20ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 13417 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20231.24ms IncrementalHoareTripleChecker+Time [2021-11-04 12:59:12,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6642 Valid, 311 Invalid, 13427 Unknown, 0 Unchecked, 54.20ms Time], IncrementalHoareTripleChecker [8 Valid, 13417 Invalid, 2 Unknown, 0 Unchecked, 20231.24ms Time] [2021-11-04 12:59:12,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5372 states. [2021-11-04 12:59:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5372 to 5047. [2021-11-04 12:59:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5047 states, 5009 states have (on average 1.27690157716111) internal successors, (6396), 5014 states have internal predecessors, (6396), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2021-11-04 12:59:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 6446 transitions. [2021-11-04 12:59:12,573 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 6446 transitions. Word has length 22 [2021-11-04 12:59:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 12:59:12,573 INFO L470 AbstractCegarLoop]: Abstraction has 5047 states and 6446 transitions. [2021-11-04 12:59:12,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 12:59:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 6446 transitions. [2021-11-04 12:59:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-04 12:59:12,574 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 12:59:12,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 12:59:12,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-04 12:59:12,575 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 12:59:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 12:59:12,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1313457478, now seen corresponding path program 1 times [2021-11-04 12:59:12,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 12:59:12,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835678068] [2021-11-04 12:59:12,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 12:59:12,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 12:59:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 12:59:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 12:59:12,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 12:59:12,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835678068] [2021-11-04 12:59:12,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835678068] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 12:59:12,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 12:59:12,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 12:59:12,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757492986] [2021-11-04 12:59:12,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 12:59:12,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 12:59:12,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 12:59:12,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 12:59:12,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 12:59:12,727 INFO L87 Difference]: Start difference. First operand 5047 states and 6446 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 12:59:38,393 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 12:59:41,597 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 12:59:44,237 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 12:59:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 12:59:44,631 INFO L93 Difference]: Finished difference Result 10029 states and 12854 transitions. [2021-11-04 12:59:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 12:59:44,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-04 12:59:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 12:59:44,686 INFO L225 Difference]: With dead ends: 10029 [2021-11-04 12:59:44,686 INFO L226 Difference]: Without dead ends: 10025 [2021-11-04 12:59:44,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.22ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 12:59:44,698 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 6426 mSDsluCounter, 14956 mSDsCounter, 0 mSdLazyCounter, 23329 mSolverCounterSat, 27 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28002.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6426 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 23358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 50.11ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 23329 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31330.41ms IncrementalHoareTripleChecker+Time [2021-11-04 12:59:44,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6426 Valid, 247 Invalid, 23358 Unknown, 0 Unchecked, 50.11ms Time], IncrementalHoareTripleChecker [27 Valid, 23329 Invalid, 2 Unknown, 0 Unchecked, 31330.41ms Time] [2021-11-04 12:59:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10025 states. [2021-11-04 12:59:44,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10025 to 8347. [2021-11-04 12:59:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8347 states, 8283 states have (on average 1.2774357116986599) internal successors, (10581), 8283 states have internal predecessors, (10581), 44 states have call successors, (44), 14 states have call predecessors, (44), 14 states have return successors, (88), 49 states have call predecessors, (88), 44 states have call successors, (88) [2021-11-04 12:59:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8347 states to 8347 states and 10713 transitions. [2021-11-04 12:59:44,904 INFO L78 Accepts]: Start accepts. Automaton has 8347 states and 10713 transitions. Word has length 24 [2021-11-04 12:59:44,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 12:59:44,904 INFO L470 AbstractCegarLoop]: Abstraction has 8347 states and 10713 transitions. [2021-11-04 12:59:44,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 12:59:44,904 INFO L276 IsEmpty]: Start isEmpty. Operand 8347 states and 10713 transitions. [2021-11-04 12:59:44,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-04 12:59:44,905 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 12:59:44,906 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 12:59:44,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-04 12:59:44,906 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 12:59:44,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 12:59:44,907 INFO L85 PathProgramCache]: Analyzing trace with hash -487287063, now seen corresponding path program 1 times [2021-11-04 12:59:44,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 12:59:44,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028818504] [2021-11-04 12:59:44,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 12:59:44,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 12:59:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 12:59:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 12:59:45,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 12:59:45,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028818504] [2021-11-04 12:59:45,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028818504] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 12:59:45,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 12:59:45,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 12:59:45,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515545956] [2021-11-04 12:59:45,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 12:59:45,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 12:59:45,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 12:59:45,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 12:59:45,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 12:59:45,100 INFO L87 Difference]: Start difference. First operand 8347 states and 10713 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 12:59:47,140 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:00:12,338 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:00:15,271 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:00:21,045 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:00:23,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:00:23,065 INFO L93 Difference]: Finished difference Result 16635 states and 21470 transitions. [2021-11-04 13:00:23,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:00:23,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-04 13:00:23,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:00:23,168 INFO L225 Difference]: With dead ends: 16635 [2021-11-04 13:00:23,168 INFO L226 Difference]: Without dead ends: 16631 [2021-11-04 13:00:23,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.65ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:00:23,192 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 6426 mSDsluCounter, 15006 mSDsCounter, 0 mSdLazyCounter, 23434 mSolverCounterSat, 27 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33411.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6426 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 23464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 47.58ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 23434 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37250.77ms IncrementalHoareTripleChecker+Time [2021-11-04 13:00:23,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6426 Valid, 235 Invalid, 23464 Unknown, 0 Unchecked, 47.58ms Time], IncrementalHoareTripleChecker [27 Valid, 23434 Invalid, 3 Unknown, 0 Unchecked, 37250.77ms Time] [2021-11-04 13:00:23,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16631 states. [2021-11-04 13:00:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16631 to 14952. [2021-11-04 13:00:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14952 states, 14836 states have (on average 1.2779050957131302) internal successors, (18959), 14826 states have internal predecessors, (18959), 82 states have call successors, (82), 28 states have call predecessors, (82), 28 states have return successors, (290), 97 states have call predecessors, (290), 82 states have call successors, (290) [2021-11-04 13:00:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14952 states to 14952 states and 19331 transitions. [2021-11-04 13:00:23,679 INFO L78 Accepts]: Start accepts. Automaton has 14952 states and 19331 transitions. Word has length 26 [2021-11-04 13:00:23,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:00:23,680 INFO L470 AbstractCegarLoop]: Abstraction has 14952 states and 19331 transitions. [2021-11-04 13:00:23,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:00:23,681 INFO L276 IsEmpty]: Start isEmpty. Operand 14952 states and 19331 transitions. [2021-11-04 13:00:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-04 13:00:23,682 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:00:23,682 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:00:23,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-04 13:00:23,683 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 13:00:23,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:00:23,683 INFO L85 PathProgramCache]: Analyzing trace with hash -130970356, now seen corresponding path program 1 times [2021-11-04 13:00:23,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:00:23,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307369125] [2021-11-04 13:00:23,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:00:23,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:00:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:00:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:00:23,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:00:23,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307369125] [2021-11-04 13:00:23,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307369125] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:00:23,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:00:23,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 13:00:23,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009472427] [2021-11-04 13:00:23,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:00:23,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:00:23,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:00:23,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:00:23,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:00:23,978 INFO L87 Difference]: Start difference. First operand 14952 states and 19331 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:00:25,512 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:00:26,839 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:00:30,207 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:00:54,475 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:00:56,924 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:00:59,525 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:01:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:01:00,955 INFO L93 Difference]: Finished difference Result 29873 states and 39083 transitions. [2021-11-04 13:01:00,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 13:01:00,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-04 13:01:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:01:01,144 INFO L225 Difference]: With dead ends: 29873 [2021-11-04 13:01:01,145 INFO L226 Difference]: Without dead ends: 29836 [2021-11-04 13:01:01,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.08ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:01:01,193 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 6427 mSDsluCounter, 12941 mSDsCounter, 0 mSdLazyCounter, 19225 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31740.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6427 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 19256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 46.41ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 19225 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35989.02ms IncrementalHoareTripleChecker+Time [2021-11-04 13:01:01,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6427 Valid, 275 Invalid, 19256 Unknown, 0 Unchecked, 46.41ms Time], IncrementalHoareTripleChecker [30 Valid, 19225 Invalid, 1 Unknown, 0 Unchecked, 35989.02ms Time] [2021-11-04 13:01:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29836 states. [2021-11-04 13:01:01,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29836 to 29816. [2021-11-04 13:01:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29816 states, 29590 states have (on average 1.2782358905035485) internal successors, (37823), 29565 states have internal predecessors, (37823), 164 states have call successors, (164), 56 states have call predecessors, (164), 56 states have return successors, (1034), 194 states have call predecessors, (1034), 164 states have call successors, (1034) [2021-11-04 13:01:02,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29816 states to 29816 states and 39021 transitions. [2021-11-04 13:01:02,057 INFO L78 Accepts]: Start accepts. Automaton has 29816 states and 39021 transitions. Word has length 28 [2021-11-04 13:01:02,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:01:02,057 INFO L470 AbstractCegarLoop]: Abstraction has 29816 states and 39021 transitions. [2021-11-04 13:01:02,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 13:01:02,057 INFO L276 IsEmpty]: Start isEmpty. Operand 29816 states and 39021 transitions. [2021-11-04 13:01:02,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-04 13:01:02,087 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:01:02,087 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:01:02,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-04 13:01:02,087 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 13:01:02,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:01:02,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1411005469, now seen corresponding path program 1 times [2021-11-04 13:01:02,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:01:02,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292735805] [2021-11-04 13:01:02,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:01:02,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:01:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:01:02,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-04 13:01:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:01:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:01:02,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:01:02,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292735805] [2021-11-04 13:01:02,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292735805] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:01:02,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:01:02,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-04 13:01:02,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506761352] [2021-11-04 13:01:02,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:01:02,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 13:01:02,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:01:02,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 13:01:02,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-04 13:01:02,509 INFO L87 Difference]: Start difference. First operand 29816 states and 39021 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-04 13:01:04,547 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:01:10,362 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:01:12,478 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:01:48,077 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:01:51,331 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:01:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:01:54,878 INFO L93 Difference]: Finished difference Result 65938 states and 87429 transitions. [2021-11-04 13:01:54,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 13:01:54,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2021-11-04 13:01:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:01:55,115 INFO L225 Difference]: With dead ends: 65938 [2021-11-04 13:01:55,116 INFO L226 Difference]: Without dead ends: 36144 [2021-11-04 13:01:55,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.89ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-04 13:01:55,493 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 1585 mSDsluCounter, 23215 mSDsCounter, 0 mSdLazyCounter, 32162 mSolverCounterSat, 41 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44837.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 32207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 107.67ms SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 32162 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50561.20ms IncrementalHoareTripleChecker+Time [2021-11-04 13:01:55,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1587 Valid, 281 Invalid, 32207 Unknown, 0 Unchecked, 107.67ms Time], IncrementalHoareTripleChecker [41 Valid, 32162 Invalid, 4 Unknown, 0 Unchecked, 50561.20ms Time] [2021-11-04 13:01:55,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36144 states. [2021-11-04 13:01:56,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36144 to 31586. [2021-11-04 13:01:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31586 states, 31328 states have (on average 1.27863253319714) internal successors, (40057), 31327 states have internal predecessors, (40057), 164 states have call successors, (164), 56 states have call predecessors, (164), 88 states have return successors, (1166), 202 states have call predecessors, (1166), 164 states have call successors, (1166) [2021-11-04 13:01:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31586 states to 31586 states and 41387 transitions. [2021-11-04 13:01:56,788 INFO L78 Accepts]: Start accepts. Automaton has 31586 states and 41387 transitions. Word has length 121 [2021-11-04 13:01:56,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:01:56,790 INFO L470 AbstractCegarLoop]: Abstraction has 31586 states and 41387 transitions. [2021-11-04 13:01:56,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-04 13:01:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 31586 states and 41387 transitions. [2021-11-04 13:01:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-04 13:01:56,821 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:01:56,821 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:01:56,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-04 13:01:56,822 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 13:01:56,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:01:56,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1884583074, now seen corresponding path program 1 times [2021-11-04 13:01:56,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:01:56,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481210890] [2021-11-04 13:01:56,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:01:56,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:01:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:01:57,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-04 13:01:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:01:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:01:57,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:01:57,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481210890] [2021-11-04 13:01:57,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481210890] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:01:57,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:01:57,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-04 13:01:57,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050126509] [2021-11-04 13:01:57,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:01:57,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 13:01:57,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:01:57,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 13:01:57,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-04 13:01:57,227 INFO L87 Difference]: Start difference. First operand 31586 states and 41387 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-04 13:01:59,264 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:02:04,446 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:02:38,587 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:02:40,496 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:02:41,777 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:02:43,130 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:02:47,541 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:02:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:02:49,268 INFO L93 Difference]: Finished difference Result 64399 states and 85370 transitions. [2021-11-04 13:02:49,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 13:02:49,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2021-11-04 13:02:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:02:49,512 INFO L225 Difference]: With dead ends: 64399 [2021-11-04 13:02:49,512 INFO L226 Difference]: Without dead ends: 32835 [2021-11-04 13:02:49,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.69ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-04 13:02:49,958 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 569 mSDsluCounter, 23311 mSDsCounter, 0 mSdLazyCounter, 32174 mSolverCounterSat, 25 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44341.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 32202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 106.54ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 32174 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50297.97ms IncrementalHoareTripleChecker+Time [2021-11-04 13:02:49,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [569 Valid, 287 Invalid, 32202 Unknown, 0 Unchecked, 106.54ms Time], IncrementalHoareTripleChecker [25 Valid, 32174 Invalid, 3 Unknown, 0 Unchecked, 50297.97ms Time] [2021-11-04 13:02:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32835 states. [2021-11-04 13:02:50,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32835 to 31610. [2021-11-04 13:02:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31610 states, 31352 states have (on average 1.2784192396019394) internal successors, (40081), 31351 states have internal predecessors, (40081), 164 states have call successors, (164), 56 states have call predecessors, (164), 88 states have return successors, (1166), 202 states have call predecessors, (1166), 164 states have call successors, (1166) [2021-11-04 13:02:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31610 states to 31610 states and 41411 transitions. [2021-11-04 13:02:50,828 INFO L78 Accepts]: Start accepts. Automaton has 31610 states and 41411 transitions. Word has length 126 [2021-11-04 13:02:50,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:02:50,829 INFO L470 AbstractCegarLoop]: Abstraction has 31610 states and 41411 transitions. [2021-11-04 13:02:50,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-04 13:02:50,829 INFO L276 IsEmpty]: Start isEmpty. Operand 31610 states and 41411 transitions. [2021-11-04 13:02:50,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-11-04 13:02:50,864 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:02:50,864 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:02:50,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-04 13:02:50,864 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 13:02:50,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:02:50,865 INFO L85 PathProgramCache]: Analyzing trace with hash -134099574, now seen corresponding path program 1 times [2021-11-04 13:02:50,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:02:50,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858555148] [2021-11-04 13:02:50,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:02:50,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:02:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:02:51,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-04 13:02:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:02:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:02:51,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:02:51,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858555148] [2021-11-04 13:02:51,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858555148] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:02:51,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:02:51,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-04 13:02:51,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097129502] [2021-11-04 13:02:51,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:02:51,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-04 13:02:51,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:02:51,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-04 13:02:51,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-04 13:02:51,307 INFO L87 Difference]: Start difference. First operand 31610 states and 41411 transitions. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 7 states have internal predecessors, (130), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-04 13:02:55,268 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:02:56,722 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:02:58,183 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:03:00,385 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:04:05,407 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:04:10,678 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:04:12,745 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:04:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:04:14,239 INFO L93 Difference]: Finished difference Result 82344 states and 109087 transitions. [2021-11-04 13:04:14,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-04 13:04:14,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 7 states have internal predecessors, (130), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2021-11-04 13:04:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:04:14,571 INFO L225 Difference]: With dead ends: 82344 [2021-11-04 13:04:14,571 INFO L226 Difference]: Without dead ends: 50756 [2021-11-04 13:04:15,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 187.14ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-11-04 13:04:15,129 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 6488 mSDsluCounter, 43856 mSDsCounter, 0 mSdLazyCounter, 55935 mSolverCounterSat, 61 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70001.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6492 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 55999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 172.10ms SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 55935 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 80303.46ms IncrementalHoareTripleChecker+Time [2021-11-04 13:04:15,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6492 Valid, 448 Invalid, 55999 Unknown, 0 Unchecked, 172.10ms Time], IncrementalHoareTripleChecker [61 Valid, 55935 Invalid, 3 Unknown, 0 Unchecked, 80303.46ms Time] [2021-11-04 13:04:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50756 states. [2021-11-04 13:04:16,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50756 to 31650. [2021-11-04 13:04:16,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31650 states, 31392 states have (on average 1.2780644750254841) internal successors, (40121), 31391 states have internal predecessors, (40121), 164 states have call successors, (164), 56 states have call predecessors, (164), 88 states have return successors, (1166), 202 states have call predecessors, (1166), 164 states have call successors, (1166) [2021-11-04 13:04:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31650 states to 31650 states and 41451 transitions. [2021-11-04 13:04:16,403 INFO L78 Accepts]: Start accepts. Automaton has 31650 states and 41451 transitions. Word has length 132 [2021-11-04 13:04:16,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:04:16,403 INFO L470 AbstractCegarLoop]: Abstraction has 31650 states and 41451 transitions. [2021-11-04 13:04:16,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 7 states have internal predecessors, (130), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-04 13:04:16,404 INFO L276 IsEmpty]: Start isEmpty. Operand 31650 states and 41451 transitions. [2021-11-04 13:04:16,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-04 13:04:16,433 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:04:16,436 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:04:16,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-04 13:04:16,436 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 13:04:16,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:04:16,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1733952768, now seen corresponding path program 1 times [2021-11-04 13:04:16,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:04:16,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284277475] [2021-11-04 13:04:16,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:04:16,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:04:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:04:16,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-04 13:04:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:04:16,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-04 13:04:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:04:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:04:16,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:04:16,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284277475] [2021-11-04 13:04:16,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284277475] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:04:16,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:04:16,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 13:04:16,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97102949] [2021-11-04 13:04:16,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:04:16,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 13:04:16,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:04:16,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 13:04:16,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 13:04:16,692 INFO L87 Difference]: Start difference. First operand 31650 states and 41451 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-04 13:04:18,730 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:04:47,088 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:04:52,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:04:52,235 INFO L93 Difference]: Finished difference Result 64497 states and 85570 transitions. [2021-11-04 13:04:52,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 13:04:52,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 134 [2021-11-04 13:04:52,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:04:52,526 INFO L225 Difference]: With dead ends: 64497 [2021-11-04 13:04:52,526 INFO L226 Difference]: Without dead ends: 32869 [2021-11-04 13:04:52,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.50ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 13:04:52,790 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 557 mSDsluCounter, 10629 mSDsCounter, 0 mSdLazyCounter, 19245 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29084.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 19275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 61.65ms SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 19245 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33970.99ms IncrementalHoareTripleChecker+Time [2021-11-04 13:04:52,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [557 Valid, 148 Invalid, 19275 Unknown, 0 Unchecked, 61.65ms Time], IncrementalHoareTripleChecker [29 Valid, 19245 Invalid, 1 Unknown, 0 Unchecked, 33970.99ms Time] [2021-11-04 13:04:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32869 states. [2021-11-04 13:04:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32869 to 31668. [2021-11-04 13:04:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31668 states, 31410 states have (on average 1.2779051257561287) internal successors, (40139), 31409 states have internal predecessors, (40139), 164 states have call successors, (164), 56 states have call predecessors, (164), 88 states have return successors, (1166), 202 states have call predecessors, (1166), 164 states have call successors, (1166) [2021-11-04 13:04:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31668 states to 31668 states and 41469 transitions. [2021-11-04 13:04:53,695 INFO L78 Accepts]: Start accepts. Automaton has 31668 states and 41469 transitions. Word has length 134 [2021-11-04 13:04:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:04:53,695 INFO L470 AbstractCegarLoop]: Abstraction has 31668 states and 41469 transitions. [2021-11-04 13:04:53,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-04 13:04:53,695 INFO L276 IsEmpty]: Start isEmpty. Operand 31668 states and 41469 transitions. [2021-11-04 13:04:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-04 13:04:53,720 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:04:53,720 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:04:53,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-04 13:04:53,720 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 13:04:53,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:04:53,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1344860802, now seen corresponding path program 1 times [2021-11-04 13:04:53,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:04:53,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012132671] [2021-11-04 13:04:53,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:04:53,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:04:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:04:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-04 13:04:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:04:54,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-04 13:04:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:04:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 13:04:54,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:04:54,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012132671] [2021-11-04 13:04:54,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012132671] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:04:54,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:04:54,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-04 13:04:54,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049374163] [2021-11-04 13:04:54,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:04:54,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-04 13:04:54,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:04:54,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-04 13:04:54,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-04 13:04:54,697 INFO L87 Difference]: Start difference. First operand 31668 states and 41469 transitions. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-04 13:04:56,743 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:05:02,820 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:05:52,257 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:05:56,353 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:05:59,836 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:06:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:06:01,939 INFO L93 Difference]: Finished difference Result 64522 states and 84443 transitions. [2021-11-04 13:06:01,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-04 13:06:01,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 134 [2021-11-04 13:06:01,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:06:02,185 INFO L225 Difference]: With dead ends: 64522 [2021-11-04 13:06:02,186 INFO L226 Difference]: Without dead ends: 32869 [2021-11-04 13:06:02,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 187.27ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-11-04 13:06:02,413 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 7068 mSDsluCounter, 18310 mSDsCounter, 0 mSdLazyCounter, 27276 mSolverCounterSat, 104 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55628.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7068 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 27385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 140.28ms SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 27276 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65239.94ms IncrementalHoareTripleChecker+Time [2021-11-04 13:06:02,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7068 Valid, 182 Invalid, 27385 Unknown, 0 Unchecked, 140.28ms Time], IncrementalHoareTripleChecker [104 Valid, 27276 Invalid, 5 Unknown, 0 Unchecked, 65239.94ms Time] [2021-11-04 13:06:02,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32869 states. [2021-11-04 13:06:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32869 to 31668. [2021-11-04 13:06:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31668 states, 31410 states have (on average 1.277873288761541) internal successors, (40138), 31409 states have internal predecessors, (40138), 164 states have call successors, (164), 56 states have call predecessors, (164), 88 states have return successors, (1166), 202 states have call predecessors, (1166), 164 states have call successors, (1166) [2021-11-04 13:06:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31668 states to 31668 states and 41468 transitions. [2021-11-04 13:06:03,707 INFO L78 Accepts]: Start accepts. Automaton has 31668 states and 41468 transitions. Word has length 134 [2021-11-04 13:06:03,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:06:03,707 INFO L470 AbstractCegarLoop]: Abstraction has 31668 states and 41468 transitions. [2021-11-04 13:06:03,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-04 13:06:03,707 INFO L276 IsEmpty]: Start isEmpty. Operand 31668 states and 41468 transitions. [2021-11-04 13:06:03,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-04 13:06:03,735 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:06:03,736 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:06:03,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-04 13:06:03,736 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 13:06:03,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:06:03,737 INFO L85 PathProgramCache]: Analyzing trace with hash 836329957, now seen corresponding path program 1 times [2021-11-04 13:06:03,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:06:03,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664086149] [2021-11-04 13:06:03,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:06:03,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:06:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:06:04,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-04 13:06:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:06:04,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-04 13:06:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:06:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-04 13:06:04,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:06:04,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664086149] [2021-11-04 13:06:04,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664086149] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:06:04,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:06:04,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-04 13:06:04,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61793580] [2021-11-04 13:06:04,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:06:04,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-04 13:06:04,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:06:04,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-04 13:06:04,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-04 13:06:04,565 INFO L87 Difference]: Start difference. First operand 31668 states and 41468 transitions. Second operand has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 10 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-04 13:06:06,599 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:07:12,404 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:07:13,694 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:07:14,951 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:07:16,979 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:07:18,402 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:07:19,629 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:07:20,733 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:07:21,978 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:07:23,201 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:07:25,230 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:07:26,656 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:07:30,304 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:07:33,343 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:07:50,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:07:50,937 INFO L93 Difference]: Finished difference Result 64909 states and 84971 transitions. [2021-11-04 13:07:50,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-04 13:07:50,940 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 10 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 134 [2021-11-04 13:07:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:07:51,194 INFO L225 Difference]: With dead ends: 64909 [2021-11-04 13:07:51,195 INFO L226 Difference]: Without dead ends: 33255 [2021-11-04 13:07:51,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 318.53ms TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-11-04 13:07:51,535 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 886 mSDsluCounter, 61476 mSDsCounter, 0 mSdLazyCounter, 71262 mSolverCounterSat, 46 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 91613.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 71312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 204.09ms SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 71262 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 104003.13ms IncrementalHoareTripleChecker+Time [2021-11-04 13:07:51,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [886 Valid, 685 Invalid, 71312 Unknown, 0 Unchecked, 204.09ms Time], IncrementalHoareTripleChecker [46 Valid, 71262 Invalid, 4 Unknown, 0 Unchecked, 104003.13ms Time] [2021-11-04 13:07:51,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33255 states. [2021-11-04 13:07:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33255 to 31759. [2021-11-04 13:07:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31759 states, 31499 states have (on average 1.2771516556081146) internal successors, (40229), 31492 states have internal predecessors, (40229), 164 states have call successors, (164), 56 states have call predecessors, (164), 90 states have return successors, (1198), 210 states have call predecessors, (1198), 164 states have call successors, (1198) [2021-11-04 13:07:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31759 states to 31759 states and 41591 transitions. [2021-11-04 13:07:52,680 INFO L78 Accepts]: Start accepts. Automaton has 31759 states and 41591 transitions. Word has length 134 [2021-11-04 13:07:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:07:52,681 INFO L470 AbstractCegarLoop]: Abstraction has 31759 states and 41591 transitions. [2021-11-04 13:07:52,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 10 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-04 13:07:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 31759 states and 41591 transitions. [2021-11-04 13:07:52,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-04 13:07:52,684 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:07:52,684 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:07:52,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-04 13:07:52,684 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 13:07:52,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:07:52,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1626006182, now seen corresponding path program 1 times [2021-11-04 13:07:52,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:07:52,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224209469] [2021-11-04 13:07:52,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:07:52,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:07:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:07:52,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-04 13:07:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:07:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:07:53,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:07:53,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224209469] [2021-11-04 13:07:53,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224209469] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:07:53,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:07:53,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-04 13:07:53,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364410698] [2021-11-04 13:07:53,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:07:53,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-04 13:07:53,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:07:53,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-04 13:07:53,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-11-04 13:07:53,561 INFO L87 Difference]: Start difference. First operand 31759 states and 41591 transitions. Second operand has 14 states, 14 states have (on average 9.642857142857142) internal successors, (135), 13 states have internal predecessors, (135), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-04 13:07:55,894 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:08:16,044 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:10:08,449 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:10:16,372 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:10:17,789 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:10:20,610 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:10:21,722 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:10:23,781 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:10:25,002 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:10:29,108 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 13:11:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 13:11:21,959 INFO L93 Difference]: Finished difference Result 75355 states and 99967 transitions. [2021-11-04 13:11:21,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-04 13:11:21,960 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.642857142857142) internal successors, (135), 13 states have internal predecessors, (135), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2021-11-04 13:11:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 13:11:22,290 INFO L225 Difference]: With dead ends: 75355 [2021-11-04 13:11:22,291 INFO L226 Difference]: Without dead ends: 43618 [2021-11-04 13:11:22,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 2069.29ms TimeCoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2021-11-04 13:11:22,759 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 12726 mSDsluCounter, 77507 mSDsCounter, 0 mSdLazyCounter, 89744 mSolverCounterSat, 161 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 166586.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 12726 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 89910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 441.42ms SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 89744 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 202444.22ms IncrementalHoareTripleChecker+Time [2021-11-04 13:11:22,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12726 Valid, 723 Invalid, 89910 Unknown, 0 Unchecked, 441.42ms Time], IncrementalHoareTripleChecker [161 Valid, 89744 Invalid, 5 Unknown, 0 Unchecked, 202444.22ms Time] [2021-11-04 13:11:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43618 states. [2021-11-04 13:11:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43618 to 31847. [2021-11-04 13:11:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31847 states, 31587 states have (on average 1.2766327919713807) internal successors, (40325), 31580 states have internal predecessors, (40325), 164 states have call successors, (164), 56 states have call predecessors, (164), 90 states have return successors, (1198), 210 states have call predecessors, (1198), 164 states have call successors, (1198) [2021-11-04 13:11:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31847 states to 31847 states and 41687 transitions. [2021-11-04 13:11:24,124 INFO L78 Accepts]: Start accepts. Automaton has 31847 states and 41687 transitions. Word has length 137 [2021-11-04 13:11:24,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 13:11:24,124 INFO L470 AbstractCegarLoop]: Abstraction has 31847 states and 41687 transitions. [2021-11-04 13:11:24,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.642857142857142) internal successors, (135), 13 states have internal predecessors, (135), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-04 13:11:24,125 INFO L276 IsEmpty]: Start isEmpty. Operand 31847 states and 41687 transitions. [2021-11-04 13:11:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-04 13:11:24,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 13:11:24,127 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 13:11:24,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-04 13:11:24,127 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-04 13:11:24,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 13:11:24,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1735898566, now seen corresponding path program 1 times [2021-11-04 13:11:24,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 13:11:24,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188456740] [2021-11-04 13:11:24,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 13:11:24,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 13:11:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:11:24,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-04 13:11:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 13:11:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 13:11:25,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 13:11:25,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188456740] [2021-11-04 13:11:25,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188456740] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 13:11:25,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 13:11:25,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-04 13:11:25,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787781147] [2021-11-04 13:11:25,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 13:11:25,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-04 13:11:25,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 13:11:25,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-04 13:11:25,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-04 13:11:25,174 INFO L87 Difference]: Start difference. First operand 31847 states and 41687 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-04 13:11:27,282 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15