./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1b605371288ab675786f884c3e899aa7b22c9968bb31ac2f2bc3b55776b1682d --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-04 04:20:47,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 04:20:47,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 04:20:47,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 04:20:47,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 04:20:47,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 04:20:47,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 04:20:47,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 04:20:47,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 04:20:47,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 04:20:47,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 04:20:47,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 04:20:47,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 04:20:47,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 04:20:47,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 04:20:47,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 04:20:47,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 04:20:47,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 04:20:47,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 04:20:47,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 04:20:47,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 04:20:47,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 04:20:47,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 04:20:47,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 04:20:47,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 04:20:47,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 04:20:47,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 04:20:47,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 04:20:47,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 04:20:47,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 04:20:47,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 04:20:47,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 04:20:47,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 04:20:47,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 04:20:47,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 04:20:47,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 04:20:47,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 04:20:47,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 04:20:47,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 04:20:47,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 04:20:47,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 04:20:47,686 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-04 04:20:47,709 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 04:20:47,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 04:20:47,710 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 04:20:47,710 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 04:20:47,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 04:20:47,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 04:20:47,711 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 04:20:47,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 04:20:47,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-04 04:20:47,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 04:20:47,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 04:20:47,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 04:20:47,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 04:20:47,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 04:20:47,713 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 04:20:47,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 04:20:47,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 04:20:47,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 04:20:47,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 04:20:47,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 04:20:47,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 04:20:47,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 04:20:47,714 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 04:20:47,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-04 04:20:47,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-04 04:20:47,715 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 04:20:47,715 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 04:20:47,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 04:20:47,715 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 04:20:47,716 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 -> 1b605371288ab675786f884c3e899aa7b22c9968bb31ac2f2bc3b55776b1682d [2021-11-04 04:20:47,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 04:20:47,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 04:20:47,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 04:20:47,967 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 04:20:47,968 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 04:20:47,969 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2021-11-04 04:20:48,020 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1508fabb6/bba07c7127844787997f0a1ceca20bab/FLAG465404a52 [2021-11-04 04:20:48,575 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 04:20:48,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2021-11-04 04:20:48,612 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1508fabb6/bba07c7127844787997f0a1ceca20bab/FLAG465404a52 [2021-11-04 04:20:48,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1508fabb6/bba07c7127844787997f0a1ceca20bab [2021-11-04 04:20:48,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 04:20:48,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 04:20:48,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 04:20:48,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 04:20:48,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 04:20:48,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 04:20:48" (1/1) ... [2021-11-04 04:20:48,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5b3e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:20:48, skipping insertion in model container [2021-11-04 04:20:48,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 04:20:48" (1/1) ... [2021-11-04 04:20:48,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 04:20:48,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 04:20:49,597 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i[180577,180590] [2021-11-04 04:20:49,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 04:20:50,028 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 04:20:50,176 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i[180577,180590] [2021-11-04 04:20:50,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 04:20:50,387 INFO L208 MainTranslator]: Completed translation [2021-11-04 04:20:50,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:20:50 WrapperNode [2021-11-04 04:20:50,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 04:20:50,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 04:20:50,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 04:20:50,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 04:20:50,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:20:50" (1/1) ... [2021-11-04 04:20:50,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:20:50" (1/1) ... [2021-11-04 04:20:50,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 04:20:50,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 04:20:50,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 04:20:50,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 04:20:50,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:20:50" (1/1) ... [2021-11-04 04:20:50,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:20:50" (1/1) ... [2021-11-04 04:20:50,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:20:50" (1/1) ... [2021-11-04 04:20:50,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:20:50" (1/1) ... [2021-11-04 04:20:50,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:20:50" (1/1) ... [2021-11-04 04:20:50,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:20:50" (1/1) ... [2021-11-04 04:20:50,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:20:50" (1/1) ... [2021-11-04 04:20:50,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 04:20:50,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 04:20:50,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 04:20:50,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 04:20:50,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:20:50" (1/1) ... [2021-11-04 04:20:50,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 04:20:50,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 04:20:50,764 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 04:20:50,783 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 04:20:50,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-04 04:20:50,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-04 04:20:50,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-04 04:20:50,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 04:20:50,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 04:20:50,803 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-04 04:20:50,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 04:20:50,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 04:20:50,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 04:20:50,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-04 04:20:50,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 04:20:50,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 04:20:54,553 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 04:20:54,553 INFO L299 CfgBuilder]: Removed 453 assume(true) statements. [2021-11-04 04:20:54,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 04:20:54 BoogieIcfgContainer [2021-11-04 04:20:54,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 04:20:54,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 04:20:54,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 04:20:54,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 04:20:54,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 04:20:48" (1/3) ... [2021-11-04 04:20:54,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a62c304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 04:20:54, skipping insertion in model container [2021-11-04 04:20:54,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 04:20:50" (2/3) ... [2021-11-04 04:20:54,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a62c304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 04:20:54, skipping insertion in model container [2021-11-04 04:20:54,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 04:20:54" (3/3) ... [2021-11-04 04:20:54,563 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2021-11-04 04:20:54,567 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 04:20:54,568 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-04 04:20:54,613 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 04:20:54,618 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 04:20:54,618 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-04 04:20:54,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 732 states, 730 states have (on average 1.5232876712328767) internal successors, (1112), 731 states have internal predecessors, (1112), 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 04:20:54,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-04 04:20:54,647 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:20:54,647 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] [2021-11-04 04:20:54,648 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:20:54,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:20:54,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1244740702, now seen corresponding path program 1 times [2021-11-04 04:20:54,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:20:54,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423343322] [2021-11-04 04:20:54,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:20:54,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:20:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:20:55,098 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 04:20:55,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:20:55,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423343322] [2021-11-04 04:20:55,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423343322] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:20:55,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:20:55,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 04:20:55,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350784672] [2021-11-04 04:20:55,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:20:55,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 04:20:55,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:20:55,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 04:20:55,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:20:55,133 INFO L87 Difference]: Start difference. First operand has 732 states, 730 states have (on average 1.5232876712328767) internal successors, (1112), 731 states have internal predecessors, (1112), 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) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 04:20:57,210 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 04:21:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:21:03,392 INFO L93 Difference]: Finished difference Result 1460 states and 2219 transitions. [2021-11-04 04:21:03,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 04:21:03,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2021-11-04 04:21:03,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:21:03,412 INFO L225 Difference]: With dead ends: 1460 [2021-11-04 04:21:03,412 INFO L226 Difference]: Without dead ends: 725 [2021-11-04 04:21:03,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.53ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:21:03,418 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 2167 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7352.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 27.49ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8026.65ms IncrementalHoareTripleChecker+Time [2021-11-04 04:21:03,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 2168 Unknown, 0 Unchecked, 27.49ms Time], IncrementalHoareTripleChecker [0 Valid, 2167 Invalid, 1 Unknown, 0 Unchecked, 8026.65ms Time] [2021-11-04 04:21:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2021-11-04 04:21:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2021-11-04 04:21:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.488950276243094) internal successors, (1078), 724 states have internal predecessors, (1078), 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 04:21:03,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1078 transitions. [2021-11-04 04:21:03,483 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1078 transitions. Word has length 20 [2021-11-04 04:21:03,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:21:03,483 INFO L470 AbstractCegarLoop]: Abstraction has 725 states and 1078 transitions. [2021-11-04 04:21:03,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 04:21:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1078 transitions. [2021-11-04 04:21:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-04 04:21:03,485 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:21:03,485 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] [2021-11-04 04:21:03,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-04 04:21:03,485 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:21:03,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:21:03,486 INFO L85 PathProgramCache]: Analyzing trace with hash -609490989, now seen corresponding path program 1 times [2021-11-04 04:21:03,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:21:03,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009047463] [2021-11-04 04:21:03,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:21:03,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:21:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:21:03,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-04 04:21:03,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:21:03,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009047463] [2021-11-04 04:21:03,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009047463] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:21:03,749 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:21:03,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 04:21:03,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237190254] [2021-11-04 04:21:03,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:21:03,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 04:21:03,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:21:03,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 04:21:03,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:21:03,752 INFO L87 Difference]: Start difference. First operand 725 states and 1078 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 04:21:05,796 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 04:21:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:21:12,311 INFO L93 Difference]: Finished difference Result 2134 states and 3188 transitions. [2021-11-04 04:21:12,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 04:21:12,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2021-11-04 04:21:12,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:21:12,316 INFO L225 Difference]: With dead ends: 2134 [2021-11-04 04:21:12,317 INFO L226 Difference]: Without dead ends: 1421 [2021-11-04 04:21:12,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.60ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:21:12,320 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1048 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7616.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.62ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8321.74ms IncrementalHoareTripleChecker+Time [2021-11-04 04:21:12,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1048 Valid, 0 Invalid, 2146 Unknown, 0 Unchecked, 21.62ms Time], IncrementalHoareTripleChecker [3 Valid, 2142 Invalid, 1 Unknown, 0 Unchecked, 8321.74ms Time] [2021-11-04 04:21:12,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2021-11-04 04:21:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1421. [2021-11-04 04:21:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1420 states have (on average 1.4936619718309858) internal successors, (2121), 1420 states have internal predecessors, (2121), 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 04:21:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2121 transitions. [2021-11-04 04:21:12,359 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2121 transitions. Word has length 21 [2021-11-04 04:21:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:21:12,359 INFO L470 AbstractCegarLoop]: Abstraction has 1421 states and 2121 transitions. [2021-11-04 04:21:12,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 04:21:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2121 transitions. [2021-11-04 04:21:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-04 04:21:12,361 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:21:12,362 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 04:21:12,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-04 04:21:12,362 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:21:12,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:21:12,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1977023298, now seen corresponding path program 1 times [2021-11-04 04:21:12,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:21:12,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556867622] [2021-11-04 04:21:12,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:21:12,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:21:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:21:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-04 04:21:12,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:21:12,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556867622] [2021-11-04 04:21:12,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556867622] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:21:12,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:21:12,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 04:21:12,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885996541] [2021-11-04 04:21:12,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:21:12,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 04:21:12,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:21:12,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 04:21:12,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:21:12,598 INFO L87 Difference]: Start difference. First operand 1421 states and 2121 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) 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 04:21:14,640 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 04:21:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:21:23,350 INFO L93 Difference]: Finished difference Result 2135 states and 3180 transitions. [2021-11-04 04:21:23,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 04:21:23,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) 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 04:21:23,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:21:23,361 INFO L225 Difference]: With dead ends: 2135 [2021-11-04 04:21:23,361 INFO L226 Difference]: Without dead ends: 2130 [2021-11-04 04:21:23,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.46ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:21:23,363 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1060 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 3201 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9687.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 26.38ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3201 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10522.59ms IncrementalHoareTripleChecker+Time [2021-11-04 04:21:23,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1060 Valid, 0 Invalid, 3203 Unknown, 0 Unchecked, 26.38ms Time], IncrementalHoareTripleChecker [1 Valid, 3201 Invalid, 1 Unknown, 0 Unchecked, 10522.59ms Time] [2021-11-04 04:21:23,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2021-11-04 04:21:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1421. [2021-11-04 04:21:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1420 states have (on average 1.4929577464788732) internal successors, (2120), 1420 states have internal predecessors, (2120), 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 04:21:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2120 transitions. [2021-11-04 04:21:23,412 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2120 transitions. Word has length 28 [2021-11-04 04:21:23,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:21:23,412 INFO L470 AbstractCegarLoop]: Abstraction has 1421 states and 2120 transitions. [2021-11-04 04:21:23,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) 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 04:21:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2120 transitions. [2021-11-04 04:21:23,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-04 04:21:23,419 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:21:23,419 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 04:21:23,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-04 04:21:23,420 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:21:23,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:21:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1919764996, now seen corresponding path program 1 times [2021-11-04 04:21:23,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:21:23,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490757810] [2021-11-04 04:21:23,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:21:23,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:21:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:21:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-04 04:21:23,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:21:23,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490757810] [2021-11-04 04:21:23,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490757810] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:21:23,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:21:23,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 04:21:23,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331911047] [2021-11-04 04:21:23,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:21:23,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 04:21:23,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:21:23,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 04:21:23,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 04:21:23,657 INFO L87 Difference]: Start difference. First operand 1421 states and 2120 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 04:21:25,732 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 04:21:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:21:36,566 INFO L93 Difference]: Finished difference Result 4237 states and 6331 transitions. [2021-11-04 04:21:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 04:21:36,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 04:21:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:21:36,574 INFO L225 Difference]: With dead ends: 4237 [2021-11-04 04:21:36,575 INFO L226 Difference]: Without dead ends: 2823 [2021-11-04 04:21:36,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 84.84ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 04:21:36,578 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1042 mSDsluCounter, 3170 mSDsCounter, 0 mSdLazyCounter, 4304 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11648.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 40.49ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4304 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12574.56ms IncrementalHoareTripleChecker+Time [2021-11-04 04:21:36,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1042 Valid, 0 Invalid, 4307 Unknown, 0 Unchecked, 40.49ms Time], IncrementalHoareTripleChecker [2 Valid, 4304 Invalid, 1 Unknown, 0 Unchecked, 12574.56ms Time] [2021-11-04 04:21:36,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2021-11-04 04:21:36,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2807. [2021-11-04 04:21:36,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2807 states, 2806 states have (on average 1.4946543121881681) internal successors, (4194), 2806 states have internal predecessors, (4194), 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 04:21:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 4194 transitions. [2021-11-04 04:21:36,628 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 4194 transitions. Word has length 28 [2021-11-04 04:21:36,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:21:36,628 INFO L470 AbstractCegarLoop]: Abstraction has 2807 states and 4194 transitions. [2021-11-04 04:21:36,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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 04:21:36,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 4194 transitions. [2021-11-04 04:21:36,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-04 04:21:36,634 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:21:36,634 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] [2021-11-04 04:21:36,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-04 04:21:36,635 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:21:36,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:21:36,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1486974865, now seen corresponding path program 1 times [2021-11-04 04:21:36,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:21:36,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125131568] [2021-11-04 04:21:36,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:21:36,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:21:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:21:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-04 04:21:36,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:21:36,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125131568] [2021-11-04 04:21:36,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125131568] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:21:36,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:21:36,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 04:21:36,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229030587] [2021-11-04 04:21:36,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:21:36,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 04:21:36,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:21:36,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 04:21:36,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:21:36,811 INFO L87 Difference]: Start difference. First operand 2807 states and 4194 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 04:21:38,862 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 04:21:44,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:21:44,238 INFO L93 Difference]: Finished difference Result 5934 states and 8898 transitions. [2021-11-04 04:21:44,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 04:21:44,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2021-11-04 04:21:44,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:21:44,248 INFO L225 Difference]: With dead ends: 5934 [2021-11-04 04:21:44,249 INFO L226 Difference]: Without dead ends: 3139 [2021-11-04 04:21:44,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.12ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:21:44,253 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 2152 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6713.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.13ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2152 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7284.82ms IncrementalHoareTripleChecker+Time [2021-11-04 04:21:44,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 2155 Unknown, 0 Unchecked, 11.13ms Time], IncrementalHoareTripleChecker [2 Valid, 2152 Invalid, 1 Unknown, 0 Unchecked, 7284.82ms Time] [2021-11-04 04:21:44,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2021-11-04 04:21:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 3129. [2021-11-04 04:21:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3129 states, 3128 states have (on average 1.504156010230179) internal successors, (4705), 3128 states have internal predecessors, (4705), 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 04:21:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 4705 transitions. [2021-11-04 04:21:44,309 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 4705 transitions. Word has length 58 [2021-11-04 04:21:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:21:44,310 INFO L470 AbstractCegarLoop]: Abstraction has 3129 states and 4705 transitions. [2021-11-04 04:21:44,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 04:21:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 4705 transitions. [2021-11-04 04:21:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-04 04:21:44,314 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:21:44,314 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:21:44,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-04 04:21:44,314 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:21:44,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:21:44,315 INFO L85 PathProgramCache]: Analyzing trace with hash 583787059, now seen corresponding path program 1 times [2021-11-04 04:21:44,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:21:44,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467615764] [2021-11-04 04:21:44,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:21:44,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:21:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:21:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-04 04:21:44,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:21:44,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467615764] [2021-11-04 04:21:44,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467615764] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:21:44,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:21:44,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 04:21:44,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820924169] [2021-11-04 04:21:44,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:21:44,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 04:21:44,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:21:44,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 04:21:44,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:21:44,499 INFO L87 Difference]: Start difference. First operand 3129 states and 4705 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 04:21:46,533 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 04:21:51,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:21:51,476 INFO L93 Difference]: Finished difference Result 6630 states and 10016 transitions. [2021-11-04 04:21:51,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 04:21:51,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 66 [2021-11-04 04:21:51,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:21:51,486 INFO L225 Difference]: With dead ends: 6630 [2021-11-04 04:21:51,486 INFO L226 Difference]: Without dead ends: 3513 [2021-11-04 04:21:51,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.56ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:21:51,492 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 591 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6254.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.28ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6816.03ms IncrementalHoareTripleChecker+Time [2021-11-04 04:21:51,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [591 Valid, 0 Invalid, 1839 Unknown, 0 Unchecked, 8.28ms Time], IncrementalHoareTripleChecker [9 Valid, 1829 Invalid, 1 Unknown, 0 Unchecked, 6816.03ms Time] [2021-11-04 04:21:51,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2021-11-04 04:21:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3503. [2021-11-04 04:21:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3503 states, 3502 states have (on average 1.509994288977727) internal successors, (5288), 3502 states have internal predecessors, (5288), 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 04:21:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 5288 transitions. [2021-11-04 04:21:51,553 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 5288 transitions. Word has length 66 [2021-11-04 04:21:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:21:51,554 INFO L470 AbstractCegarLoop]: Abstraction has 3503 states and 5288 transitions. [2021-11-04 04:21:51,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 04:21:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 5288 transitions. [2021-11-04 04:21:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-04 04:21:51,559 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:21:51,560 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:21:51,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-04 04:21:51,560 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:21:51,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:21:51,561 INFO L85 PathProgramCache]: Analyzing trace with hash -704359164, now seen corresponding path program 1 times [2021-11-04 04:21:51,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:21:51,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287556615] [2021-11-04 04:21:51,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:21:51,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:21:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:21:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-04 04:21:51,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:21:51,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287556615] [2021-11-04 04:21:51,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287556615] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:21:51,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:21:51,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 04:21:51,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63979590] [2021-11-04 04:21:51,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:21:51,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 04:21:51,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:21:51,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 04:21:51,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:21:51,753 INFO L87 Difference]: Start difference. First operand 3503 states and 5288 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 04:21:53,801 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 04:21:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:21:59,366 INFO L93 Difference]: Finished difference Result 7373 states and 11178 transitions. [2021-11-04 04:21:59,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 04:21:59,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 83 [2021-11-04 04:21:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:21:59,377 INFO L225 Difference]: With dead ends: 7373 [2021-11-04 04:21:59,377 INFO L226 Difference]: Without dead ends: 3882 [2021-11-04 04:21:59,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.84ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:21:59,383 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 279 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6836.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.65ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7431.03ms IncrementalHoareTripleChecker+Time [2021-11-04 04:21:59,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 0 Invalid, 2170 Unknown, 0 Unchecked, 9.65ms Time], IncrementalHoareTripleChecker [9 Valid, 2160 Invalid, 1 Unknown, 0 Unchecked, 7431.03ms Time] [2021-11-04 04:21:59,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3882 states. [2021-11-04 04:21:59,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3882 to 3877. [2021-11-04 04:21:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3877 states, 3876 states have (on average 1.5157378740970073) internal successors, (5875), 3876 states have internal predecessors, (5875), 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 04:21:59,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 5875 transitions. [2021-11-04 04:21:59,452 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 5875 transitions. Word has length 83 [2021-11-04 04:21:59,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:21:59,453 INFO L470 AbstractCegarLoop]: Abstraction has 3877 states and 5875 transitions. [2021-11-04 04:21:59,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 04:21:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 5875 transitions. [2021-11-04 04:21:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-04 04:21:59,458 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:21:59,458 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:21:59,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-04 04:21:59,458 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:21:59,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:21:59,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2013961093, now seen corresponding path program 1 times [2021-11-04 04:21:59,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:21:59,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413804117] [2021-11-04 04:21:59,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:21:59,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:21:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:21:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-04 04:21:59,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:21:59,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413804117] [2021-11-04 04:21:59,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413804117] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:21:59,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:21:59,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 04:21:59,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544758644] [2021-11-04 04:21:59,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:21:59,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 04:21:59,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:21:59,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 04:21:59,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 04:21:59,694 INFO L87 Difference]: Start difference. First operand 3877 states and 5875 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 04:22:01,735 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 04:22:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:22:15,478 INFO L93 Difference]: Finished difference Result 18671 states and 28378 transitions. [2021-11-04 04:22:15,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 04:22:15,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 102 [2021-11-04 04:22:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:22:15,517 INFO L225 Difference]: With dead ends: 18671 [2021-11-04 04:22:15,518 INFO L226 Difference]: Without dead ends: 14806 [2021-11-04 04:22:15,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 80.84ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 04:22:15,525 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3092 mSDsluCounter, 3011 mSDsCounter, 0 mSdLazyCounter, 5002 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14040.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3092 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 56.20ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5002 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15238.63ms IncrementalHoareTripleChecker+Time [2021-11-04 04:22:15,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3092 Valid, 0 Invalid, 5010 Unknown, 0 Unchecked, 56.20ms Time], IncrementalHoareTripleChecker [7 Valid, 5002 Invalid, 1 Unknown, 0 Unchecked, 15238.63ms Time] [2021-11-04 04:22:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14806 states. [2021-11-04 04:22:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14806 to 3893. [2021-11-04 04:22:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3893 states, 3892 states have (on average 1.513617677286742) internal successors, (5891), 3892 states have internal predecessors, (5891), 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 04:22:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 5891 transitions. [2021-11-04 04:22:15,662 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 5891 transitions. Word has length 102 [2021-11-04 04:22:15,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:22:15,664 INFO L470 AbstractCegarLoop]: Abstraction has 3893 states and 5891 transitions. [2021-11-04 04:22:15,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 04:22:15,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 5891 transitions. [2021-11-04 04:22:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-04 04:22:15,673 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:22:15,673 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:22:15,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-04 04:22:15,674 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:22:15,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:22:15,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1937361133, now seen corresponding path program 1 times [2021-11-04 04:22:15,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:22:15,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467666056] [2021-11-04 04:22:15,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:22:15,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:22:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:22:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-04 04:22:15,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:22:15,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467666056] [2021-11-04 04:22:15,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467666056] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:22:15,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:22:15,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 04:22:15,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188714064] [2021-11-04 04:22:15,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:22:15,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 04:22:15,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:22:15,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 04:22:15,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 04:22:15,849 INFO L87 Difference]: Start difference. First operand 3893 states and 5891 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 04:22:17,889 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 04:22:32,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:22:32,282 INFO L93 Difference]: Finished difference Result 13284 states and 20134 transitions. [2021-11-04 04:22:32,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 04:22:32,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 105 [2021-11-04 04:22:32,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:22:32,299 INFO L225 Difference]: With dead ends: 13284 [2021-11-04 04:22:32,299 INFO L226 Difference]: Without dead ends: 9403 [2021-11-04 04:22:32,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.35ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 04:22:32,303 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2217 mSDsluCounter, 3178 mSDsCounter, 0 mSdLazyCounter, 5850 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14878.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2217 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 47.09ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5850 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15999.72ms IncrementalHoareTripleChecker+Time [2021-11-04 04:22:32,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2217 Valid, 0 Invalid, 5852 Unknown, 0 Unchecked, 47.09ms Time], IncrementalHoareTripleChecker [1 Valid, 5850 Invalid, 1 Unknown, 0 Unchecked, 15999.72ms Time] [2021-11-04 04:22:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9403 states. [2021-11-04 04:22:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9403 to 3893. [2021-11-04 04:22:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3893 states, 3892 states have (on average 1.5125899280575539) internal successors, (5887), 3892 states have internal predecessors, (5887), 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 04:22:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 5887 transitions. [2021-11-04 04:22:32,405 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 5887 transitions. Word has length 105 [2021-11-04 04:22:32,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:22:32,406 INFO L470 AbstractCegarLoop]: Abstraction has 3893 states and 5887 transitions. [2021-11-04 04:22:32,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 04:22:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 5887 transitions. [2021-11-04 04:22:32,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-04 04:22:32,410 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:22:32,410 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:22:32,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-04 04:22:32,411 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:22:32,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:22:32,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1350555119, now seen corresponding path program 1 times [2021-11-04 04:22:32,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:22:32,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986322307] [2021-11-04 04:22:32,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:22:32,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:22:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:22:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-04 04:22:32,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:22:32,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986322307] [2021-11-04 04:22:32,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986322307] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 04:22:32,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869065256] [2021-11-04 04:22:32,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:22:32,594 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 04:22:32,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 04:22:32,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-04 04:22:32,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-04 04:22:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:22:33,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 2916 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-04 04:22:33,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 04:22:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-11-04 04:22:33,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 04:22:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-11-04 04:22:34,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869065256] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-04 04:22:34,186 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-04 04:22:34,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-11-04 04:22:34,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058045056] [2021-11-04 04:22:34,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-04 04:22:34,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-04 04:22:34,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:22:34,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-04 04:22:34,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-04 04:22:34,188 INFO L87 Difference]: Start difference. First operand 3893 states and 5887 transitions. Second operand has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 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 04:22:36,223 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 04:22:54,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:22:54,672 INFO L93 Difference]: Finished difference Result 12535 states and 18957 transitions. [2021-11-04 04:22:54,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-04 04:22:54,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 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 105 [2021-11-04 04:22:54,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:22:54,689 INFO L225 Difference]: With dead ends: 12535 [2021-11-04 04:22:54,690 INFO L226 Difference]: Without dead ends: 8652 [2021-11-04 04:22:54,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 122.40ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-04 04:22:54,698 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1586 mSDsluCounter, 5478 mSDsCounter, 0 mSdLazyCounter, 7190 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18824.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 45.28ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7190 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20033.11ms IncrementalHoareTripleChecker+Time [2021-11-04 04:22:54,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1586 Valid, 0 Invalid, 7196 Unknown, 0 Unchecked, 45.28ms Time], IncrementalHoareTripleChecker [5 Valid, 7190 Invalid, 1 Unknown, 0 Unchecked, 20033.11ms Time] [2021-11-04 04:22:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8652 states. [2021-11-04 04:22:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8652 to 7290. [2021-11-04 04:22:54,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7290 states, 7289 states have (on average 1.5147482507888599) internal successors, (11041), 7289 states have internal predecessors, (11041), 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 04:22:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7290 states to 7290 states and 11041 transitions. [2021-11-04 04:22:54,914 INFO L78 Accepts]: Start accepts. Automaton has 7290 states and 11041 transitions. Word has length 105 [2021-11-04 04:22:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:22:54,914 INFO L470 AbstractCegarLoop]: Abstraction has 7290 states and 11041 transitions. [2021-11-04 04:22:54,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 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 04:22:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 7290 states and 11041 transitions. [2021-11-04 04:22:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-04 04:22:54,922 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:22:54,922 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:22:54,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-04 04:22:55,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-04 04:22:55,145 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:22:55,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:22:55,145 INFO L85 PathProgramCache]: Analyzing trace with hash 309106831, now seen corresponding path program 1 times [2021-11-04 04:22:55,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:22:55,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552192790] [2021-11-04 04:22:55,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:22:55,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:22:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:22:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 19 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-04 04:22:55,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:22:55,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552192790] [2021-11-04 04:22:55,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552192790] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 04:22:55,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300137244] [2021-11-04 04:22:55,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:22:55,508 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 04:22:55,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 04:22:55,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-04 04:22:55,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-04 04:22:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:22:56,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 3009 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 04:22:56,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 04:22:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-11-04 04:22:56,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-04 04:22:56,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300137244] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:22:56,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-04 04:22:56,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-04 04:22:56,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691045362] [2021-11-04 04:22:56,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:22:56,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 04:22:56,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:22:56,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 04:22:56,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-04 04:22:56,845 INFO L87 Difference]: Start difference. First operand 7290 states and 11041 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 04:22:58,888 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 04:23:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:23:05,823 INFO L93 Difference]: Finished difference Result 14565 states and 22065 transitions. [2021-11-04 04:23:05,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 04:23:05,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 115 [2021-11-04 04:23:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:23:05,836 INFO L225 Difference]: With dead ends: 14565 [2021-11-04 04:23:05,836 INFO L226 Difference]: Without dead ends: 7047 [2021-11-04 04:23:05,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 134.83ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-04 04:23:05,844 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 980 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7953.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.55ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8678.11ms IncrementalHoareTripleChecker+Time [2021-11-04 04:23:05,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [980 Valid, 0 Invalid, 2272 Unknown, 0 Unchecked, 10.55ms Time], IncrementalHoareTripleChecker [1 Valid, 2270 Invalid, 1 Unknown, 0 Unchecked, 8678.11ms Time] [2021-11-04 04:23:05,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7047 states. [2021-11-04 04:23:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7047 to 7047. [2021-11-04 04:23:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7047 states, 7046 states have (on average 1.5079477717854102) internal successors, (10625), 7046 states have internal predecessors, (10625), 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 04:23:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7047 states to 7047 states and 10625 transitions. [2021-11-04 04:23:06,006 INFO L78 Accepts]: Start accepts. Automaton has 7047 states and 10625 transitions. Word has length 115 [2021-11-04 04:23:06,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:23:06,006 INFO L470 AbstractCegarLoop]: Abstraction has 7047 states and 10625 transitions. [2021-11-04 04:23:06,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 04:23:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 7047 states and 10625 transitions. [2021-11-04 04:23:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-04 04:23:06,012 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:23:06,013 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:23:06,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-04 04:23:06,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-04 04:23:06,236 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:23:06,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:23:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2108797235, now seen corresponding path program 1 times [2021-11-04 04:23:06,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:23:06,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085097243] [2021-11-04 04:23:06,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:23:06,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:23:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:23:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-11-04 04:23:06,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:23:06,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085097243] [2021-11-04 04:23:06,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085097243] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:23:06,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:23:06,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 04:23:06,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779810104] [2021-11-04 04:23:06,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:23:06,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 04:23:06,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:23:06,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 04:23:06,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:23:06,423 INFO L87 Difference]: Start difference. First operand 7047 states and 10625 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 04:23:08,494 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 04:23:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:23:14,270 INFO L93 Difference]: Finished difference Result 10520 states and 15860 transitions. [2021-11-04 04:23:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 04:23:14,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 115 [2021-11-04 04:23:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:23:14,277 INFO L225 Difference]: With dead ends: 10520 [2021-11-04 04:23:14,278 INFO L226 Difference]: Without dead ends: 3487 [2021-11-04 04:23:14,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.24ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:23:14,285 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7121.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.43ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7689.33ms IncrementalHoareTripleChecker+Time [2021-11-04 04:23:14,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 2146 Unknown, 0 Unchecked, 7.43ms Time], IncrementalHoareTripleChecker [0 Valid, 2145 Invalid, 1 Unknown, 0 Unchecked, 7689.33ms Time] [2021-11-04 04:23:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2021-11-04 04:23:14,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3487. [2021-11-04 04:23:14,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3487 states, 3486 states have (on average 1.5060240963855422) internal successors, (5250), 3486 states have internal predecessors, (5250), 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 04:23:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3487 states to 3487 states and 5250 transitions. [2021-11-04 04:23:14,363 INFO L78 Accepts]: Start accepts. Automaton has 3487 states and 5250 transitions. Word has length 115 [2021-11-04 04:23:14,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:23:14,363 INFO L470 AbstractCegarLoop]: Abstraction has 3487 states and 5250 transitions. [2021-11-04 04:23:14,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 04:23:14,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3487 states and 5250 transitions. [2021-11-04 04:23:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-04 04:23:14,368 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:23:14,368 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:23:14,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-04 04:23:14,369 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:23:14,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:23:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1529696734, now seen corresponding path program 1 times [2021-11-04 04:23:14,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:23:14,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746274793] [2021-11-04 04:23:14,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:23:14,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:23:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:23:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-04 04:23:14,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:23:14,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746274793] [2021-11-04 04:23:14,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746274793] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:23:14,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:23:14,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 04:23:14,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339489775] [2021-11-04 04:23:14,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:23:14,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 04:23:14,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:23:14,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 04:23:14,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 04:23:14,806 INFO L87 Difference]: Start difference. First operand 3487 states and 5250 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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 04:23:16,847 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 04:23:30,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:23:30,818 INFO L93 Difference]: Finished difference Result 9194 states and 13823 transitions. [2021-11-04 04:23:30,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 04:23:30,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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 137 [2021-11-04 04:23:30,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:23:30,827 INFO L225 Difference]: With dead ends: 9194 [2021-11-04 04:23:30,828 INFO L226 Difference]: Without dead ends: 5814 [2021-11-04 04:23:30,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 111.56ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-04 04:23:30,835 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1464 mSDsluCounter, 3486 mSDsCounter, 0 mSdLazyCounter, 5170 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14542.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 35.62ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5170 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15614.20ms IncrementalHoareTripleChecker+Time [2021-11-04 04:23:30,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1464 Valid, 0 Invalid, 5171 Unknown, 0 Unchecked, 35.62ms Time], IncrementalHoareTripleChecker [0 Valid, 5170 Invalid, 1 Unknown, 0 Unchecked, 15614.20ms Time] [2021-11-04 04:23:30,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5814 states. [2021-11-04 04:23:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5814 to 3871. [2021-11-04 04:23:30,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3871 states, 3870 states have (on average 1.503359173126615) internal successors, (5818), 3870 states have internal predecessors, (5818), 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 04:23:30,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3871 states to 3871 states and 5818 transitions. [2021-11-04 04:23:30,939 INFO L78 Accepts]: Start accepts. Automaton has 3871 states and 5818 transitions. Word has length 137 [2021-11-04 04:23:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:23:30,939 INFO L470 AbstractCegarLoop]: Abstraction has 3871 states and 5818 transitions. [2021-11-04 04:23:30,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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 04:23:30,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3871 states and 5818 transitions. [2021-11-04 04:23:30,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-04 04:23:30,944 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:23:30,944 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:23:30,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-04 04:23:30,944 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:23:30,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:23:30,945 INFO L85 PathProgramCache]: Analyzing trace with hash 224943928, now seen corresponding path program 1 times [2021-11-04 04:23:30,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:23:30,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646846666] [2021-11-04 04:23:30,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:23:30,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:23:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:23:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-04 04:23:31,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:23:31,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646846666] [2021-11-04 04:23:31,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646846666] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:23:31,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:23:31,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 04:23:31,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194013804] [2021-11-04 04:23:31,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:23:31,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 04:23:31,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:23:31,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 04:23:31,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:23:31,116 INFO L87 Difference]: Start difference. First operand 3871 states and 5818 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 04:23:33,167 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 04:23:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:23:39,193 INFO L93 Difference]: Finished difference Result 7639 states and 11488 transitions. [2021-11-04 04:23:39,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 04:23:39,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 169 [2021-11-04 04:23:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:23:39,199 INFO L225 Difference]: With dead ends: 7639 [2021-11-04 04:23:39,199 INFO L226 Difference]: Without dead ends: 3875 [2021-11-04 04:23:39,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.06ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:23:39,208 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7334.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.97ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7921.74ms IncrementalHoareTripleChecker+Time [2021-11-04 04:23:39,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 2144 Unknown, 0 Unchecked, 7.97ms Time], IncrementalHoareTripleChecker [0 Valid, 2143 Invalid, 1 Unknown, 0 Unchecked, 7921.74ms Time] [2021-11-04 04:23:39,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3875 states. [2021-11-04 04:23:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3875 to 3875. [2021-11-04 04:23:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3875 states, 3874 states have (on average 1.502839442436758) internal successors, (5822), 3874 states have internal predecessors, (5822), 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 04:23:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3875 states to 3875 states and 5822 transitions. [2021-11-04 04:23:39,294 INFO L78 Accepts]: Start accepts. Automaton has 3875 states and 5822 transitions. Word has length 169 [2021-11-04 04:23:39,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:23:39,294 INFO L470 AbstractCegarLoop]: Abstraction has 3875 states and 5822 transitions. [2021-11-04 04:23:39,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 04:23:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3875 states and 5822 transitions. [2021-11-04 04:23:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-04 04:23:39,299 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:23:39,299 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:23:39,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-04 04:23:39,299 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:23:39,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:23:39,300 INFO L85 PathProgramCache]: Analyzing trace with hash -867691274, now seen corresponding path program 1 times [2021-11-04 04:23:39,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:23:39,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246630570] [2021-11-04 04:23:39,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:23:39,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:23:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:23:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-04 04:23:39,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:23:39,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246630570] [2021-11-04 04:23:39,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246630570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:23:39,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:23:39,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 04:23:39,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233873432] [2021-11-04 04:23:39,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:23:39,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 04:23:39,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:23:39,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 04:23:39,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 04:23:39,632 INFO L87 Difference]: Start difference. First operand 3875 states and 5822 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 04:23:41,676 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 04:23:56,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:23:56,380 INFO L93 Difference]: Finished difference Result 9356 states and 14076 transitions. [2021-11-04 04:23:56,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 04:23:56,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 169 [2021-11-04 04:23:56,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:23:56,388 INFO L225 Difference]: With dead ends: 9356 [2021-11-04 04:23:56,388 INFO L226 Difference]: Without dead ends: 5588 [2021-11-04 04:23:56,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 113.96ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-04 04:23:56,397 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2142 mSDsluCounter, 3292 mSDsCounter, 0 mSdLazyCounter, 5118 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15279.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 34.45ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5118 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16348.77ms IncrementalHoareTripleChecker+Time [2021-11-04 04:23:56,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2142 Valid, 0 Invalid, 5119 Unknown, 0 Unchecked, 34.45ms Time], IncrementalHoareTripleChecker [0 Valid, 5118 Invalid, 1 Unknown, 0 Unchecked, 16348.77ms Time] [2021-11-04 04:23:56,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5588 states. [2021-11-04 04:23:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5588 to 3931. [2021-11-04 04:23:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3931 states, 3930 states have (on average 1.5027989821882952) internal successors, (5906), 3930 states have internal predecessors, (5906), 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 04:23:56,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3931 states to 3931 states and 5906 transitions. [2021-11-04 04:23:56,521 INFO L78 Accepts]: Start accepts. Automaton has 3931 states and 5906 transitions. Word has length 169 [2021-11-04 04:23:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:23:56,521 INFO L470 AbstractCegarLoop]: Abstraction has 3931 states and 5906 transitions. [2021-11-04 04:23:56,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 04:23:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 5906 transitions. [2021-11-04 04:23:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-11-04 04:23:56,525 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:23:56,525 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:23:56,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-04 04:23:56,526 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:23:56,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:23:56,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1997267163, now seen corresponding path program 1 times [2021-11-04 04:23:56,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:23:56,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224603632] [2021-11-04 04:23:56,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:23:56,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:23:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:23:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-04 04:23:57,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:23:57,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224603632] [2021-11-04 04:23:57,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224603632] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:23:57,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:23:57,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-04 04:23:57,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671620362] [2021-11-04 04:23:57,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:23:57,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-04 04:23:57,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:23:57,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-04 04:23:57,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-04 04:23:57,041 INFO L87 Difference]: Start difference. First operand 3931 states and 5906 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 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 04:23:59,085 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 04:24:22,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:24:22,634 INFO L93 Difference]: Finished difference Result 17586 states and 26437 transitions. [2021-11-04 04:24:22,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-04 04:24:22,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 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 171 [2021-11-04 04:24:22,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:24:22,656 INFO L225 Difference]: With dead ends: 17586 [2021-11-04 04:24:22,657 INFO L226 Difference]: Without dead ends: 13762 [2021-11-04 04:24:22,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 379.61ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-04 04:24:22,665 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 5278 mSDsluCounter, 6611 mSDsCounter, 0 mSdLazyCounter, 8012 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23026.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5278 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 73.65ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 8012 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24643.22ms IncrementalHoareTripleChecker+Time [2021-11-04 04:24:22,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5278 Valid, 0 Invalid, 8022 Unknown, 0 Unchecked, 73.65ms Time], IncrementalHoareTripleChecker [9 Valid, 8012 Invalid, 1 Unknown, 0 Unchecked, 24643.22ms Time] [2021-11-04 04:24:22,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13762 states. [2021-11-04 04:24:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13762 to 3951. [2021-11-04 04:24:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.5002531645569621) internal successors, (5926), 3950 states have internal predecessors, (5926), 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 04:24:22,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 5926 transitions. [2021-11-04 04:24:22,901 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 5926 transitions. Word has length 171 [2021-11-04 04:24:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:24:22,901 INFO L470 AbstractCegarLoop]: Abstraction has 3951 states and 5926 transitions. [2021-11-04 04:24:22,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 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 04:24:22,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 5926 transitions. [2021-11-04 04:24:22,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-11-04 04:24:22,906 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:24:22,906 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:24:22,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-04 04:24:22,906 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:24:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:24:22,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1246341257, now seen corresponding path program 1 times [2021-11-04 04:24:22,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:24:22,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667296951] [2021-11-04 04:24:22,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:24:22,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:24:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:24:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-04 04:24:23,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:24:23,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667296951] [2021-11-04 04:24:23,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667296951] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:24:23,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:24:23,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 04:24:23,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104562784] [2021-11-04 04:24:23,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:24:23,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 04:24:23,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:24:23,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 04:24:23,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 04:24:23,296 INFO L87 Difference]: Start difference. First operand 3951 states and 5926 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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 04:24:25,356 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 04:24:44,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:24:44,142 INFO L93 Difference]: Finished difference Result 18390 states and 27625 transitions. [2021-11-04 04:24:44,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 04:24:44,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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 173 [2021-11-04 04:24:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:24:44,161 INFO L225 Difference]: With dead ends: 18390 [2021-11-04 04:24:44,161 INFO L226 Difference]: Without dead ends: 14546 [2021-11-04 04:24:44,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 155.92ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 04:24:44,168 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3759 mSDsluCounter, 4259 mSDsCounter, 0 mSdLazyCounter, 5912 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18602.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3759 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 48.18ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 5912 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20023.46ms IncrementalHoareTripleChecker+Time [2021-11-04 04:24:44,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3759 Valid, 0 Invalid, 5922 Unknown, 0 Unchecked, 48.18ms Time], IncrementalHoareTripleChecker [9 Valid, 5912 Invalid, 1 Unknown, 0 Unchecked, 20023.46ms Time] [2021-11-04 04:24:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14546 states. [2021-11-04 04:24:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14546 to 3963. [2021-11-04 04:24:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3963 states, 3962 states have (on average 1.4987380111055022) internal successors, (5938), 3962 states have internal predecessors, (5938), 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 04:24:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3963 states to 3963 states and 5938 transitions. [2021-11-04 04:24:44,384 INFO L78 Accepts]: Start accepts. Automaton has 3963 states and 5938 transitions. Word has length 173 [2021-11-04 04:24:44,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:24:44,384 INFO L470 AbstractCegarLoop]: Abstraction has 3963 states and 5938 transitions. [2021-11-04 04:24:44,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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 04:24:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3963 states and 5938 transitions. [2021-11-04 04:24:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-04 04:24:44,388 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:24:44,388 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:24:44,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-04 04:24:44,389 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:24:44,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:24:44,389 INFO L85 PathProgramCache]: Analyzing trace with hash 197480787, now seen corresponding path program 1 times [2021-11-04 04:24:44,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:24:44,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831920966] [2021-11-04 04:24:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:24:44,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:24:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:24:44,783 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-04 04:24:44,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:24:44,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831920966] [2021-11-04 04:24:44,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831920966] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:24:44,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:24:44,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 04:24:44,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662999874] [2021-11-04 04:24:44,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:24:44,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 04:24:44,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:24:44,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 04:24:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 04:24:44,785 INFO L87 Difference]: Start difference. First operand 3963 states and 5938 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 04:24:46,825 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 04:25:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:25:04,754 INFO L93 Difference]: Finished difference Result 13132 states and 19715 transitions. [2021-11-04 04:25:04,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 04:25:04,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 175 [2021-11-04 04:25:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:25:04,766 INFO L225 Difference]: With dead ends: 13132 [2021-11-04 04:25:04,767 INFO L226 Difference]: Without dead ends: 9276 [2021-11-04 04:25:04,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 185.21ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 04:25:04,772 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1740 mSDsluCounter, 4272 mSDsCounter, 0 mSdLazyCounter, 6124 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18010.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 39.36ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6124 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19278.07ms IncrementalHoareTripleChecker+Time [2021-11-04 04:25:04,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1740 Valid, 0 Invalid, 6131 Unknown, 0 Unchecked, 39.36ms Time], IncrementalHoareTripleChecker [6 Valid, 6124 Invalid, 1 Unknown, 0 Unchecked, 19278.07ms Time] [2021-11-04 04:25:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9276 states. [2021-11-04 04:25:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9276 to 3975. [2021-11-04 04:25:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3975 states, 3974 states have (on average 1.4972320080523402) internal successors, (5950), 3974 states have internal predecessors, (5950), 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 04:25:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3975 states to 3975 states and 5950 transitions. [2021-11-04 04:25:04,944 INFO L78 Accepts]: Start accepts. Automaton has 3975 states and 5950 transitions. Word has length 175 [2021-11-04 04:25:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:25:04,944 INFO L470 AbstractCegarLoop]: Abstraction has 3975 states and 5950 transitions. [2021-11-04 04:25:04,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 04:25:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3975 states and 5950 transitions. [2021-11-04 04:25:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-11-04 04:25:04,949 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:25:04,949 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:25:04,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-04 04:25:04,950 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:25:04,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:25:04,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2041382447, now seen corresponding path program 1 times [2021-11-04 04:25:04,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:25:04,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455204916] [2021-11-04 04:25:04,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:25:04,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:25:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:25:05,408 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-04 04:25:05,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:25:05,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455204916] [2021-11-04 04:25:05,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455204916] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:25:05,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:25:05,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-04 04:25:05,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721255571] [2021-11-04 04:25:05,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:25:05,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 04:25:05,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:25:05,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 04:25:05,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-04 04:25:05,409 INFO L87 Difference]: Start difference. First operand 3975 states and 5950 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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 04:25:07,454 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 04:25:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:25:25,599 INFO L93 Difference]: Finished difference Result 11602 states and 17405 transitions. [2021-11-04 04:25:25,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 04:25:25,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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 177 [2021-11-04 04:25:25,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:25:25,611 INFO L225 Difference]: With dead ends: 11602 [2021-11-04 04:25:25,611 INFO L226 Difference]: Without dead ends: 7734 [2021-11-04 04:25:25,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 232.35ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-04 04:25:25,619 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1437 mSDsluCounter, 4852 mSDsCounter, 0 mSdLazyCounter, 6221 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18357.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 43.46ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 6221 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19547.67ms IncrementalHoareTripleChecker+Time [2021-11-04 04:25:25,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1437 Valid, 0 Invalid, 6232 Unknown, 0 Unchecked, 43.46ms Time], IncrementalHoareTripleChecker [10 Valid, 6221 Invalid, 1 Unknown, 0 Unchecked, 19547.67ms Time] [2021-11-04 04:25:25,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7734 states. [2021-11-04 04:25:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7734 to 3991. [2021-11-04 04:25:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3991 states, 3990 states have (on average 1.4952380952380953) internal successors, (5966), 3990 states have internal predecessors, (5966), 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 04:25:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3991 states to 3991 states and 5966 transitions. [2021-11-04 04:25:25,811 INFO L78 Accepts]: Start accepts. Automaton has 3991 states and 5966 transitions. Word has length 177 [2021-11-04 04:25:25,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:25:25,812 INFO L470 AbstractCegarLoop]: Abstraction has 3991 states and 5966 transitions. [2021-11-04 04:25:25,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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 04:25:25,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3991 states and 5966 transitions. [2021-11-04 04:25:25,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-11-04 04:25:25,816 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:25:25,817 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:25:25,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-04 04:25:25,817 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:25:25,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:25:25,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1369721333, now seen corresponding path program 1 times [2021-11-04 04:25:25,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:25:25,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080891596] [2021-11-04 04:25:25,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:25:25,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:25:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:25:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-04 04:25:26,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:25:26,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080891596] [2021-11-04 04:25:26,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080891596] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:25:26,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:25:26,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 04:25:26,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703247356] [2021-11-04 04:25:26,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:25:26,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 04:25:26,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:25:26,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 04:25:26,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 04:25:26,251 INFO L87 Difference]: Start difference. First operand 3991 states and 5966 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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 04:25:28,310 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 04:25:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:25:47,980 INFO L93 Difference]: Finished difference Result 13612 states and 20403 transitions. [2021-11-04 04:25:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 04:25:47,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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 179 [2021-11-04 04:25:47,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:25:48,006 INFO L225 Difference]: With dead ends: 13612 [2021-11-04 04:25:48,006 INFO L226 Difference]: Without dead ends: 9728 [2021-11-04 04:25:48,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 151.56ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 04:25:48,016 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2239 mSDsluCounter, 4718 mSDsCounter, 0 mSdLazyCounter, 6516 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19549.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2239 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 48.49ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6516 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20922.28ms IncrementalHoareTripleChecker+Time [2021-11-04 04:25:48,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2239 Valid, 0 Invalid, 6522 Unknown, 0 Unchecked, 48.49ms Time], IncrementalHoareTripleChecker [5 Valid, 6516 Invalid, 1 Unknown, 0 Unchecked, 20922.28ms Time] [2021-11-04 04:25:48,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9728 states. [2021-11-04 04:25:48,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9728 to 4003. [2021-11-04 04:25:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4003 states, 4002 states have (on average 1.4937531234382808) internal successors, (5978), 4002 states have internal predecessors, (5978), 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 04:25:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4003 states to 4003 states and 5978 transitions. [2021-11-04 04:25:48,215 INFO L78 Accepts]: Start accepts. Automaton has 4003 states and 5978 transitions. Word has length 179 [2021-11-04 04:25:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:25:48,215 INFO L470 AbstractCegarLoop]: Abstraction has 4003 states and 5978 transitions. [2021-11-04 04:25:48,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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 04:25:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 4003 states and 5978 transitions. [2021-11-04 04:25:48,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-11-04 04:25:48,219 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:25:48,219 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:25:48,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-04 04:25:48,220 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:25:48,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:25:48,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1328550737, now seen corresponding path program 1 times [2021-11-04 04:25:48,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:25:48,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539272772] [2021-11-04 04:25:48,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:25:48,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:25:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:25:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-04 04:25:49,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:25:49,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539272772] [2021-11-04 04:25:49,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539272772] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:25:49,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:25:49,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 04:25:49,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545396253] [2021-11-04 04:25:49,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:25:49,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 04:25:49,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:25:49,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 04:25:49,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 04:25:49,771 INFO L87 Difference]: Start difference. First operand 4003 states and 5978 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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 04:25:51,815 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 04:26:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:26:10,764 INFO L93 Difference]: Finished difference Result 11213 states and 16768 transitions. [2021-11-04 04:26:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 04:26:10,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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 181 [2021-11-04 04:26:10,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:26:10,776 INFO L225 Difference]: With dead ends: 11213 [2021-11-04 04:26:10,776 INFO L226 Difference]: Without dead ends: 7317 [2021-11-04 04:26:10,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 227.30ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-04 04:26:10,783 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2827 mSDsluCounter, 4660 mSDsCounter, 0 mSdLazyCounter, 6483 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18901.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2827 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 47.80ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6483 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20233.19ms IncrementalHoareTripleChecker+Time [2021-11-04 04:26:10,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2827 Valid, 0 Invalid, 6486 Unknown, 0 Unchecked, 47.80ms Time], IncrementalHoareTripleChecker [2 Valid, 6483 Invalid, 1 Unknown, 0 Unchecked, 20233.19ms Time] [2021-11-04 04:26:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7317 states. [2021-11-04 04:26:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7317 to 4003. [2021-11-04 04:26:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4003 states, 4002 states have (on average 1.4937531234382808) internal successors, (5978), 4002 states have internal predecessors, (5978), 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 04:26:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4003 states to 4003 states and 5978 transitions. [2021-11-04 04:26:11,019 INFO L78 Accepts]: Start accepts. Automaton has 4003 states and 5978 transitions. Word has length 181 [2021-11-04 04:26:11,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:26:11,019 INFO L470 AbstractCegarLoop]: Abstraction has 4003 states and 5978 transitions. [2021-11-04 04:26:11,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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 04:26:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 4003 states and 5978 transitions. [2021-11-04 04:26:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-11-04 04:26:11,024 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:26:11,024 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:26:11,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-04 04:26:11,024 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:26:11,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:26:11,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1785084685, now seen corresponding path program 1 times [2021-11-04 04:26:11,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:26:11,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107477317] [2021-11-04 04:26:11,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:26:11,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:26:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:26:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-04 04:26:12,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:26:12,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107477317] [2021-11-04 04:26:12,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107477317] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:26:12,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:26:12,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 04:26:12,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369728389] [2021-11-04 04:26:12,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:26:12,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 04:26:12,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:26:12,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 04:26:12,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:26:12,777 INFO L87 Difference]: Start difference. First operand 4003 states and 5978 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 04:26:14,820 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 04:26:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:26:20,292 INFO L93 Difference]: Finished difference Result 8010 states and 11964 transitions. [2021-11-04 04:26:20,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 04:26:20,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 183 [2021-11-04 04:26:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:26:20,301 INFO L225 Difference]: With dead ends: 8010 [2021-11-04 04:26:20,301 INFO L226 Difference]: Without dead ends: 4114 [2021-11-04 04:26:20,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.69ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 04:26:20,306 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1045 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6622.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.57ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7144.02ms IncrementalHoareTripleChecker+Time [2021-11-04 04:26:20,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1045 Valid, 0 Invalid, 1416 Unknown, 0 Unchecked, 8.57ms Time], IncrementalHoareTripleChecker [0 Valid, 1415 Invalid, 1 Unknown, 0 Unchecked, 7144.02ms Time] [2021-11-04 04:26:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4114 states. [2021-11-04 04:26:20,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4114 to 4003. [2021-11-04 04:26:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4003 states, 4002 states have (on average 1.4927536231884058) internal successors, (5974), 4002 states have internal predecessors, (5974), 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 04:26:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4003 states to 4003 states and 5974 transitions. [2021-11-04 04:26:20,557 INFO L78 Accepts]: Start accepts. Automaton has 4003 states and 5974 transitions. Word has length 183 [2021-11-04 04:26:20,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:26:20,558 INFO L470 AbstractCegarLoop]: Abstraction has 4003 states and 5974 transitions. [2021-11-04 04:26:20,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 04:26:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 4003 states and 5974 transitions. [2021-11-04 04:26:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-04 04:26:20,562 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:26:20,562 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:26:20,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-04 04:26:20,563 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:26:20,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:26:20,563 INFO L85 PathProgramCache]: Analyzing trace with hash 547807168, now seen corresponding path program 1 times [2021-11-04 04:26:20,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:26:20,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118317883] [2021-11-04 04:26:20,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:26:20,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:26:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:26:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-04 04:26:24,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:26:24,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118317883] [2021-11-04 04:26:24,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118317883] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 04:26:24,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 04:26:24,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-04 04:26:24,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145263014] [2021-11-04 04:26:24,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 04:26:24,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-04 04:26:24,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 04:26:24,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-04 04:26:24,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-04 04:26:24,768 INFO L87 Difference]: Start difference. First operand 4003 states and 5974 transitions. Second operand has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 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 04:26:26,823 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 04:27:12,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 04:27:12,864 INFO L93 Difference]: Finished difference Result 13436 states and 20096 transitions. [2021-11-04 04:27:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-04 04:27:12,865 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 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 184 [2021-11-04 04:27:12,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 04:27:12,877 INFO L225 Difference]: With dead ends: 13436 [2021-11-04 04:27:12,877 INFO L226 Difference]: Without dead ends: 9540 [2021-11-04 04:27:12,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 762.61ms TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-04 04:27:12,883 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7188 mSDsluCounter, 11778 mSDsCounter, 0 mSdLazyCounter, 14918 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43475.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7188 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 137.74ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 14918 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46431.69ms IncrementalHoareTripleChecker+Time [2021-11-04 04:27:12,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7188 Valid, 0 Invalid, 14938 Unknown, 0 Unchecked, 137.74ms Time], IncrementalHoareTripleChecker [19 Valid, 14918 Invalid, 1 Unknown, 0 Unchecked, 46431.69ms Time] [2021-11-04 04:27:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9540 states. [2021-11-04 04:27:13,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9540 to 4027. [2021-11-04 04:27:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4027 states, 4026 states have (on average 1.4878291107799304) internal successors, (5990), 4026 states have internal predecessors, (5990), 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 04:27:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4027 states to 4027 states and 5990 transitions. [2021-11-04 04:27:13,211 INFO L78 Accepts]: Start accepts. Automaton has 4027 states and 5990 transitions. Word has length 184 [2021-11-04 04:27:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 04:27:13,211 INFO L470 AbstractCegarLoop]: Abstraction has 4027 states and 5990 transitions. [2021-11-04 04:27:13,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 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 04:27:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 4027 states and 5990 transitions. [2021-11-04 04:27:13,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-04 04:27:13,215 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 04:27:13,215 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 04:27:13,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-04 04:27:13,216 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 04:27:13,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 04:27:13,216 INFO L85 PathProgramCache]: Analyzing trace with hash 769204907, now seen corresponding path program 1 times [2021-11-04 04:27:13,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 04:27:13,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739260807] [2021-11-04 04:27:13,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:27:13,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 04:27:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:27:32,953 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-04 04:27:32,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 04:27:32,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739260807] [2021-11-04 04:27:32,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739260807] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 04:27:32,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878592139] [2021-11-04 04:27:32,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 04:27:32,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 04:27:32,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 04:27:32,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-04 04:27:32,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-04 04:30:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 04:30:52,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 3762 conjuncts, 261 conjunts are in the unsatisfiable core [2021-11-04 04:30:52,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 04:30:53,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-04 04:30:56,384 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-04 04:30:56,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-04 04:30:57,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-11-04 04:30:58,035 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-11-04 04:30:58,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2021-11-04 04:30:58,771 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-04 04:30:58,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 45 [2021-11-04 04:30:59,170 INFO L354 Elim1Store]: treesize reduction 94, result has 29.9 percent of original size [2021-11-04 04:30:59,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 47 treesize of output 71 [2021-11-04 04:31:00,622 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-04 04:31:00,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 62 [2021-11-04 04:31:01,254 INFO L354 Elim1Store]: treesize reduction 68, result has 25.3 percent of original size [2021-11-04 04:31:01,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 64 treesize of output 70 [2021-11-04 04:31:03,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 04:31:03,729 INFO L354 Elim1Store]: treesize reduction 470, result has 10.3 percent of original size [2021-11-04 04:31:03,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 287 treesize of output 231 [2021-11-04 04:31:03,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 04:31:04,017 INFO L354 Elim1Store]: treesize reduction 844, result has 7.4 percent of original size [2021-11-04 04:31:04,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 231 treesize of output 154 [2021-11-04 04:31:05,231 INFO L354 Elim1Store]: treesize reduction 298, result has 17.2 percent of original size [2021-11-04 04:31:05,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 220 treesize of output 231 [2021-11-04 04:31:05,418 INFO L354 Elim1Store]: treesize reduction 400, result has 12.9 percent of original size [2021-11-04 04:31:05,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 303 treesize of output 164 [2021-11-04 04:31:18,478 INFO L354 Elim1Store]: treesize reduction 514, result has 18.4 percent of original size [2021-11-04 04:31:18,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 461 treesize of output 256 [2021-11-04 04:31:18,837 INFO L354 Elim1Store]: treesize reduction 268, result has 25.8 percent of original size [2021-11-04 04:31:18,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 422 treesize of output 352 [2021-11-04 04:31:23,116 INFO L354 Elim1Store]: treesize reduction 236, result has 13.2 percent of original size [2021-11-04 04:31:23,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 750 treesize of output 448 [2021-11-04 04:31:23,320 INFO L354 Elim1Store]: treesize reduction 344, result has 12.0 percent of original size [2021-11-04 04:31:23,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 25 case distinctions, treesize of input 503 treesize of output 275 [2021-11-04 04:31:26,540 INFO L354 Elim1Store]: treesize reduction 1070, result has 7.0 percent of original size [2021-11-04 04:31:26,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 34 case distinctions, treesize of input 952 treesize of output 422 [2021-11-04 04:31:27,290 INFO L354 Elim1Store]: treesize reduction 612, result has 8.1 percent of original size [2021-11-04 04:31:27,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 988 treesize of output 609 [2021-11-04 04:31:27,867 INFO L354 Elim1Store]: treesize reduction 744, result has 8.0 percent of original size [2021-11-04 04:31:27,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 634 treesize of output 353 [2021-11-04 04:31:28,389 INFO L354 Elim1Store]: treesize reduction 696, result has 8.5 percent of original size [2021-11-04 04:31:28,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 592 treesize of output 329 [2021-11-04 04:31:29,032 INFO L354 Elim1Store]: treesize reduction 2363, result has 4.7 percent of original size [2021-11-04 04:31:29,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 23 case distinctions, treesize of input 530 treesize of output 498 [2021-11-04 04:31:30,006 INFO L354 Elim1Store]: treesize reduction 632, result has 9.7 percent of original size [2021-11-04 04:31:30,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 1204 treesize of output 367 [2021-11-04 04:31:30,229 INFO L354 Elim1Store]: treesize reduction 584, result has 9.9 percent of original size [2021-11-04 04:31:30,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 1095 treesize of output 697 [2021-11-04 04:31:43,934 INFO L354 Elim1Store]: treesize reduction 561, result has 1.2 percent of original size [2021-11-04 04:31:43,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 1028 treesize of output 239 [2021-11-04 04:31:44,065 INFO L354 Elim1Store]: treesize reduction 269, result has 2.5 percent of original size [2021-11-04 04:31:44,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 209 treesize of output 157 [2021-11-04 04:31:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 20 proven. 42 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-04 04:31:44,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 04:33:35,933 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7 Int) (v_DerPreprocessor_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7 Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset Int)) (< 0 (mod (let ((.cse20 (+ 36 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.offset))) (let ((.cse18 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse20 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base)) (.cse9 (+ 12 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.offset))) (let ((.cse11 (select .cse18 .cse9)) (.cse12 (+ 64 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse13 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 80)) (.cse14 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 96)) (.cse15 (+ 128 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse16 (+ 176 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse17 (+ 168 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7))) (let ((.cse8 (let ((.cse19 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse20 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset)))) (store .cse19 .cse11 (store (store (store (store (store (store (select .cse19 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7) .cse13 v_DerPreprocessor_7) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse15 v_DerPreprocessor_6) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7)))) (.cse5 (let ((.cse10 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base .cse18))) (store .cse10 .cse11 (store (store (store (store (store (store (select .cse10 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7) .cse13 v_DerPreprocessor_5) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse15 v_DerPreprocessor_4) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7))))) (let ((.cse6 (select (select .cse5 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse9)) (.cse7 (+ 92 (select (select .cse8 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse9)))) (let ((.cse0 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_2))) (.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_3))) (.cse4 (+ 533 c_~if_usb_driver_group1~0.offset))) (let ((.cse1 (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4) 28))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2))))))))) 18446744073709551616))) is different from false [2021-11-04 04:33:38,644 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_set_add_~e.base Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7 Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (~last_index~0 Int) (v_DerPreprocessor_2 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7 Int) (ULTIMATE.start_ldv_set_add_~e.offset Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7 Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset Int)) (< 0 (mod (let ((.cse23 (+ (* ~last_index~0 8) |~#set_impl~0.offset|))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#set_impl~0.base|) .cse23 ULTIMATE.start_ldv_set_add_~e.base))) (.cse22 (+ 36 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.offset))) (let ((.cse19 (store (select .cse18 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse22 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base)) (.cse9 (+ 12 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.offset))) (let ((.cse11 (select .cse19 .cse9)) (.cse12 (+ 64 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse13 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 80)) (.cse14 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 96)) (.cse15 (+ 128 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse16 (+ 176 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse17 (+ 168 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7))) (let ((.cse8 (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base|) .cse23 ULTIMATE.start_ldv_set_add_~e.offset)))) (store .cse21 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base (store (select .cse21 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse22 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset))))) (store .cse20 .cse11 (store (store (store (store (store (store (select .cse20 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7) .cse13 v_DerPreprocessor_7) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse15 v_DerPreprocessor_6) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7)))) (.cse5 (let ((.cse10 (store .cse18 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base .cse19))) (store .cse10 .cse11 (store (store (store (store (store (store (select .cse10 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7) .cse13 v_DerPreprocessor_5) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse15 v_DerPreprocessor_4) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7))))) (let ((.cse6 (select (select .cse5 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse9)) (.cse7 (+ 92 (select (select .cse8 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse9)))) (let ((.cse0 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_2))) (.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_3))) (.cse4 (+ 533 c_~if_usb_driver_group1~0.offset))) (let ((.cse1 (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4) 28))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2)))))))))) 18446744073709551616))) is different from false [2021-11-04 04:33:42,809 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_set_add_~e.base Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7 Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (~last_index~0 Int) (v_DerPreprocessor_2 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7 Int) (ULTIMATE.start_ldv_set_add_~e.offset Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7 Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset Int)) (< 0 (mod (let ((.cse23 (+ (* ~last_index~0 8) |~#set_impl~0.offset|))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#set_impl~0.base|) .cse23 ULTIMATE.start_ldv_set_add_~e.base))) (.cse22 (+ c_ULTIMATE.start_if_usb_resume_~cardp~10.offset 36))) (let ((.cse19 (store (select .cse18 c_ULTIMATE.start_if_usb_resume_~cardp~10.base) .cse22 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base)) (.cse9 (+ c_ULTIMATE.start_if_usb_resume_~cardp~10.offset 12))) (let ((.cse11 (select .cse19 .cse9)) (.cse12 (+ 64 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse13 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 80)) (.cse14 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 96)) (.cse15 (+ 128 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse16 (+ 176 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse17 (+ 168 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7))) (let ((.cse8 (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base|) .cse23 ULTIMATE.start_ldv_set_add_~e.offset)))) (store .cse21 c_ULTIMATE.start_if_usb_resume_~cardp~10.base (store (select .cse21 c_ULTIMATE.start_if_usb_resume_~cardp~10.base) .cse22 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset))))) (store .cse20 .cse11 (store (store (store (store (store (store (select .cse20 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7) .cse13 v_DerPreprocessor_7) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse15 v_DerPreprocessor_6) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7)))) (.cse5 (let ((.cse10 (store .cse18 c_ULTIMATE.start_if_usb_resume_~cardp~10.base .cse19))) (store .cse10 .cse11 (store (store (store (store (store (store (select .cse10 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7) .cse13 v_DerPreprocessor_5) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse15 v_DerPreprocessor_4) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7))))) (let ((.cse6 (select (select .cse5 c_ULTIMATE.start_if_usb_resume_~cardp~10.base) .cse9)) (.cse7 (+ 92 (select (select .cse8 c_ULTIMATE.start_if_usb_resume_~cardp~10.base) .cse9)))) (let ((.cse3 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_2))) (.cse0 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_3))) (.cse4 (+ 533 c_~if_usb_driver_group1~0.offset))) (let ((.cse1 (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4) 28))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2)))))))))) 18446744073709551616))) is different from false [2021-11-04 04:33:45,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_set_add_~e.base Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7 Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (~last_index~0 Int) (v_DerPreprocessor_2 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7 Int) (ULTIMATE.start_ldv_set_add_~e.offset Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7 Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset Int)) (< 0 (mod (let ((.cse23 (+ (* ~last_index~0 8) |~#set_impl~0.offset|))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#set_impl~0.base|) .cse23 ULTIMATE.start_ldv_set_add_~e.base))) (.cse22 (+ |c_ULTIMATE.start_usb_get_intfdata_#res.offset| 36))) (let ((.cse19 (store (select .cse18 |c_ULTIMATE.start_usb_get_intfdata_#res.base|) .cse22 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base)) (.cse9 (+ |c_ULTIMATE.start_usb_get_intfdata_#res.offset| 12))) (let ((.cse11 (select .cse19 .cse9)) (.cse12 (+ 64 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse13 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 80)) (.cse14 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 96)) (.cse15 (+ 128 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse16 (+ 176 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse17 (+ 168 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7))) (let ((.cse8 (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base|) .cse23 ULTIMATE.start_ldv_set_add_~e.offset)))) (store .cse21 |c_ULTIMATE.start_usb_get_intfdata_#res.base| (store (select .cse21 |c_ULTIMATE.start_usb_get_intfdata_#res.base|) .cse22 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset))))) (store .cse20 .cse11 (store (store (store (store (store (store (select .cse20 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7) .cse13 v_DerPreprocessor_7) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse15 v_DerPreprocessor_6) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7)))) (.cse5 (let ((.cse10 (store .cse18 |c_ULTIMATE.start_usb_get_intfdata_#res.base| .cse19))) (store .cse10 .cse11 (store (store (store (store (store (store (select .cse10 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7) .cse13 v_DerPreprocessor_5) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse15 v_DerPreprocessor_4) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7))))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_usb_get_intfdata_#res.base|) .cse9)) (.cse7 (+ (select (select .cse8 |c_ULTIMATE.start_usb_get_intfdata_#res.base|) .cse9) 92))) (let ((.cse0 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_2))) (.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_3))) (.cse4 (+ 533 c_~if_usb_driver_group1~0.offset))) (let ((.cse1 (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4) 28))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2)))))))))) 18446744073709551616))) is different from false [2021-11-04 04:33:47,631 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_set_add_~e.base Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7 Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (~last_index~0 Int) (v_DerPreprocessor_2 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7 Int) (ULTIMATE.start_ldv_set_add_~e.offset Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7 Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset Int)) (< 0 (mod (let ((.cse23 (+ (* ~last_index~0 8) |~#set_impl~0.offset|))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#set_impl~0.base|) .cse23 ULTIMATE.start_ldv_set_add_~e.base))) (.cse22 (+ 36 |c_ULTIMATE.start_dev_get_drvdata_#res.offset|))) (let ((.cse19 (store (select .cse18 |c_ULTIMATE.start_dev_get_drvdata_#res.base|) .cse22 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base)) (.cse9 (+ 12 |c_ULTIMATE.start_dev_get_drvdata_#res.offset|))) (let ((.cse11 (select .cse19 .cse9)) (.cse12 (+ 64 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse13 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 80)) (.cse14 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 96)) (.cse15 (+ 128 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse16 (+ 176 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse17 (+ 168 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7))) (let ((.cse8 (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base|) .cse23 ULTIMATE.start_ldv_set_add_~e.offset)))) (store .cse21 |c_ULTIMATE.start_dev_get_drvdata_#res.base| (store (select .cse21 |c_ULTIMATE.start_dev_get_drvdata_#res.base|) .cse22 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset))))) (store .cse20 .cse11 (store (store (store (store (store (store (select .cse20 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7) .cse13 v_DerPreprocessor_7) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse15 v_DerPreprocessor_6) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7)))) (.cse5 (let ((.cse10 (store .cse18 |c_ULTIMATE.start_dev_get_drvdata_#res.base| .cse19))) (store .cse10 .cse11 (store (store (store (store (store (store (select .cse10 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7) .cse13 v_DerPreprocessor_5) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse15 v_DerPreprocessor_4) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7))))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_dev_get_drvdata_#res.base|) .cse9)) (.cse7 (+ 92 (select (select .cse8 |c_ULTIMATE.start_dev_get_drvdata_#res.base|) .cse9)))) (let ((.cse3 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_2))) (.cse0 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_3))) (.cse4 (+ 533 c_~if_usb_driver_group1~0.offset))) (let ((.cse1 (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4) 28))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2)))))))))) 18446744073709551616))) is different from false [2021-11-04 04:33:50,050 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_set_add_~e.base Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7 Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (~last_index~0 Int) (v_DerPreprocessor_2 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7 Int) (ULTIMATE.start_ldv_set_add_~e.offset Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7 Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset Int)) (< 0 (mod (let ((.cse4 (+ 533 c_~if_usb_driver_group1~0.offset))) (let ((.cse25 (select (select |c_#memory_$Pointer$.offset| c_~if_usb_driver_group1~0.base) .cse4)) (.cse24 (+ (* ~last_index~0 8) |~#set_impl~0.offset|))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#set_impl~0.base|) .cse24 ULTIMATE.start_ldv_set_add_~e.base))) (.cse9 (select (select |c_#memory_$Pointer$.base| c_~if_usb_driver_group1~0.base) .cse4)) (.cse23 (+ .cse25 36))) (let ((.cse20 (store (select .cse19 .cse9) .cse23 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base)) (.cse10 (+ .cse25 12))) (let ((.cse12 (select .cse20 .cse10)) (.cse13 (+ 64 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse14 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 80)) (.cse15 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 96)) (.cse16 (+ 128 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse17 (+ 176 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse18 (+ 168 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7))) (let ((.cse8 (let ((.cse21 (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base|) .cse24 ULTIMATE.start_ldv_set_add_~e.offset)))) (store .cse22 .cse9 (store (select .cse22 .cse9) .cse23 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset))))) (store .cse21 .cse12 (store (store (store (store (store (store (select .cse21 .cse12) .cse13 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7) .cse14 v_DerPreprocessor_7) .cse15 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse16 v_DerPreprocessor_6) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7) .cse18 v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7)))) (.cse5 (let ((.cse11 (store .cse19 .cse9 .cse20))) (store .cse11 .cse12 (store (store (store (store (store (store (select .cse11 .cse12) .cse13 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7) .cse14 v_DerPreprocessor_5) .cse15 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse16 v_DerPreprocessor_4) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7) .cse18 v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7))))) (let ((.cse6 (select (select .cse5 .cse9) .cse10)) (.cse7 (+ 92 (select (select .cse8 .cse9) .cse10)))) (let ((.cse0 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_2))) (.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_3)))) (let ((.cse1 (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4) 28))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2))))))))))) 18446744073709551616))) is different from false [2021-11-04 04:34:00,403 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_set_add_~e.base Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7 Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (~last_index~0 Int) (v_DerPreprocessor_2 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7 Int) (ULTIMATE.start_ldv_set_add_~e.offset Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7 Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset Int)) (< 0 (mod (let ((.cse28 (+ c_ULTIMATE.start_if_usb_probe_~intf.offset 533))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_if_usb_probe_~intf.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_if_usb_probe_~intf.base) .cse28 c_ULTIMATE.start_if_usb_probe_~cardp~3.offset))) (.cse4 (+ 533 c_~if_usb_driver_group1~0.offset))) (let ((.cse26 (select (select .cse24 c_~if_usb_driver_group1~0.base) .cse4)) (.cse27 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_if_usb_probe_~intf.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_if_usb_probe_~intf.base) .cse28 c_ULTIMATE.start_if_usb_probe_~cardp~3.base))) (.cse25 (+ (* ~last_index~0 8) |~#set_impl~0.offset|))) (let ((.cse19 (store .cse27 |c_~#set_impl~0.base| (store (select .cse27 |c_~#set_impl~0.base|) .cse25 ULTIMATE.start_ldv_set_add_~e.base))) (.cse9 (select (select .cse27 c_~if_usb_driver_group1~0.base) .cse4)) (.cse23 (+ 36 .cse26))) (let ((.cse20 (store (select .cse19 .cse9) .cse23 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base)) (.cse10 (+ 12 .cse26))) (let ((.cse12 (select .cse20 .cse10)) (.cse13 (+ 64 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse14 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 80)) (.cse15 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 96)) (.cse16 (+ 128 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse17 (+ 176 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse18 (+ 168 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7))) (let ((.cse8 (let ((.cse21 (let ((.cse22 (store .cse24 |c_~#set_impl~0.base| (store (select .cse24 |c_~#set_impl~0.base|) .cse25 ULTIMATE.start_ldv_set_add_~e.offset)))) (store .cse22 .cse9 (store (select .cse22 .cse9) .cse23 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset))))) (store .cse21 .cse12 (store (store (store (store (store (store (select .cse21 .cse12) .cse13 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7) .cse14 v_DerPreprocessor_7) .cse15 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse16 v_DerPreprocessor_6) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7) .cse18 v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7)))) (.cse5 (let ((.cse11 (store .cse19 .cse9 .cse20))) (store .cse11 .cse12 (store (store (store (store (store (store (select .cse11 .cse12) .cse13 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7) .cse14 v_DerPreprocessor_5) .cse15 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse16 v_DerPreprocessor_4) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7) .cse18 v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7))))) (let ((.cse6 (select (select .cse5 .cse9) .cse10)) (.cse7 (+ (select (select .cse8 .cse9) .cse10) 92))) (let ((.cse3 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_2))) (.cse0 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_3)))) (let ((.cse1 (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4) 28))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2)))))))))))) 18446744073709551616))) is different from false Killed by 15