./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 5f08f0f0 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-5f08f0f [2021-11-05 16:43:38,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 16:43:38,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 16:43:38,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 16:43:38,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 16:43:38,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 16:43:38,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 16:43:38,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 16:43:38,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 16:43:38,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 16:43:38,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 16:43:38,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 16:43:38,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 16:43:38,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 16:43:38,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 16:43:38,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 16:43:38,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 16:43:38,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 16:43:38,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 16:43:38,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 16:43:38,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 16:43:38,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 16:43:38,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 16:43:38,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 16:43:38,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 16:43:38,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 16:43:38,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 16:43:38,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 16:43:38,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 16:43:38,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 16:43:38,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 16:43:38,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 16:43:38,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 16:43:38,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 16:43:38,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 16:43:38,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 16:43:38,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 16:43:38,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 16:43:38,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 16:43:38,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 16:43:38,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 16:43:38,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-05 16:43:38,383 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 16:43:38,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 16:43:38,385 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 16:43:38,385 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 16:43:38,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 16:43:38,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 16:43:38,387 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 16:43:38,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 16:43:38,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-05 16:43:38,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 16:43:38,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 16:43:38,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 16:43:38,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 16:43:38,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 16:43:38,389 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 16:43:38,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 16:43:38,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 16:43:38,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 16:43:38,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 16:43:38,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 16:43:38,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 16:43:38,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 16:43:38,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 16:43:38,391 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-05 16:43:38,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-05 16:43:38,400 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 16:43:38,400 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 16:43:38,400 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 16:43:38,400 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 16:43:38,400 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-05 16:43:38,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 16:43:38,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 16:43:38,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 16:43:38,698 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 16:43:38,699 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 16:43:38,700 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-05 16:43:38,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58afef0af/ceaf8208671f41629825a14be7121d73/FLAGc2c9298b7 [2021-11-05 16:43:39,469 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 16:43:39,470 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-05 16:43:39,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58afef0af/ceaf8208671f41629825a14be7121d73/FLAGc2c9298b7 [2021-11-05 16:43:39,598 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58afef0af/ceaf8208671f41629825a14be7121d73 [2021-11-05 16:43:39,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 16:43:39,602 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 16:43:39,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 16:43:39,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 16:43:39,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 16:43:39,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 04:43:39" (1/1) ... [2021-11-05 16:43:39,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18ca5c22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:43:39, skipping insertion in model container [2021-11-05 16:43:39,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 04:43:39" (1/1) ... [2021-11-05 16:43:39,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 16:43:39,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 16:43:40,383 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-05 16:43:40,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 16:43:40,893 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 16:43:41,046 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-05 16:43:41,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 16:43:41,279 INFO L208 MainTranslator]: Completed translation [2021-11-05 16:43:41,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:43:41 WrapperNode [2021-11-05 16:43:41,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 16:43:41,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 16:43:41,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 16:43:41,283 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 16:43:41,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:43:41" (1/1) ... [2021-11-05 16:43:41,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:43:41" (1/1) ... [2021-11-05 16:43:41,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 16:43:41,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 16:43:41,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 16:43:41,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 16:43:41,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:43:41" (1/1) ... [2021-11-05 16:43:41,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:43:41" (1/1) ... [2021-11-05 16:43:41,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:43:41" (1/1) ... [2021-11-05 16:43:41,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:43:41" (1/1) ... [2021-11-05 16:43:41,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:43:41" (1/1) ... [2021-11-05 16:43:41,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:43:41" (1/1) ... [2021-11-05 16:43:41,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:43:41" (1/1) ... [2021-11-05 16:43:41,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 16:43:41,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 16:43:41,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 16:43:41,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 16:43:41,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:43:41" (1/1) ... [2021-11-05 16:43:41,627 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 16:43:41,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:43:41,648 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-05 16:43:41,660 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-05 16:43:41,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-05 16:43:41,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-05 16:43:41,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 16:43:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 16:43:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 16:43:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-05 16:43:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 16:43:41,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 16:43:41,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 16:43:41,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-05 16:43:41,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 16:43:41,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 16:43:51,999 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 16:43:51,999 INFO L299 CfgBuilder]: Removed 453 assume(true) statements. [2021-11-05 16:43:52,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 04:43:52 BoogieIcfgContainer [2021-11-05 16:43:52,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 16:43:52,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 16:43:52,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 16:43:52,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 16:43:52,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 04:43:39" (1/3) ... [2021-11-05 16:43:52,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15cebd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 04:43:52, skipping insertion in model container [2021-11-05 16:43:52,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 04:43:41" (2/3) ... [2021-11-05 16:43:52,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15cebd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 04:43:52, skipping insertion in model container [2021-11-05 16:43:52,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 04:43:52" (3/3) ... [2021-11-05 16:43:52,008 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-05 16:43:52,012 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 16:43:52,012 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-05 16:43:52,052 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 16:43:52,057 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-05 16:43:52,058 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-05 16:43:52,080 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-05 16:43:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-05 16:43:52,097 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:43:52,097 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-05 16:43:52,098 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:43:52,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:43:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1244740702, now seen corresponding path program 1 times [2021-11-05 16:43:52,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:43:52,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5443053] [2021-11-05 16:43:52,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:43:52,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:43:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:43:52,727 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-05 16:43:52,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:43:52,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5443053] [2021-11-05 16:43:52,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5443053] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:43:52,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:43:52,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:43:52,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108475124] [2021-11-05 16:43:52,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:43:52,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:43:52,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:43:52,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:43:52,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:43:52,786 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-05 16:43:54,884 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 16:43:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:43:55,156 INFO L93 Difference]: Finished difference Result 2159 states and 3291 transitions. [2021-11-05 16:43:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:43:55,165 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-05 16:43:55,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:43:55,193 INFO L225 Difference]: With dead ends: 2159 [2021-11-05 16:43:55,193 INFO L226 Difference]: Without dead ends: 1420 [2021-11-05 16:43:55,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.78ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:43:55,206 INFO L933 BasicCegarLoop]: 1088 mSDtfsCounter, 1056 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2116.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.63ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2264.41ms IncrementalHoareTripleChecker+Time [2021-11-05 16:43:55,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1056 Valid, 2155 Invalid, 16 Unknown, 0 Unchecked, 12.63ms Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 2264.41ms Time] [2021-11-05 16:43:55,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2021-11-05 16:43:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420. [2021-11-05 16:43:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1419 states have (on average 1.4940098661028893) internal successors, (2120), 1419 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-05 16:43:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 2120 transitions. [2021-11-05 16:43:55,303 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 2120 transitions. Word has length 20 [2021-11-05 16:43:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:43:55,304 INFO L470 AbstractCegarLoop]: Abstraction has 1420 states and 2120 transitions. [2021-11-05 16:43:55,304 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-05 16:43:55,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2120 transitions. [2021-11-05 16:43:55,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-05 16:43:55,306 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:43:55,307 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] [2021-11-05 16:43:55,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-05 16:43:55,307 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:43:55,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:43:55,308 INFO L85 PathProgramCache]: Analyzing trace with hash 104665615, now seen corresponding path program 1 times [2021-11-05 16:43:55,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:43:55,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625008114] [2021-11-05 16:43:55,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:43:55,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:43:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:43:55,506 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-05 16:43:55,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:43:55,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625008114] [2021-11-05 16:43:55,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625008114] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:43:55,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:43:55,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:43:55,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244507319] [2021-11-05 16:43:55,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:43:55,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:43:55,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:43:55,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:43:55,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:43:55,514 INFO L87 Difference]: Start difference. First operand 1420 states and 2120 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-05 16:43:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:43:55,618 INFO L93 Difference]: Finished difference Result 1430 states and 2128 transitions. [2021-11-05 16:43:55,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:43:55,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2021-11-05 16:43:55,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:43:55,625 INFO L225 Difference]: With dead ends: 1430 [2021-11-05 16:43:55,625 INFO L226 Difference]: Without dead ends: 1425 [2021-11-05 16:43:55,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.97ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:43:55,627 INFO L933 BasicCegarLoop]: 1080 mSDtfsCounter, 1072 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.10ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.85ms IncrementalHoareTripleChecker+Time [2021-11-05 16:43:55,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1072 Valid, 1084 Invalid, 6 Unknown, 0 Unchecked, 3.10ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 69.85ms Time] [2021-11-05 16:43:55,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2021-11-05 16:43:55,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1420. [2021-11-05 16:43:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1419 states have (on average 1.4933051444679353) internal successors, (2119), 1419 states have internal predecessors, (2119), 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-05 16:43:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 2119 transitions. [2021-11-05 16:43:55,670 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 2119 transitions. Word has length 27 [2021-11-05 16:43:55,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:43:55,670 INFO L470 AbstractCegarLoop]: Abstraction has 1420 states and 2119 transitions. [2021-11-05 16:43:55,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-05 16:43:55,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2119 transitions. [2021-11-05 16:43:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-05 16:43:55,678 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:43:55,679 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] [2021-11-05 16:43:55,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-05 16:43:55,681 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:43:55,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:43:55,682 INFO L85 PathProgramCache]: Analyzing trace with hash 161923917, now seen corresponding path program 1 times [2021-11-05 16:43:55,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:43:55,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267995355] [2021-11-05 16:43:55,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:43:55,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:43:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:43:55,951 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-05 16:43:55,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:43:55,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267995355] [2021-11-05 16:43:55,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267995355] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:43:55,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:43:55,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 16:43:55,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412248980] [2021-11-05 16:43:55,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:43:55,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 16:43:55,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:43:55,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 16:43:55,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:43:55,953 INFO L87 Difference]: Start difference. First operand 1420 states and 2119 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-05 16:43:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:43:56,367 INFO L93 Difference]: Finished difference Result 4236 states and 6330 transitions. [2021-11-05 16:43:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 16:43:56,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2021-11-05 16:43:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:43:56,379 INFO L225 Difference]: With dead ends: 4236 [2021-11-05 16:43:56,380 INFO L226 Difference]: Without dead ends: 2822 [2021-11-05 16:43:56,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 72.70ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 16:43:56,384 INFO L933 BasicCegarLoop]: 1061 mSDtfsCounter, 1049 mSDsluCounter, 3166 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 259.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 4227 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.07ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 282.82ms IncrementalHoareTripleChecker+Time [2021-11-05 16:43:56,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1049 Valid, 4227 Invalid, 77 Unknown, 0 Unchecked, 9.07ms Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 282.82ms Time] [2021-11-05 16:43:56,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2021-11-05 16:43:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2806. [2021-11-05 16:43:56,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2806 states, 2805 states have (on average 1.494830659536542) internal successors, (4193), 2805 states have internal predecessors, (4193), 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-05 16:43:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 4193 transitions. [2021-11-05 16:43:56,466 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 4193 transitions. Word has length 27 [2021-11-05 16:43:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:43:56,467 INFO L470 AbstractCegarLoop]: Abstraction has 2806 states and 4193 transitions. [2021-11-05 16:43:56,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-05 16:43:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 4193 transitions. [2021-11-05 16:43:56,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-05 16:43:56,471 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:43:56,472 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] [2021-11-05 16:43:56,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-05 16:43:56,472 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:43:56,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:43:56,473 INFO L85 PathProgramCache]: Analyzing trace with hash 944060928, now seen corresponding path program 1 times [2021-11-05 16:43:56,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:43:56,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445035728] [2021-11-05 16:43:56,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:43:56,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:43:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:43:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 16:43:56,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:43:56,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445035728] [2021-11-05 16:43:56,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445035728] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:43:56,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:43:56,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:43:56,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612132665] [2021-11-05 16:43:56,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:43:56,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:43:56,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:43:56,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:43:56,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:43:56,634 INFO L87 Difference]: Start difference. First operand 2806 states and 4193 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-05 16:43:56,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:43:56,819 INFO L93 Difference]: Finished difference Result 5933 states and 8897 transitions. [2021-11-05 16:43:56,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:43:56,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 57 [2021-11-05 16:43:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:43:56,831 INFO L225 Difference]: With dead ends: 5933 [2021-11-05 16:43:56,832 INFO L226 Difference]: Without dead ends: 3138 [2021-11-05 16:43:56,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.94ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:43:56,836 INFO L933 BasicCegarLoop]: 1080 mSDtfsCounter, 142 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 104.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 2121 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.25ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 115.51ms IncrementalHoareTripleChecker+Time [2021-11-05 16:43:56,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 2121 Invalid, 24 Unknown, 0 Unchecked, 3.25ms Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 115.51ms Time] [2021-11-05 16:43:56,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2021-11-05 16:43:56,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 3128. [2021-11-05 16:43:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3128 states, 3127 states have (on average 1.5043172369683402) internal successors, (4704), 3127 states have internal predecessors, (4704), 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-05 16:43:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 4704 transitions. [2021-11-05 16:43:56,914 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 4704 transitions. Word has length 57 [2021-11-05 16:43:56,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:43:56,914 INFO L470 AbstractCegarLoop]: Abstraction has 3128 states and 4704 transitions. [2021-11-05 16:43:56,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-05 16:43:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 4704 transitions. [2021-11-05 16:43:56,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-05 16:43:56,918 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:43:56,919 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] [2021-11-05 16:43:56,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-05 16:43:56,919 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:43:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:43:56,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1782814012, now seen corresponding path program 1 times [2021-11-05 16:43:56,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:43:56,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780698463] [2021-11-05 16:43:56,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:43:56,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:43:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:43:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 16:43:57,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:43:57,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780698463] [2021-11-05 16:43:57,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780698463] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:43:57,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:43:57,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:43:57,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020631202] [2021-11-05 16:43:57,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:43:57,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:43:57,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:43:57,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:43:57,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:43:57,129 INFO L87 Difference]: Start difference. First operand 3128 states and 4704 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-05 16:43:59,181 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-05 16:43:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:43:59,502 INFO L93 Difference]: Finished difference Result 6629 states and 10015 transitions. [2021-11-05 16:43:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:43:59,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 65 [2021-11-05 16:43:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:43:59,517 INFO L225 Difference]: With dead ends: 6629 [2021-11-05 16:43:59,517 INFO L226 Difference]: Without dead ends: 3512 [2021-11-05 16:43:59,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.49ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:43:59,525 INFO L933 BasicCegarLoop]: 1203 mSDtfsCounter, 591 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2142.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.10ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2291.81ms IncrementalHoareTripleChecker+Time [2021-11-05 16:43:59,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [591 Valid, 1803 Invalid, 37 Unknown, 0 Unchecked, 3.10ms Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 1 Unknown, 0 Unchecked, 2291.81ms Time] [2021-11-05 16:43:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2021-11-05 16:43:59,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 3502. [2021-11-05 16:43:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3502 states, 3501 states have (on average 1.5101399600114254) internal successors, (5287), 3501 states have internal predecessors, (5287), 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-05 16:43:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 3502 states and 5287 transitions. [2021-11-05 16:43:59,628 INFO L78 Accepts]: Start accepts. Automaton has 3502 states and 5287 transitions. Word has length 65 [2021-11-05 16:43:59,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:43:59,634 INFO L470 AbstractCegarLoop]: Abstraction has 3502 states and 5287 transitions. [2021-11-05 16:43:59,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-05 16:43:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states and 5287 transitions. [2021-11-05 16:43:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-05 16:43:59,640 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:43:59,641 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] [2021-11-05 16:43:59,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-05 16:43:59,641 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:43:59,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:43:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2010505363, now seen corresponding path program 1 times [2021-11-05 16:43:59,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:43:59,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107733090] [2021-11-05 16:43:59,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:43:59,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:43:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:43:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-05 16:43:59,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:43:59,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107733090] [2021-11-05 16:43:59,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107733090] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:43:59,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:43:59,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:43:59,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634862538] [2021-11-05 16:43:59,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:43:59,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:43:59,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:43:59,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:43:59,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:43:59,876 INFO L87 Difference]: Start difference. First operand 3502 states and 5287 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-05 16:44:01,926 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-05 16:44:02,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:44:02,280 INFO L93 Difference]: Finished difference Result 7372 states and 11177 transitions. [2021-11-05 16:44:02,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:44:02,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 82 [2021-11-05 16:44:02,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:44:02,297 INFO L225 Difference]: With dead ends: 7372 [2021-11-05 16:44:02,297 INFO L226 Difference]: Without dead ends: 3881 [2021-11-05 16:44:02,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.85ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:44:02,307 INFO L933 BasicCegarLoop]: 1217 mSDtfsCounter, 279 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2146.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 2133 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.67ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2300.06ms IncrementalHoareTripleChecker+Time [2021-11-05 16:44:02,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 2133 Invalid, 38 Unknown, 0 Unchecked, 3.67ms Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 1 Unknown, 0 Unchecked, 2300.06ms Time] [2021-11-05 16:44:02,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3881 states. [2021-11-05 16:44:02,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3881 to 3876. [2021-11-05 16:44:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3876 states, 3875 states have (on average 1.5158709677419355) internal successors, (5874), 3875 states have internal predecessors, (5874), 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-05 16:44:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 5874 transitions. [2021-11-05 16:44:02,465 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 5874 transitions. Word has length 82 [2021-11-05 16:44:02,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:44:02,466 INFO L470 AbstractCegarLoop]: Abstraction has 3876 states and 5874 transitions. [2021-11-05 16:44:02,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-05 16:44:02,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 5874 transitions. [2021-11-05 16:44:02,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-05 16:44:02,471 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:44:02,472 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] [2021-11-05 16:44:02,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-05 16:44:02,472 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:44:02,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:44:02,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2103832470, now seen corresponding path program 1 times [2021-11-05 16:44:02,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:44:02,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553299489] [2021-11-05 16:44:02,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:02,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:44:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-05 16:44:02,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:44:02,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553299489] [2021-11-05 16:44:02,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553299489] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:44:02,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:44:02,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 16:44:02,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294420680] [2021-11-05 16:44:02,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:44:02,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 16:44:02,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:44:02,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 16:44:02,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 16:44:02,809 INFO L87 Difference]: Start difference. First operand 3876 states and 5874 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-05 16:44:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:44:03,256 INFO L93 Difference]: Finished difference Result 18669 states and 28376 transitions. [2021-11-05 16:44:03,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 16:44:03,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 101 [2021-11-05 16:44:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:44:03,322 INFO L225 Difference]: With dead ends: 18669 [2021-11-05 16:44:03,322 INFO L226 Difference]: Without dead ends: 14804 [2021-11-05 16:44:03,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 75.65ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:44:03,337 INFO L933 BasicCegarLoop]: 1956 mSDtfsCounter, 3092 mSDsluCounter, 3013 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 103.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3092 SdHoareTripleChecker+Valid, 4969 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.27ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 113.86ms IncrementalHoareTripleChecker+Time [2021-11-05 16:44:03,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3092 Valid, 4969 Invalid, 43 Unknown, 0 Unchecked, 11.27ms Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 113.86ms Time] [2021-11-05 16:44:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14804 states. [2021-11-05 16:44:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14804 to 3892. [2021-11-05 16:44:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3892 states, 3891 states have (on average 1.5137496787458238) internal successors, (5890), 3891 states have internal predecessors, (5890), 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-05 16:44:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5890 transitions. [2021-11-05 16:44:03,580 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5890 transitions. Word has length 101 [2021-11-05 16:44:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:44:03,581 INFO L470 AbstractCegarLoop]: Abstraction has 3892 states and 5890 transitions. [2021-11-05 16:44:03,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-05 16:44:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5890 transitions. [2021-11-05 16:44:03,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-05 16:44:03,590 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:44:03,591 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] [2021-11-05 16:44:03,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-05 16:44:03,591 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:44:03,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:44:03,592 INFO L85 PathProgramCache]: Analyzing trace with hash -343794334, now seen corresponding path program 1 times [2021-11-05 16:44:03,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:44:03,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421667302] [2021-11-05 16:44:03,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:03,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:44:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-05 16:44:03,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:44:03,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421667302] [2021-11-05 16:44:03,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421667302] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:44:03,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:44:03,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 16:44:03,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096347798] [2021-11-05 16:44:03,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:44:03,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 16:44:03,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:44:03,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 16:44:03,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 16:44:03,826 INFO L87 Difference]: Start difference. First operand 3892 states and 5890 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-05 16:44:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:44:04,142 INFO L93 Difference]: Finished difference Result 9406 states and 14264 transitions. [2021-11-05 16:44:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 16:44:04,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 104 [2021-11-05 16:44:04,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:44:04,154 INFO L225 Difference]: With dead ends: 9406 [2021-11-05 16:44:04,154 INFO L226 Difference]: Without dead ends: 5525 [2021-11-05 16:44:04,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.81ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:44:04,160 INFO L933 BasicCegarLoop]: 1909 mSDtfsCounter, 1920 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1920 SdHoareTripleChecker+Valid, 2968 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.69ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.72ms IncrementalHoareTripleChecker+Time [2021-11-05 16:44:04,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1920 Valid, 2968 Invalid, 10 Unknown, 0 Unchecked, 6.69ms Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 77.72ms Time] [2021-11-05 16:44:04,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5525 states. [2021-11-05 16:44:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5525 to 3892. [2021-11-05 16:44:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3892 states, 3891 states have (on average 1.51272166538165) internal successors, (5886), 3891 states have internal predecessors, (5886), 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-05 16:44:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5886 transitions. [2021-11-05 16:44:04,342 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5886 transitions. Word has length 104 [2021-11-05 16:44:04,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:44:04,343 INFO L470 AbstractCegarLoop]: Abstraction has 3892 states and 5886 transitions. [2021-11-05 16:44:04,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-05 16:44:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5886 transitions. [2021-11-05 16:44:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-05 16:44:04,350 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:44:04,350 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] [2021-11-05 16:44:04,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-05 16:44:04,351 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:44:04,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:44:04,351 INFO L85 PathProgramCache]: Analyzing trace with hash 243011680, now seen corresponding path program 1 times [2021-11-05 16:44:04,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:44:04,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111199654] [2021-11-05 16:44:04,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:04,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:44:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-05 16:44:04,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:44:04,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111199654] [2021-11-05 16:44:04,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111199654] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:44:04,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014375369] [2021-11-05 16:44:04,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:04,594 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:44:04,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:44:04,600 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-05 16:44:04,601 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-05 16:44:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:05,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 2910 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-05 16:44:05,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:44:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-05 16:44:05,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 16:44:05,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014375369] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:44:05,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-05 16:44:05,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2021-11-05 16:44:05,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206697685] [2021-11-05 16:44:05,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:44:05,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 16:44:05,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:44:05,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 16:44:05,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-05 16:44:05,980 INFO L87 Difference]: Start difference. First operand 3892 states and 5886 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-05 16:44:08,031 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-05 16:44:08,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:44:08,570 INFO L93 Difference]: Finished difference Result 10124 states and 15271 transitions. [2021-11-05 16:44:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 16:44:08,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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 104 [2021-11-05 16:44:08,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:44:08,585 INFO L225 Difference]: With dead ends: 10124 [2021-11-05 16:44:08,586 INFO L226 Difference]: Without dead ends: 6243 [2021-11-05 16:44:08,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 162.21ms TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-05 16:44:08,597 INFO L933 BasicCegarLoop]: 1678 mSDtfsCounter, 1512 mSDsluCounter, 3497 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2123.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 5175 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.16ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2318.00ms IncrementalHoareTripleChecker+Time [2021-11-05 16:44:08,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1512 Valid, 5175 Invalid, 27 Unknown, 0 Unchecked, 8.16ms Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 2318.00ms Time] [2021-11-05 16:44:08,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6243 states. [2021-11-05 16:44:08,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6243 to 4276. [2021-11-05 16:44:08,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.5097076023391813) internal successors, (6454), 4275 states have internal predecessors, (6454), 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-05 16:44:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 6454 transitions. [2021-11-05 16:44:08,772 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 6454 transitions. Word has length 104 [2021-11-05 16:44:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:44:08,772 INFO L470 AbstractCegarLoop]: Abstraction has 4276 states and 6454 transitions. [2021-11-05 16:44:08,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-05 16:44:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 6454 transitions. [2021-11-05 16:44:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-05 16:44:08,779 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:44:08,779 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, 1, 1, 1, 1, 1, 1, 1, 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-05 16:44:08,838 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-05 16:44:08,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:44:08,995 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:44:08,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:44:08,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1970201798, now seen corresponding path program 1 times [2021-11-05 16:44:08,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:44:08,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211903216] [2021-11-05 16:44:08,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:08,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:44:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:09,169 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-05 16:44:09,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:44:09,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211903216] [2021-11-05 16:44:09,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211903216] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:44:09,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:44:09,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:44:09,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296054189] [2021-11-05 16:44:09,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:44:09,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:44:09,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:44:09,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:44:09,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:44:09,172 INFO L87 Difference]: Start difference. First operand 4276 states and 6454 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-05 16:44:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:44:09,292 INFO L93 Difference]: Finished difference Result 8545 states and 12903 transitions. [2021-11-05 16:44:09,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:44:09,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 136 [2021-11-05 16:44:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:44:09,302 INFO L225 Difference]: With dead ends: 8545 [2021-11-05 16:44:09,302 INFO L226 Difference]: Without dead ends: 4280 [2021-11-05 16:44:09,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.82ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:44:09,308 INFO L933 BasicCegarLoop]: 1075 mSDtfsCounter, 0 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.46ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.98ms IncrementalHoareTripleChecker+Time [2021-11-05 16:44:09,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2145 Invalid, 6 Unknown, 0 Unchecked, 2.46ms Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 17.98ms Time] [2021-11-05 16:44:09,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2021-11-05 16:44:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2021-11-05 16:44:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4279 states have (on average 1.509231128768404) internal successors, (6458), 4279 states have internal predecessors, (6458), 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-05 16:44:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 6458 transitions. [2021-11-05 16:44:09,439 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 6458 transitions. Word has length 136 [2021-11-05 16:44:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:44:09,440 INFO L470 AbstractCegarLoop]: Abstraction has 4280 states and 6458 transitions. [2021-11-05 16:44:09,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-05 16:44:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 6458 transitions. [2021-11-05 16:44:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-05 16:44:09,444 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:44:09,445 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, 1, 1, 1, 1, 1, 1, 1, 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-05 16:44:09,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-05 16:44:09,445 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:44:09,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:44:09,446 INFO L85 PathProgramCache]: Analyzing trace with hash 29619784, now seen corresponding path program 1 times [2021-11-05 16:44:09,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:44:09,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111241259] [2021-11-05 16:44:09,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:09,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:44:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-05 16:44:09,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:44:09,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111241259] [2021-11-05 16:44:09,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111241259] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:44:09,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494325589] [2021-11-05 16:44:09,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:09,820 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:44:09,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:44:09,821 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-05 16:44:09,823 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-05 16:44:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:10,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 3238 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-05 16:44:10,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:44:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-05 16:44:11,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 16:44:11,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494325589] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:44:11,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-05 16:44:11,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-05 16:44:11,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985800214] [2021-11-05 16:44:11,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:44:11,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 16:44:11,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:44:11,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 16:44:11,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:44:11,486 INFO L87 Difference]: Start difference. First operand 4280 states and 6458 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-05 16:44:13,534 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 16:44:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:44:13,907 INFO L93 Difference]: Finished difference Result 6344 states and 9544 transitions. [2021-11-05 16:44:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 16:44:13,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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 136 [2021-11-05 16:44:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:44:13,921 INFO L225 Difference]: With dead ends: 6344 [2021-11-05 16:44:13,921 INFO L226 Difference]: Without dead ends: 6337 [2021-11-05 16:44:13,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.12ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:44:13,924 INFO L933 BasicCegarLoop]: 1671 mSDtfsCounter, 2023 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2076.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2023 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.88ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2199.67ms IncrementalHoareTripleChecker+Time [2021-11-05 16:44:13,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2023 Valid, 2289 Invalid, 17 Unknown, 0 Unchecked, 4.88ms Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 2199.67ms Time] [2021-11-05 16:44:13,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2021-11-05 16:44:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 5266. [2021-11-05 16:44:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5266 states, 5265 states have (on average 1.5061728395061729) internal successors, (7930), 5265 states have internal predecessors, (7930), 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-05 16:44:14,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5266 states to 5266 states and 7930 transitions. [2021-11-05 16:44:14,122 INFO L78 Accepts]: Start accepts. Automaton has 5266 states and 7930 transitions. Word has length 136 [2021-11-05 16:44:14,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:44:14,122 INFO L470 AbstractCegarLoop]: Abstraction has 5266 states and 7930 transitions. [2021-11-05 16:44:14,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-05 16:44:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 5266 states and 7930 transitions. [2021-11-05 16:44:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-05 16:44:14,130 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:44:14,130 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:44:14,158 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-05 16:44:14,343 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-05 16:44:14,343 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:44:14,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:44:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1495766553, now seen corresponding path program 1 times [2021-11-05 16:44:14,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:44:14,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501810147] [2021-11-05 16:44:14,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:14,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:44:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 24 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-05 16:44:14,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:44:14,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501810147] [2021-11-05 16:44:14,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501810147] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:44:14,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179412928] [2021-11-05 16:44:14,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:14,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:44:14,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:44:14,751 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-05 16:44:14,752 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-05 16:44:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:15,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 3313 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-05 16:44:15,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:44:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-05 16:44:16,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 16:44:16,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179412928] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:44:16,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-05 16:44:16,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-05 16:44:16,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756727926] [2021-11-05 16:44:16,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:44:16,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:44:16,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:44:16,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:44:16,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-05 16:44:16,416 INFO L87 Difference]: Start difference. First operand 5266 states and 7930 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-05 16:44:18,465 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-05 16:44:18,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:44:18,745 INFO L93 Difference]: Finished difference Result 10521 states and 15847 transitions. [2021-11-05 16:44:18,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:44:18,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 143 [2021-11-05 16:44:18,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:44:18,756 INFO L225 Difference]: With dead ends: 10521 [2021-11-05 16:44:18,756 INFO L226 Difference]: Without dead ends: 5104 [2021-11-05 16:44:18,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 121.46ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-05 16:44:18,766 INFO L933 BasicCegarLoop]: 1197 mSDtfsCounter, 948 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2074.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 2261 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.25ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2176.88ms IncrementalHoareTripleChecker+Time [2021-11-05 16:44:18,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [948 Valid, 2261 Invalid, 12 Unknown, 0 Unchecked, 3.25ms Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 1 Unknown, 0 Unchecked, 2176.88ms Time] [2021-11-05 16:44:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5104 states. [2021-11-05 16:44:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5104 to 5104. [2021-11-05 16:44:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5104 states, 5103 states have (on average 1.5002939447383892) internal successors, (7656), 5103 states have internal predecessors, (7656), 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-05 16:44:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5104 states to 5104 states and 7656 transitions. [2021-11-05 16:44:18,923 INFO L78 Accepts]: Start accepts. Automaton has 5104 states and 7656 transitions. Word has length 143 [2021-11-05 16:44:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:44:18,923 INFO L470 AbstractCegarLoop]: Abstraction has 5104 states and 7656 transitions. [2021-11-05 16:44:18,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-05 16:44:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 5104 states and 7656 transitions. [2021-11-05 16:44:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-05 16:44:18,952 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:44:18,952 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:44:18,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-05 16:44:19,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:44:19,153 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:44:19,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:44:19,154 INFO L85 PathProgramCache]: Analyzing trace with hash 748791845, now seen corresponding path program 1 times [2021-11-05 16:44:19,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:44:19,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19512512] [2021-11-05 16:44:19,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:19,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:44:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-05 16:44:19,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:44:19,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19512512] [2021-11-05 16:44:19,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19512512] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:44:19,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:44:19,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:44:19,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300090182] [2021-11-05 16:44:19,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:44:19,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:44:19,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:44:19,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:44:19,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:44:19,320 INFO L87 Difference]: Start difference. First operand 5104 states and 7656 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-05 16:44:21,367 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-05 16:44:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:44:21,566 INFO L93 Difference]: Finished difference Result 7651 states and 11475 transitions. [2021-11-05 16:44:21,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:44:21,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 143 [2021-11-05 16:44:21,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:44:21,572 INFO L225 Difference]: With dead ends: 7651 [2021-11-05 16:44:21,572 INFO L226 Difference]: Without dead ends: 2557 [2021-11-05 16:44:21,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.57ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:44:21,579 INFO L933 BasicCegarLoop]: 1074 mSDtfsCounter, 0 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2050.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.65ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2160.92ms IncrementalHoareTripleChecker+Time [2021-11-05 16:44:21,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2143 Invalid, 4 Unknown, 0 Unchecked, 1.65ms Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 2160.92ms Time] [2021-11-05 16:44:21,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2021-11-05 16:44:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2557. [2021-11-05 16:44:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2556 states have (on average 1.498435054773083) internal successors, (3830), 2556 states have internal predecessors, (3830), 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-05 16:44:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3830 transitions. [2021-11-05 16:44:21,656 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3830 transitions. Word has length 143 [2021-11-05 16:44:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:44:21,657 INFO L470 AbstractCegarLoop]: Abstraction has 2557 states and 3830 transitions. [2021-11-05 16:44:21,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-05 16:44:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3830 transitions. [2021-11-05 16:44:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-11-05 16:44:21,661 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:44:21,662 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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-05 16:44:21,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-05 16:44:21,662 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:44:21,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:44:21,662 INFO L85 PathProgramCache]: Analyzing trace with hash -58519242, now seen corresponding path program 1 times [2021-11-05 16:44:21,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:44:21,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255575808] [2021-11-05 16:44:21,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:21,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:44:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-05 16:44:22,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:44:22,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255575808] [2021-11-05 16:44:22,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255575808] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:44:22,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:44:22,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 16:44:22,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871779687] [2021-11-05 16:44:22,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:44:22,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 16:44:22,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:44:22,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 16:44:22,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:44:22,117 INFO L87 Difference]: Start difference. First operand 2557 states and 3830 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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-05 16:44:24,165 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-05 16:44:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:44:24,585 INFO L93 Difference]: Finished difference Result 6418 states and 9623 transitions. [2021-11-05 16:44:24,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 16:44:24,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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 165 [2021-11-05 16:44:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:44:24,593 INFO L225 Difference]: With dead ends: 6418 [2021-11-05 16:44:24,593 INFO L226 Difference]: Without dead ends: 3964 [2021-11-05 16:44:24,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 95.25ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 16:44:24,597 INFO L933 BasicCegarLoop]: 1801 mSDtfsCounter, 2142 mSDsluCounter, 3294 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2110.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2142 SdHoareTripleChecker+Valid, 5095 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.39ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2270.95ms IncrementalHoareTripleChecker+Time [2021-11-05 16:44:24,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2142 Valid, 5095 Invalid, 27 Unknown, 0 Unchecked, 4.39ms Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 2270.95ms Time] [2021-11-05 16:44:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2021-11-05 16:44:24,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 2585. [2021-11-05 16:44:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 2584 states have (on average 1.498452012383901) internal successors, (3872), 2584 states have internal predecessors, (3872), 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-05 16:44:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3872 transitions. [2021-11-05 16:44:24,681 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3872 transitions. Word has length 165 [2021-11-05 16:44:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:44:24,681 INFO L470 AbstractCegarLoop]: Abstraction has 2585 states and 3872 transitions. [2021-11-05 16:44:24,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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-05 16:44:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3872 transitions. [2021-11-05 16:44:24,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-05 16:44:24,686 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:44:24,686 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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-05 16:44:24,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-05 16:44:24,686 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:44:24,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:44:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2072457957, now seen corresponding path program 1 times [2021-11-05 16:44:24,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:44:24,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095865275] [2021-11-05 16:44:24,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:24,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:44:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-05 16:44:25,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:44:25,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095865275] [2021-11-05 16:44:25,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095865275] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:44:25,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:44:25,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-05 16:44:25,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179811680] [2021-11-05 16:44:25,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:44:25,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 16:44:25,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:44:25,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 16:44:25,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-05 16:44:25,270 INFO L87 Difference]: Start difference. First operand 2585 states and 3872 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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-05 16:44:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:44:26,176 INFO L93 Difference]: Finished difference Result 11284 states and 16902 transitions. [2021-11-05 16:44:26,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-05 16:44:26,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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 167 [2021-11-05 16:44:26,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:44:26,194 INFO L225 Difference]: With dead ends: 11284 [2021-11-05 16:44:26,194 INFO L226 Difference]: Without dead ends: 8802 [2021-11-05 16:44:26,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 320.76ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-05 16:44:26,202 INFO L933 BasicCegarLoop]: 1300 mSDtfsCounter, 5272 mSDsluCounter, 6611 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 353.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5272 SdHoareTripleChecker+Valid, 7911 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.48ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 378.78ms IncrementalHoareTripleChecker+Time [2021-11-05 16:44:26,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5272 Valid, 7911 Invalid, 110 Unknown, 0 Unchecked, 9.48ms Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 378.78ms Time] [2021-11-05 16:44:26,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8802 states. [2021-11-05 16:44:26,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8802 to 2600. [2021-11-05 16:44:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2600 states, 2599 states have (on average 1.4955752212389382) internal successors, (3887), 2599 states have internal predecessors, (3887), 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-05 16:44:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 3887 transitions. [2021-11-05 16:44:26,342 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 3887 transitions. Word has length 167 [2021-11-05 16:44:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:44:26,342 INFO L470 AbstractCegarLoop]: Abstraction has 2600 states and 3887 transitions. [2021-11-05 16:44:26,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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-05 16:44:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 3887 transitions. [2021-11-05 16:44:26,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-05 16:44:26,347 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:44:26,347 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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-05 16:44:26,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-05 16:44:26,347 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:44:26,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:44:26,348 INFO L85 PathProgramCache]: Analyzing trace with hash 463025079, now seen corresponding path program 1 times [2021-11-05 16:44:26,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:44:26,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351844602] [2021-11-05 16:44:26,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:26,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:44:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-05 16:44:26,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:44:26,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351844602] [2021-11-05 16:44:26,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351844602] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:44:26,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:44:26,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 16:44:26,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204204622] [2021-11-05 16:44:26,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:44:26,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 16:44:26,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:44:26,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 16:44:26,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:44:26,782 INFO L87 Difference]: Start difference. First operand 2600 states and 3887 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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-05 16:44:27,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:44:27,425 INFO L93 Difference]: Finished difference Result 11887 states and 17793 transitions. [2021-11-05 16:44:27,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 16:44:27,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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-05 16:44:27,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:44:27,440 INFO L225 Difference]: With dead ends: 11887 [2021-11-05 16:44:27,440 INFO L226 Difference]: Without dead ends: 9390 [2021-11-05 16:44:27,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 106.91ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 16:44:27,445 INFO L933 BasicCegarLoop]: 1595 mSDtfsCounter, 3755 mSDsluCounter, 4259 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 197.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3755 SdHoareTripleChecker+Valid, 5854 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.12ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 212.31ms IncrementalHoareTripleChecker+Time [2021-11-05 16:44:27,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3755 Valid, 5854 Invalid, 67 Unknown, 0 Unchecked, 7.12ms Time], IncrementalHoareTripleChecker [9 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 212.31ms Time] [2021-11-05 16:44:27,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9390 states. [2021-11-05 16:44:27,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9390 to 2609. [2021-11-05 16:44:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2609 states, 2608 states have (on average 1.4938650306748467) internal successors, (3896), 2608 states have internal predecessors, (3896), 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-05 16:44:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 3896 transitions. [2021-11-05 16:44:27,629 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 3896 transitions. Word has length 169 [2021-11-05 16:44:27,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:44:27,630 INFO L470 AbstractCegarLoop]: Abstraction has 2609 states and 3896 transitions. [2021-11-05 16:44:27,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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-05 16:44:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 3896 transitions. [2021-11-05 16:44:27,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-11-05 16:44:27,639 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:44:27,639 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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-05 16:44:27,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-05 16:44:27,640 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:44:27,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:44:27,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2073944685, now seen corresponding path program 1 times [2021-11-05 16:44:27,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:44:27,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263760221] [2021-11-05 16:44:27,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:27,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:44:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-05 16:44:28,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:44:28,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263760221] [2021-11-05 16:44:28,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263760221] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:44:28,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:44:28,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 16:44:28,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578842150] [2021-11-05 16:44:28,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:44:28,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 16:44:28,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:44:28,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 16:44:28,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:44:28,029 INFO L87 Difference]: Start difference. First operand 2609 states and 3896 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 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-05 16:44:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:44:28,477 INFO L93 Difference]: Finished difference Result 8719 states and 13049 transitions. [2021-11-05 16:44:28,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 16:44:28,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 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-05 16:44:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:44:28,485 INFO L225 Difference]: With dead ends: 8719 [2021-11-05 16:44:28,485 INFO L226 Difference]: Without dead ends: 6213 [2021-11-05 16:44:28,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 114.46ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 16:44:28,489 INFO L933 BasicCegarLoop]: 1793 mSDtfsCounter, 1739 mSDsluCounter, 4273 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 164.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 6066 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.33ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 175.39ms IncrementalHoareTripleChecker+Time [2021-11-05 16:44:28,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1739 Valid, 6066 Invalid, 65 Unknown, 0 Unchecked, 5.33ms Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 175.39ms Time] [2021-11-05 16:44:28,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6213 states. [2021-11-05 16:44:28,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6213 to 2618. [2021-11-05 16:44:28,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2617 states have (on average 1.492166602980512) internal successors, (3905), 2617 states have internal predecessors, (3905), 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-05 16:44:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 3905 transitions. [2021-11-05 16:44:28,629 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 3905 transitions. Word has length 171 [2021-11-05 16:44:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:44:28,630 INFO L470 AbstractCegarLoop]: Abstraction has 2618 states and 3905 transitions. [2021-11-05 16:44:28,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 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-05 16:44:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 3905 transitions. [2021-11-05 16:44:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-11-05 16:44:28,636 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:44:28,636 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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-05 16:44:28,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-05 16:44:28,637 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:44:28,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:44:28,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1044890223, now seen corresponding path program 1 times [2021-11-05 16:44:28,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:44:28,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784565341] [2021-11-05 16:44:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:28,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:44:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-05 16:44:29,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:44:29,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784565341] [2021-11-05 16:44:29,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784565341] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:44:29,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:44:29,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 16:44:29,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839738503] [2021-11-05 16:44:29,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:44:29,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 16:44:29,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:44:29,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 16:44:29,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 16:44:29,060 INFO L87 Difference]: Start difference. First operand 2618 states and 3905 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 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-05 16:44:29,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:44:29,630 INFO L93 Difference]: Finished difference Result 7568 states and 11313 transitions. [2021-11-05 16:44:29,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 16:44:29,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 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-05 16:44:29,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:44:29,637 INFO L225 Difference]: With dead ends: 7568 [2021-11-05 16:44:29,637 INFO L226 Difference]: Without dead ends: 5053 [2021-11-05 16:44:29,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 196.86ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-05 16:44:29,640 INFO L933 BasicCegarLoop]: 1301 mSDtfsCounter, 1436 mSDsluCounter, 4853 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 190.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 6154 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.39ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 204.72ms IncrementalHoareTripleChecker+Time [2021-11-05 16:44:29,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1436 Valid, 6154 Invalid, 78 Unknown, 0 Unchecked, 5.39ms Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 204.72ms Time] [2021-11-05 16:44:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5053 states. [2021-11-05 16:44:29,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5053 to 2630. [2021-11-05 16:44:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2630 states, 2629 states have (on average 1.489920121719285) internal successors, (3917), 2629 states have internal predecessors, (3917), 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-05 16:44:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3917 transitions. [2021-11-05 16:44:29,777 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3917 transitions. Word has length 173 [2021-11-05 16:44:29,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:44:29,777 INFO L470 AbstractCegarLoop]: Abstraction has 2630 states and 3917 transitions. [2021-11-05 16:44:29,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 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-05 16:44:29,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3917 transitions. [2021-11-05 16:44:29,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-05 16:44:29,783 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:44:29,783 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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-05 16:44:29,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-05 16:44:29,783 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:44:29,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:44:29,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1221041589, now seen corresponding path program 1 times [2021-11-05 16:44:29,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:44:29,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338351229] [2021-11-05 16:44:29,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:29,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:44:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-05 16:44:30,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:44:30,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338351229] [2021-11-05 16:44:30,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338351229] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:44:30,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:44:30,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 16:44:30,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508087316] [2021-11-05 16:44:30,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:44:30,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 16:44:30,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:44:30,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 16:44:30,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:44:30,191 INFO L87 Difference]: Start difference. First operand 2630 states and 3917 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 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-05 16:44:30,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:44:30,882 INFO L93 Difference]: Finished difference Result 9079 states and 13565 transitions. [2021-11-05 16:44:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 16:44:30,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 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-05 16:44:30,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:44:30,893 INFO L225 Difference]: With dead ends: 9079 [2021-11-05 16:44:30,893 INFO L226 Difference]: Without dead ends: 6552 [2021-11-05 16:44:30,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 119.33ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-05 16:44:30,898 INFO L933 BasicCegarLoop]: 1727 mSDtfsCounter, 2238 mSDsluCounter, 4719 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 267.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2238 SdHoareTripleChecker+Valid, 6446 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.27ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 285.53ms IncrementalHoareTripleChecker+Time [2021-11-05 16:44:30,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2238 Valid, 6446 Invalid, 76 Unknown, 0 Unchecked, 6.27ms Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 285.53ms Time] [2021-11-05 16:44:30,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2021-11-05 16:44:31,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 2639. [2021-11-05 16:44:31,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2639 states, 2638 states have (on average 1.488248673237301) internal successors, (3926), 2638 states have internal predecessors, (3926), 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-05 16:44:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 3926 transitions. [2021-11-05 16:44:31,040 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 3926 transitions. Word has length 175 [2021-11-05 16:44:31,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:44:31,041 INFO L470 AbstractCegarLoop]: Abstraction has 2639 states and 3926 transitions. [2021-11-05 16:44:31,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 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-05 16:44:31,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 3926 transitions. [2021-11-05 16:44:31,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-11-05 16:44:31,045 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:44:31,045 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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-05 16:44:31,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-05 16:44:31,046 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:44:31,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:44:31,046 INFO L85 PathProgramCache]: Analyzing trace with hash -181237521, now seen corresponding path program 1 times [2021-11-05 16:44:31,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:44:31,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981883745] [2021-11-05 16:44:31,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:31,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:44:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-05 16:44:31,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:44:31,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981883745] [2021-11-05 16:44:31,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981883745] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:44:31,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:44:31,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 16:44:31,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970153783] [2021-11-05 16:44:31,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:44:31,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:44:31,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:44:31,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:44:31,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:44:31,473 INFO L87 Difference]: Start difference. First operand 2639 states and 3926 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 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-05 16:44:31,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:44:31,615 INFO L93 Difference]: Finished difference Result 5270 states and 7843 transitions. [2021-11-05 16:44:31,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:44:31,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 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 177 [2021-11-05 16:44:31,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:44:31,620 INFO L225 Difference]: With dead ends: 5270 [2021-11-05 16:44:31,620 INFO L226 Difference]: Without dead ends: 2640 [2021-11-05 16:44:31,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.28ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 16:44:31,624 INFO L933 BasicCegarLoop]: 1072 mSDtfsCounter, 0 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2142 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.30ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.54ms IncrementalHoareTripleChecker+Time [2021-11-05 16:44:31,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2142 Invalid, 3 Unknown, 0 Unchecked, 1.30ms Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 9.54ms Time] [2021-11-05 16:44:31,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2021-11-05 16:44:31,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2640. [2021-11-05 16:44:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2640 states, 2639 states have (on average 1.4880636604774535) internal successors, (3927), 2639 states have internal predecessors, (3927), 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-05 16:44:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3927 transitions. [2021-11-05 16:44:31,753 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3927 transitions. Word has length 177 [2021-11-05 16:44:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:44:31,753 INFO L470 AbstractCegarLoop]: Abstraction has 2640 states and 3927 transitions. [2021-11-05 16:44:31,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 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-05 16:44:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3927 transitions. [2021-11-05 16:44:31,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-05 16:44:31,757 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:44:31,757 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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] [2021-11-05 16:44:31,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-05 16:44:31,757 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:44:31,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:44:31,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1457598882, now seen corresponding path program 1 times [2021-11-05 16:44:31,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:44:31,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189687251] [2021-11-05 16:44:31,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:31,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:44:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-05 16:44:32,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:44:32,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189687251] [2021-11-05 16:44:32,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189687251] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:44:32,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599236675] [2021-11-05 16:44:32,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:32,396 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:44:32,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:44:32,400 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 16:44:32,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-05 16:44:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:33,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 3576 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-05 16:44:33,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:44:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-05 16:44:33,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 16:44:33,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599236675] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:44:33,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-05 16:44:33,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2021-11-05 16:44:33,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294649007] [2021-11-05 16:44:33,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:44:33,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 16:44:33,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:44:33,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 16:44:33,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-05 16:44:33,805 INFO L87 Difference]: Start difference. First operand 2640 states and 3927 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-05 16:44:35,848 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-05 16:44:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:44:36,487 INFO L93 Difference]: Finished difference Result 7970 states and 11863 transitions. [2021-11-05 16:44:36,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 16:44:36,487 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 178 [2021-11-05 16:44:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:44:36,493 INFO L225 Difference]: With dead ends: 7970 [2021-11-05 16:44:36,493 INFO L226 Difference]: Without dead ends: 5434 [2021-11-05 16:44:36,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 225.43ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-05 16:44:36,496 INFO L933 BasicCegarLoop]: 1801 mSDtfsCounter, 2827 mSDsluCounter, 4662 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2115.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2827 SdHoareTripleChecker+Valid, 6463 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.63ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2241.65ms IncrementalHoareTripleChecker+Time [2021-11-05 16:44:36,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2827 Valid, 6463 Invalid, 26 Unknown, 0 Unchecked, 5.63ms Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 1 Unknown, 0 Unchecked, 2241.65ms Time] [2021-11-05 16:44:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5434 states. [2021-11-05 16:44:36,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5434 to 2640. [2021-11-05 16:44:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2640 states, 2639 states have (on average 1.4880636604774535) internal successors, (3927), 2639 states have internal predecessors, (3927), 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-05 16:44:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3927 transitions. [2021-11-05 16:44:36,652 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3927 transitions. Word has length 178 [2021-11-05 16:44:36,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:44:36,653 INFO L470 AbstractCegarLoop]: Abstraction has 2640 states and 3927 transitions. [2021-11-05 16:44:36,653 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-05 16:44:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3927 transitions. [2021-11-05 16:44:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-11-05 16:44:36,656 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:44:36,656 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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-05 16:44:36,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-05 16:44:36,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:44:36,877 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:44:36,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:44:36,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1246300446, now seen corresponding path program 1 times [2021-11-05 16:44:36,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:44:36,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032178052] [2021-11-05 16:44:36,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:36,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:44:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:44:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-05 16:44:37,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:44:37,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032178052] [2021-11-05 16:44:37,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032178052] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:44:37,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164489977] [2021-11-05 16:44:37,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:44:37,399 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:44:37,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:44:37,400 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 16:44:37,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-05 16:46:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:46:42,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 3602 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-05 16:46:42,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:46:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-05 16:46:43,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-05 16:46:43,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164489977] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:46:43,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-05 16:46:43,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-11-05 16:46:43,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081476188] [2021-11-05 16:46:43,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:46:43,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 16:46:43,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:46:43,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 16:46:43,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:46:43,284 INFO L87 Difference]: Start difference. First operand 2640 states and 3927 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-05 16:46:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:46:43,457 INFO L93 Difference]: Finished difference Result 5287 states and 7865 transitions. [2021-11-05 16:46:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 16:46:43,458 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 180 [2021-11-05 16:46:43,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:46:43,462 INFO L225 Difference]: With dead ends: 5287 [2021-11-05 16:46:43,462 INFO L226 Difference]: Without dead ends: 2751 [2021-11-05 16:46:43,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 85.53ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-05 16:46:43,469 INFO L933 BasicCegarLoop]: 1230 mSDtfsCounter, 1044 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.64ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.89ms IncrementalHoareTripleChecker+Time [2021-11-05 16:46:43,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1044 Valid, 1415 Invalid, 1 Unknown, 0 Unchecked, 1.64ms Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 3.89ms Time] [2021-11-05 16:46:43,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2021-11-05 16:46:43,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 2640. [2021-11-05 16:46:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2640 states, 2639 states have (on average 1.486926866237211) internal successors, (3924), 2639 states have internal predecessors, (3924), 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-05 16:46:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3924 transitions. [2021-11-05 16:46:43,633 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3924 transitions. Word has length 180 [2021-11-05 16:46:43,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:46:43,634 INFO L470 AbstractCegarLoop]: Abstraction has 2640 states and 3924 transitions. [2021-11-05 16:46:43,634 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-05 16:46:43,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3924 transitions. [2021-11-05 16:46:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-11-05 16:46:43,637 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:46:43,638 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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] [2021-11-05 16:46:43,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-05 16:46:43,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-05 16:46:43,852 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:46:43,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:46:43,852 INFO L85 PathProgramCache]: Analyzing trace with hash 70249393, now seen corresponding path program 1 times [2021-11-05 16:46:43,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:46:43,852 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482891364] [2021-11-05 16:46:43,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:46:43,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:46:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:46:44,360 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-05 16:46:44,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:46:44,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482891364] [2021-11-05 16:46:44,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482891364] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:46:44,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941312051] [2021-11-05 16:46:44,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:46:44,361 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:46:44,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:46:44,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 16:46:44,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-05 16:48:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:48:26,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 3625 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-05 16:48:26,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:48:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-05 16:48:27,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:48:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-05 16:48:27,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941312051] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 16:48:27,870 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 16:48:27,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-05 16:48:27,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415836797] [2021-11-05 16:48:27,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 16:48:27,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 16:48:27,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:48:27,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 16:48:27,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-05 16:48:27,871 INFO L87 Difference]: Start difference. First operand 2640 states and 3924 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 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-05 16:48:28,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:48:28,167 INFO L93 Difference]: Finished difference Result 5273 states and 7842 transitions. [2021-11-05 16:48:28,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 16:48:28,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 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-05 16:48:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:48:28,173 INFO L225 Difference]: With dead ends: 5273 [2021-11-05 16:48:28,173 INFO L226 Difference]: Without dead ends: 2643 [2021-11-05 16:48:28,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 193.95ms TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2021-11-05 16:48:28,178 INFO L933 BasicCegarLoop]: 1071 mSDtfsCounter, 1061 mSDsluCounter, 3215 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 4286 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.68ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.94ms IncrementalHoareTripleChecker+Time [2021-11-05 16:48:28,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1061 Valid, 4286 Invalid, 15 Unknown, 0 Unchecked, 3.68ms Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 38.94ms Time] [2021-11-05 16:48:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2021-11-05 16:48:28,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 2643. [2021-11-05 16:48:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2643 states, 2642 states have (on average 1.4863739591218774) internal successors, (3927), 2642 states have internal predecessors, (3927), 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-05 16:48:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 3927 transitions. [2021-11-05 16:48:28,371 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 3927 transitions. Word has length 181 [2021-11-05 16:48:28,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:48:28,371 INFO L470 AbstractCegarLoop]: Abstraction has 2643 states and 3927 transitions. [2021-11-05 16:48:28,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 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-05 16:48:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3927 transitions. [2021-11-05 16:48:28,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-05 16:48:28,376 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:48:28,376 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-05 16:48:28,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-05 16:48:28,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:48:28,592 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:48:28,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:48:28,592 INFO L85 PathProgramCache]: Analyzing trace with hash 547807168, now seen corresponding path program 2 times [2021-11-05 16:48:28,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:48:28,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475075973] [2021-11-05 16:48:28,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:48:28,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:48:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:48:33,797 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-05 16:48:33,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:48:33,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475075973] [2021-11-05 16:48:33,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475075973] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 16:48:33,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 16:48:33,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-05 16:48:33,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745053954] [2021-11-05 16:48:33,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 16:48:33,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-05 16:48:33,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 16:48:33,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-05 16:48:33,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-05 16:48:33,800 INFO L87 Difference]: Start difference. First operand 2643 states and 3927 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-05 16:48:35,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 16:48:35,717 INFO L93 Difference]: Finished difference Result 8644 states and 12873 transitions. [2021-11-05 16:48:35,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-05 16:48:35,718 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-05 16:48:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 16:48:35,730 INFO L225 Difference]: With dead ends: 8644 [2021-11-05 16:48:35,730 INFO L226 Difference]: Without dead ends: 6108 [2021-11-05 16:48:35,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 899.96ms TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-05 16:48:35,737 INFO L933 BasicCegarLoop]: 2922 mSDtfsCounter, 8234 mSDsluCounter, 10750 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 811.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8234 SdHoareTripleChecker+Valid, 13672 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.22ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 875.19ms IncrementalHoareTripleChecker+Time [2021-11-05 16:48:35,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8234 Valid, 13672 Invalid, 228 Unknown, 0 Unchecked, 15.22ms Time], IncrementalHoareTripleChecker [19 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 875.19ms Time] [2021-11-05 16:48:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6108 states. [2021-11-05 16:48:35,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6108 to 2655. [2021-11-05 16:48:35,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2654 states have (on average 1.4826676714393368) internal successors, (3935), 2654 states have internal predecessors, (3935), 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-05 16:48:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 3935 transitions. [2021-11-05 16:48:35,980 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 3935 transitions. Word has length 184 [2021-11-05 16:48:35,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 16:48:35,981 INFO L470 AbstractCegarLoop]: Abstraction has 2655 states and 3935 transitions. [2021-11-05 16:48:35,981 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-05 16:48:35,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3935 transitions. [2021-11-05 16:48:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-05 16:48:35,985 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 16:48:35,985 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-05 16:48:35,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-05 16:48:35,986 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-05 16:48:35,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 16:48:35,987 INFO L85 PathProgramCache]: Analyzing trace with hash 769204907, now seen corresponding path program 1 times [2021-11-05 16:48:35,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 16:48:35,987 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461840922] [2021-11-05 16:48:35,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:48:35,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 16:48:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:48:54,978 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-05 16:48:54,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 16:48:54,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461840922] [2021-11-05 16:48:54,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461840922] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 16:48:54,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650507566] [2021-11-05 16:48:54,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 16:48:54,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 16:48:54,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 16:48:54,980 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 16:48:54,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-05 16:51:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 16:51:10,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 3762 conjuncts, 301 conjunts are in the unsatisfiable core [2021-11-05 16:51:10,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 16:51:12,583 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-05 16:51:15,055 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-05 16:51:15,055 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-05 16:51:16,107 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-05 16:51:16,688 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-11-05 16:51:16,689 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-05 16:51:17,614 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-05 16:51:17,615 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-05 16:51:17,988 INFO L354 Elim1Store]: treesize reduction 94, result has 29.9 percent of original size [2021-11-05 16:51:17,989 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-05 16:51:19,415 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-05 16:51:19,415 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-05 16:51:20,109 INFO L354 Elim1Store]: treesize reduction 68, result has 25.3 percent of original size [2021-11-05 16:51:20,109 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-05 16:51:22,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:51:22,607 INFO L354 Elim1Store]: treesize reduction 470, result has 10.3 percent of original size [2021-11-05 16:51:22,608 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-05 16:51:22,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 16:51:22,967 INFO L354 Elim1Store]: treesize reduction 844, result has 7.4 percent of original size [2021-11-05 16:51:22,967 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-05 16:51:24,239 INFO L354 Elim1Store]: treesize reduction 298, result has 17.2 percent of original size [2021-11-05 16:51:24,239 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-05 16:51:24,447 INFO L354 Elim1Store]: treesize reduction 400, result has 12.9 percent of original size [2021-11-05 16:51:24,447 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-05 16:51:39,540 INFO L354 Elim1Store]: treesize reduction 474, result has 17.4 percent of original size [2021-11-05 16:51:39,541 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 453 treesize of output 232 [2021-11-05 16:51:39,923 INFO L354 Elim1Store]: treesize reduction 236, result has 24.6 percent of original size [2021-11-05 16:51:39,923 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 402 treesize of output 316 [2021-11-05 16:51:43,906 INFO L354 Elim1Store]: treesize reduction 236, result has 13.2 percent of original size [2021-11-05 16:51:43,907 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 458 [2021-11-05 16:51:44,107 INFO L354 Elim1Store]: treesize reduction 344, result has 12.0 percent of original size [2021-11-05 16:51:44,108 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 271 [2021-11-05 16:51:47,598 INFO L354 Elim1Store]: treesize reduction 1076, result has 6.4 percent of original size [2021-11-05 16:51:47,599 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 412 [2021-11-05 16:51:48,723 INFO L354 Elim1Store]: treesize reduction 816, result has 8.0 percent of original size [2021-11-05 16:51:48,724 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 892 treesize of output 385 [2021-11-05 16:51:49,709 INFO L354 Elim1Store]: treesize reduction 768, result has 8.5 percent of original size [2021-11-05 16:51:49,709 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 850 treesize of output 361 [2021-11-05 16:51:50,676 INFO L354 Elim1Store]: treesize reduction 3540, result has 3.3 percent of original size [2021-11-05 16:51:50,677 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 25 case distinctions, treesize of input 756 treesize of output 526 [2021-11-05 16:51:51,614 INFO L354 Elim1Store]: treesize reduction 632, result has 9.7 percent of original size [2021-11-05 16:51:51,615 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 363 [2021-11-05 16:51:51,834 INFO L354 Elim1Store]: treesize reduction 584, result has 9.9 percent of original size [2021-11-05 16:51:51,835 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 713 [2021-11-05 16:52:05,247 INFO L354 Elim1Store]: treesize reduction 561, result has 1.2 percent of original size [2021-11-05 16:52:05,247 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 235 [2021-11-05 16:52:05,366 INFO L354 Elim1Store]: treesize reduction 269, result has 2.5 percent of original size [2021-11-05 16:52:05,366 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 205 treesize of output 157 [2021-11-05 16:52:05,907 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-05 16:52:05,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 16:52:13,912 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_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_DerPreprocessor_8 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7 Int)) (< 0 (mod (let ((.cse9 (+ 12 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.offset))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse9)) (.cse11 (+ 64 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse12 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 80)) (.cse13 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 96)) (.cse14 (+ 128 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse15 (+ 176 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse16 (+ 168 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse10 (store (store (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7) .cse12 v_DerPreprocessor_8) .cse13 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse14 v_DerPreprocessor_7) .cse15 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7))) (.cse5 (store |c_#memory_$Pointer$.base| .cse10 (store (store (store (store (store (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7) .cse12 v_DerPreprocessor_6) .cse13 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse14 v_DerPreprocessor_5) .cse15 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7) .cse16 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 ((.cse3 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_3))) (.cse0 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_4))) (.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-05 16:52:16,082 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_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_DerPreprocessor_8 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_8) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse15 v_DerPreprocessor_7) .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_6) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse15 v_DerPreprocessor_5) .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_3))) (.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_4))) (.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-05 16:52:18,847 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) (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_DerPreprocessor_8 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 (+ (* c_~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_8) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse15 v_DerPreprocessor_7) .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_6) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse15 v_DerPreprocessor_5) .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 (+ (select (select .cse8 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse9) 92))) (let ((.cse0 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_3))) (.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_4))) (.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-05 16:52:22,931 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) (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_DerPreprocessor_8 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 (+ (* c_~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_8) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse15 v_DerPreprocessor_7) .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_6) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse15 v_DerPreprocessor_5) .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_3))) (.cse0 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_4))) (.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-05 16:52:25,622 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) (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_DerPreprocessor_8 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 (+ (* c_~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_8) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse15 v_DerPreprocessor_7) .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_6) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse15 v_DerPreprocessor_5) .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 (+ 92 (select (select .cse8 |c_ULTIMATE.start_usb_get_intfdata_#res.base|) .cse9)))) (let ((.cse3 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_3))) (.cse0 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_4))) (.cse4 (+ 533 c_~if_usb_driver_group1~0.offset))) (let ((.cse1 (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ 28 (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4)))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2)))))))))) 18446744073709551616))) is different from false [2021-11-05 16:52:28,065 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) (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_DerPreprocessor_8 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 (+ (* c_~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_8) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse15 v_DerPreprocessor_7) .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_6) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse15 v_DerPreprocessor_5) .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 ((.cse0 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_3))) (.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_4))) (.cse4 (+ 533 c_~if_usb_driver_group1~0.offset))) (let ((.cse1 (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ 28 (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4)))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2)))))))))) 18446744073709551616))) is different from false [2021-11-05 16:52:30,432 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) (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_DerPreprocessor_8 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 (+ (* c_~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_8) .cse15 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse16 v_DerPreprocessor_7) .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_6) .cse15 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse16 v_DerPreprocessor_5) .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_3))) (.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_4)))) (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-05 16:52:41,650 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) (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_DerPreprocessor_8 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 (+ (* c_~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_8) .cse15 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse16 v_DerPreprocessor_7) .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_6) .cse15 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse16 v_DerPreprocessor_5) .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 ((.cse3 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_3))) (.cse0 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_4)))) (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