./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4d014703 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.0/usb_urb-drivers-net-usb-catc.ko.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 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 14:28:33,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 14:28:33,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 14:28:33,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 14:28:33,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 14:28:33,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 14:28:33,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 14:28:33,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 14:28:33,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 14:28:33,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 14:28:33,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 14:28:33,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 14:28:33,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 14:28:33,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 14:28:33,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 14:28:33,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 14:28:33,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 14:28:33,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 14:28:33,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 14:28:33,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 14:28:33,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 14:28:33,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 14:28:33,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 14:28:33,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 14:28:33,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 14:28:33,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 14:28:33,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 14:28:33,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 14:28:33,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 14:28:33,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 14:28:33,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 14:28:33,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 14:28:33,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 14:28:33,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 14:28:33,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 14:28:33,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 14:28:33,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 14:28:33,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 14:28:33,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 14:28:33,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 14:28:33,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 14:28:33,289 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-02 14:28:33,309 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 14:28:33,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 14:28:33,312 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 14:28:33,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 14:28:33,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 14:28:33,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 14:28:33,314 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 14:28:33,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 14:28:33,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 14:28:33,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 14:28:33,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 14:28:33,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 14:28:33,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 14:28:33,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 14:28:33,315 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 14:28:33,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 14:28:33,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 14:28:33,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 14:28:33,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 14:28:33,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 14:28:33,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 14:28:33,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 14:28:33,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 14:28:33,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 14:28:33,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 14:28:33,317 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 14:28:33,318 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 14:28:33,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 14:28:33,318 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 14:28:33,318 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 -> 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c [2021-11-02 14:28:33,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 14:28:33,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 14:28:33,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 14:28:33,498 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 14:28:33,499 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 14:28:33,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-02 14:28:33,540 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fefa25580/ba494da3af5244e1b35ec13b5e8d9f89/FLAGc9eeffaa1 [2021-11-02 14:28:34,091 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 14:28:34,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-02 14:28:34,120 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fefa25580/ba494da3af5244e1b35ec13b5e8d9f89/FLAGc9eeffaa1 [2021-11-02 14:28:34,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fefa25580/ba494da3af5244e1b35ec13b5e8d9f89 [2021-11-02 14:28:34,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 14:28:34,294 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 14:28:34,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 14:28:34,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 14:28:34,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 14:28:34,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 02:28:34" (1/1) ... [2021-11-02 14:28:34,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c67ab50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:34, skipping insertion in model container [2021-11-02 14:28:34,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 02:28:34" (1/1) ... [2021-11-02 14:28:34,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 14:28:34,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 14:28:35,115 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.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2021-11-02 14:28:35,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 14:28:35,182 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 14:28:35,356 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.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2021-11-02 14:28:35,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 14:28:35,601 INFO L208 MainTranslator]: Completed translation [2021-11-02 14:28:35,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:35 WrapperNode [2021-11-02 14:28:35,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 14:28:35,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 14:28:35,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 14:28:35,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 14:28:35,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:35" (1/1) ... [2021-11-02 14:28:35,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:35" (1/1) ... [2021-11-02 14:28:35,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 14:28:35,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 14:28:35,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 14:28:35,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 14:28:35,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:35" (1/1) ... [2021-11-02 14:28:35,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:35" (1/1) ... [2021-11-02 14:28:35,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:35" (1/1) ... [2021-11-02 14:28:35,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:35" (1/1) ... [2021-11-02 14:28:35,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:35" (1/1) ... [2021-11-02 14:28:35,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:35" (1/1) ... [2021-11-02 14:28:35,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:35" (1/1) ... [2021-11-02 14:28:35,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 14:28:35,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 14:28:35,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 14:28:35,923 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 14:28:35,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:35" (1/1) ... [2021-11-02 14:28:35,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 14:28:35,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 14:28:35,952 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-02 14:28:35,959 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-02 14:28:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-02 14:28:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-02 14:28:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-02 14:28:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 14:28:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 14:28:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 14:28:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 14:28:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 14:28:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 14:28:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 14:28:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 14:28:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 14:28:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-02 14:28:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-11-02 14:28:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 14:28:35,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 14:28:36,288 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-02 14:28:36,328 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-02 14:28:37,192 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##522: assume !false; [2021-11-02 14:28:37,192 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##521: assume false; [2021-11-02 14:28:37,192 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##41: assume !false; [2021-11-02 14:28:37,192 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume false; [2021-11-02 14:28:37,203 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 14:28:37,204 INFO L299 CfgBuilder]: Removed 647 assume(true) statements. [2021-11-02 14:28:37,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 02:28:37 BoogieIcfgContainer [2021-11-02 14:28:37,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 14:28:37,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 14:28:37,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 14:28:37,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 14:28:37,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 02:28:34" (1/3) ... [2021-11-02 14:28:37,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6691c014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 02:28:37, skipping insertion in model container [2021-11-02 14:28:37,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:28:35" (2/3) ... [2021-11-02 14:28:37,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6691c014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 02:28:37, skipping insertion in model container [2021-11-02 14:28:37,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 02:28:37" (3/3) ... [2021-11-02 14:28:37,213 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-02 14:28:37,218 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 14:28:37,219 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-11-02 14:28:37,263 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 14:28:37,269 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-02 14:28:37,269 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-11-02 14:28:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 689 states, 674 states have (on average 1.4940652818991098) internal successors, (1007), 688 states have internal predecessors, (1007), 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-02 14:28:37,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-02 14:28:37,295 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:28:37,296 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:28:37,296 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:28:37,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:28:37,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1802578412, now seen corresponding path program 1 times [2021-11-02 14:28:37,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:28:37,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668992135] [2021-11-02 14:28:37,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:28:37,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:28:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:28:37,660 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-02 14:28:37,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:28:37,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668992135] [2021-11-02 14:28:37,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668992135] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:28:37,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:28:37,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 14:28:37,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243196200] [2021-11-02 14:28:37,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:28:37,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:28:37,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:28:37,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:28:37,690 INFO L87 Difference]: Start difference. First operand has 689 states, 674 states have (on average 1.4940652818991098) internal successors, (1007), 688 states have internal predecessors, (1007), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-02 14:28:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:28:40,884 INFO L93 Difference]: Finished difference Result 2020 states and 2970 transitions. [2021-11-02 14:28:40,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:28:40,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2021-11-02 14:28:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:28:40,906 INFO L225 Difference]: With dead ends: 2020 [2021-11-02 14:28:40,906 INFO L226 Difference]: Without dead ends: 1312 [2021-11-02 14:28:40,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.49ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:28:40,914 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 836 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2714.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.57ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3084.72ms IncrementalHoareTripleChecker+Time [2021-11-02 14:28:40,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [836 Valid, 24 Invalid, 1721 Unknown, 0 Unchecked, 8.57ms Time], IncrementalHoareTripleChecker [13 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 3084.72ms Time] [2021-11-02 14:28:40,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2021-11-02 14:28:40,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1288. [2021-11-02 14:28:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1274 states have (on average 1.2896389324960753) internal successors, (1643), 1287 states have internal predecessors, (1643), 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-02 14:28:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1643 transitions. [2021-11-02 14:28:41,010 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1643 transitions. Word has length 11 [2021-11-02 14:28:41,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:28:41,011 INFO L470 AbstractCegarLoop]: Abstraction has 1288 states and 1643 transitions. [2021-11-02 14:28:41,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-02 14:28:41,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1643 transitions. [2021-11-02 14:28:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-02 14:28:41,012 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:28:41,013 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:28:41,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 14:28:41,014 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:28:41,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:28:41,014 INFO L85 PathProgramCache]: Analyzing trace with hash 45356904, now seen corresponding path program 1 times [2021-11-02 14:28:41,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:28:41,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30603435] [2021-11-02 14:28:41,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:28:41,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:28:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:28:41,107 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-02 14:28:41,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:28:41,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30603435] [2021-11-02 14:28:41,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30603435] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:28:41,109 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:28:41,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 14:28:41,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553082595] [2021-11-02 14:28:41,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:28:41,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:28:41,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:28:41,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:28:41,111 INFO L87 Difference]: Start difference. First operand 1288 states and 1643 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-02 14:28:42,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:28:42,796 INFO L93 Difference]: Finished difference Result 1288 states and 1643 transitions. [2021-11-02 14:28:42,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:28:42,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2021-11-02 14:28:42,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:28:42,801 INFO L225 Difference]: With dead ends: 1288 [2021-11-02 14:28:42,801 INFO L226 Difference]: Without dead ends: 1283 [2021-11-02 14:28:42,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.30ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:28:42,806 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 835 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1464.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.94ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1640.20ms IncrementalHoareTripleChecker+Time [2021-11-02 14:28:42,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [835 Valid, 0 Invalid, 845 Unknown, 0 Unchecked, 1.94ms Time], IncrementalHoareTripleChecker [0 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1640.20ms Time] [2021-11-02 14:28:42,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2021-11-02 14:28:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2021-11-02 14:28:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1270 states have (on average 1.2858267716535432) internal successors, (1633), 1282 states have internal predecessors, (1633), 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-02 14:28:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1633 transitions. [2021-11-02 14:28:42,851 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1633 transitions. Word has length 12 [2021-11-02 14:28:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:28:42,853 INFO L470 AbstractCegarLoop]: Abstraction has 1283 states and 1633 transitions. [2021-11-02 14:28:42,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-02 14:28:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1633 transitions. [2021-11-02 14:28:42,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-02 14:28:42,856 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:28:42,856 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:28:42,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 14:28:42,857 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:28:42,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:28:42,862 INFO L85 PathProgramCache]: Analyzing trace with hash -965110428, now seen corresponding path program 1 times [2021-11-02 14:28:42,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:28:42,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834313931] [2021-11-02 14:28:42,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:28:42,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:28:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:28:42,966 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-02 14:28:42,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:28:42,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834313931] [2021-11-02 14:28:42,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834313931] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:28:42,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:28:42,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:28:42,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539534244] [2021-11-02 14:28:42,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:28:42,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:28:42,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:28:42,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:28:42,969 INFO L87 Difference]: Start difference. First operand 1283 states and 1633 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02 14:28:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:28:45,812 INFO L93 Difference]: Finished difference Result 3119 states and 4010 transitions. [2021-11-02 14:28:45,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:28:45,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2021-11-02 14:28:45,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:28:45,817 INFO L225 Difference]: With dead ends: 3119 [2021-11-02 14:28:45,817 INFO L226 Difference]: Without dead ends: 1844 [2021-11-02 14:28:45,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.52ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:28:45,825 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 768 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2513.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.93ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2764.97ms IncrementalHoareTripleChecker+Time [2021-11-02 14:28:45,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [768 Valid, 0 Invalid, 1285 Unknown, 0 Unchecked, 2.93ms Time], IncrementalHoareTripleChecker [5 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 2764.97ms Time] [2021-11-02 14:28:45,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2021-11-02 14:28:45,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1840. [2021-11-02 14:28:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1827 states have (on average 1.30103995621237) internal successors, (2377), 1839 states have internal predecessors, (2377), 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-02 14:28:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2377 transitions. [2021-11-02 14:28:45,862 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2377 transitions. Word has length 35 [2021-11-02 14:28:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:28:45,863 INFO L470 AbstractCegarLoop]: Abstraction has 1840 states and 2377 transitions. [2021-11-02 14:28:45,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02 14:28:45,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2377 transitions. [2021-11-02 14:28:45,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-02 14:28:45,870 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:28:45,870 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:28:45,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 14:28:45,871 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:28:45,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:28:45,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2056089327, now seen corresponding path program 1 times [2021-11-02 14:28:45,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:28:45,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435049584] [2021-11-02 14:28:45,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:28:45,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:28:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:28:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:28:45,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:28:45,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435049584] [2021-11-02 14:28:45,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435049584] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:28:45,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:28:45,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 14:28:45,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728261644] [2021-11-02 14:28:45,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:28:45,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:28:45,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:28:45,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:28:45,998 INFO L87 Difference]: Start difference. First operand 1840 states and 2377 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-02 14:28:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:28:50,328 INFO L93 Difference]: Finished difference Result 3679 states and 4752 transitions. [2021-11-02 14:28:50,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:28:50,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2021-11-02 14:28:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:28:50,334 INFO L225 Difference]: With dead ends: 3679 [2021-11-02 14:28:50,334 INFO L226 Difference]: Without dead ends: 1842 [2021-11-02 14:28:50,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.80ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:28:50,342 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 2525 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3908.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.93ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4253.95ms IncrementalHoareTripleChecker+Time [2021-11-02 14:28:50,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 2528 Unknown, 0 Unchecked, 5.93ms Time], IncrementalHoareTripleChecker [3 Valid, 2525 Invalid, 0 Unknown, 0 Unchecked, 4253.95ms Time] [2021-11-02 14:28:50,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2021-11-02 14:28:50,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1838. [2021-11-02 14:28:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1825 states have (on average 1.2991780821917809) internal successors, (2371), 1837 states have internal predecessors, (2371), 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-02 14:28:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2371 transitions. [2021-11-02 14:28:50,373 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2371 transitions. Word has length 53 [2021-11-02 14:28:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:28:50,374 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2371 transitions. [2021-11-02 14:28:50,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-02 14:28:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2371 transitions. [2021-11-02 14:28:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-02 14:28:50,375 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:28:50,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 14:28:50,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 14:28:50,375 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:28:50,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:28:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1050619864, now seen corresponding path program 1 times [2021-11-02 14:28:50,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:28:50,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816149987] [2021-11-02 14:28:50,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:28:50,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:28:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:28:50,511 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-02 14:28:50,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:28:50,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816149987] [2021-11-02 14:28:50,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816149987] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:28:50,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:28:50,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:28:50,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819891780] [2021-11-02 14:28:50,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:28:50,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:28:50,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:28:50,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:28:50,513 INFO L87 Difference]: Start difference. First operand 1838 states and 2371 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-02 14:28:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:28:58,574 INFO L93 Difference]: Finished difference Result 5464 states and 7047 transitions. [2021-11-02 14:28:58,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 14:28:58,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2021-11-02 14:28:58,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:28:58,584 INFO L225 Difference]: With dead ends: 5464 [2021-11-02 14:28:58,584 INFO L226 Difference]: Without dead ends: 3632 [2021-11-02 14:28:58,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.34ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:28:58,587 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 817 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 4522 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7299.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.55ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7916.90ms IncrementalHoareTripleChecker+Time [2021-11-02 14:28:58,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [817 Valid, 0 Invalid, 4528 Unknown, 0 Unchecked, 9.55ms Time], IncrementalHoareTripleChecker [6 Valid, 4522 Invalid, 0 Unknown, 0 Unchecked, 7916.90ms Time] [2021-11-02 14:28:58,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3632 states. [2021-11-02 14:28:58,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 1841. [2021-11-02 14:28:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1828 states have (on average 1.298140043763676) internal successors, (2373), 1840 states have internal predecessors, (2373), 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-02 14:28:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2373 transitions. [2021-11-02 14:28:58,632 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2373 transitions. Word has length 78 [2021-11-02 14:28:58,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:28:58,632 INFO L470 AbstractCegarLoop]: Abstraction has 1841 states and 2373 transitions. [2021-11-02 14:28:58,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-02 14:28:58,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2373 transitions. [2021-11-02 14:28:58,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-02 14:28:58,633 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:28:58,633 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 14:28:58,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 14:28:58,633 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:28:58,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:28:58,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1494520538, now seen corresponding path program 1 times [2021-11-02 14:28:58,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:28:58,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456137324] [2021-11-02 14:28:58,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:28:58,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:28:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:28:58,744 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-02 14:28:58,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:28:58,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456137324] [2021-11-02 14:28:58,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456137324] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:28:58,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:28:58,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:28:58,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027576127] [2021-11-02 14:28:58,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:28:58,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:28:58,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:28:58,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:28:58,747 INFO L87 Difference]: Start difference. First operand 1841 states and 2373 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-02 14:29:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:29:08,786 INFO L93 Difference]: Finished difference Result 5587 states and 7218 transitions. [2021-11-02 14:29:08,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 14:29:08,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2021-11-02 14:29:08,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:29:08,797 INFO L225 Difference]: With dead ends: 5587 [2021-11-02 14:29:08,797 INFO L226 Difference]: Without dead ends: 3755 [2021-11-02 14:29:08,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 16.73ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 14:29:08,800 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3573 mSDsluCounter, 3748 mSDsCounter, 0 mSdLazyCounter, 5569 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9072.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3573 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.98ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 5569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9865.10ms IncrementalHoareTripleChecker+Time [2021-11-02 14:29:08,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3573 Valid, 0 Invalid, 5583 Unknown, 0 Unchecked, 14.98ms Time], IncrementalHoareTripleChecker [14 Valid, 5569 Invalid, 0 Unknown, 0 Unchecked, 9865.10ms Time] [2021-11-02 14:29:08,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2021-11-02 14:29:08,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 1853. [2021-11-02 14:29:08,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1840 states have (on average 1.296195652173913) internal successors, (2385), 1852 states have internal predecessors, (2385), 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-02 14:29:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2385 transitions. [2021-11-02 14:29:08,853 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2385 transitions. Word has length 78 [2021-11-02 14:29:08,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:29:08,853 INFO L470 AbstractCegarLoop]: Abstraction has 1853 states and 2385 transitions. [2021-11-02 14:29:08,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-02 14:29:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2385 transitions. [2021-11-02 14:29:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-02 14:29:08,855 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:29:08,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 14:29:08,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 14:29:08,855 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:29:08,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:29:08,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1517152792, now seen corresponding path program 1 times [2021-11-02 14:29:08,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:29:08,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873648690] [2021-11-02 14:29:08,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:29:08,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:29:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:29:08,959 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-02 14:29:08,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:29:08,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873648690] [2021-11-02 14:29:08,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873648690] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:29:08,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:29:08,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:29:08,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650450140] [2021-11-02 14:29:08,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:29:08,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:29:08,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:29:08,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:29:08,961 INFO L87 Difference]: Start difference. First operand 1853 states and 2385 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-02 14:29:18,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:29:18,110 INFO L93 Difference]: Finished difference Result 3616 states and 4663 transitions. [2021-11-02 14:29:18,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 14:29:18,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2021-11-02 14:29:18,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:29:18,119 INFO L225 Difference]: With dead ends: 3616 [2021-11-02 14:29:18,119 INFO L226 Difference]: Without dead ends: 3554 [2021-11-02 14:29:18,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 23.36ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:29:18,121 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 725 mSDsluCounter, 3059 mSDsCounter, 0 mSdLazyCounter, 5510 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8294.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.76ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 5510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9000.07ms IncrementalHoareTripleChecker+Time [2021-11-02 14:29:18,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [725 Valid, 0 Invalid, 5525 Unknown, 0 Unchecked, 9.76ms Time], IncrementalHoareTripleChecker [15 Valid, 5510 Invalid, 0 Unknown, 0 Unchecked, 9000.07ms Time] [2021-11-02 14:29:18,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2021-11-02 14:29:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 1853. [2021-11-02 14:29:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1840 states have (on average 1.295108695652174) internal successors, (2383), 1852 states have internal predecessors, (2383), 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-02 14:29:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2383 transitions. [2021-11-02 14:29:18,191 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2383 transitions. Word has length 78 [2021-11-02 14:29:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:29:18,191 INFO L470 AbstractCegarLoop]: Abstraction has 1853 states and 2383 transitions. [2021-11-02 14:29:18,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-02 14:29:18,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2383 transitions. [2021-11-02 14:29:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-02 14:29:18,192 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:29:18,193 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 14:29:18,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 14:29:18,193 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:29:18,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:29:18,193 INFO L85 PathProgramCache]: Analyzing trace with hash 948357624, now seen corresponding path program 1 times [2021-11-02 14:29:18,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:29:18,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393728840] [2021-11-02 14:29:18,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:29:18,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:29:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:29:18,300 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-02 14:29:18,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:29:18,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393728840] [2021-11-02 14:29:18,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393728840] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:29:18,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:29:18,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:29:18,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576145234] [2021-11-02 14:29:18,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:29:18,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:29:18,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:29:18,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:29:18,303 INFO L87 Difference]: Start difference. First operand 1853 states and 2383 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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-02 14:29:23,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:29:23,415 INFO L93 Difference]: Finished difference Result 2830 states and 3618 transitions. [2021-11-02 14:29:23,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:29:23,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2021-11-02 14:29:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:29:23,422 INFO L225 Difference]: With dead ends: 2830 [2021-11-02 14:29:23,422 INFO L226 Difference]: Without dead ends: 2806 [2021-11-02 14:29:23,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.80ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:29:23,423 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1514 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 3277 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4525.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.78ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4989.99ms IncrementalHoareTripleChecker+Time [2021-11-02 14:29:23,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1514 Valid, 0 Invalid, 3307 Unknown, 0 Unchecked, 4.78ms Time], IncrementalHoareTripleChecker [30 Valid, 3277 Invalid, 0 Unknown, 0 Unchecked, 4989.99ms Time] [2021-11-02 14:29:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2021-11-02 14:29:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2756. [2021-11-02 14:29:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2756 states, 2743 states have (on average 1.2967553773240976) internal successors, (3557), 2755 states have internal predecessors, (3557), 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-02 14:29:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 3557 transitions. [2021-11-02 14:29:23,500 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 3557 transitions. Word has length 79 [2021-11-02 14:29:23,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:29:23,501 INFO L470 AbstractCegarLoop]: Abstraction has 2756 states and 3557 transitions. [2021-11-02 14:29:23,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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-02 14:29:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3557 transitions. [2021-11-02 14:29:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-02 14:29:23,505 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:29:23,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 14:29:23,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 14:29:23,506 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:29:23,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:29:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1804226248, now seen corresponding path program 1 times [2021-11-02 14:29:23,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:29:23,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297340366] [2021-11-02 14:29:23,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:29:23,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:29:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:29:23,687 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-02 14:29:23,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:29:23,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297340366] [2021-11-02 14:29:23,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297340366] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:29:23,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:29:23,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:29:23,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396488737] [2021-11-02 14:29:23,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:29:23,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:29:23,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:29:23,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:29:23,690 INFO L87 Difference]: Start difference. First operand 2756 states and 3557 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-02 14:29:32,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:29:32,008 INFO L93 Difference]: Finished difference Result 6794 states and 8773 transitions. [2021-11-02 14:29:32,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 14:29:32,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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 79 [2021-11-02 14:29:32,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:29:32,017 INFO L225 Difference]: With dead ends: 6794 [2021-11-02 14:29:32,018 INFO L226 Difference]: Without dead ends: 3952 [2021-11-02 14:29:32,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 38.61ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 14:29:32,021 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 802 mSDsluCounter, 3013 mSDsCounter, 0 mSdLazyCounter, 4618 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7500.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.50ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8120.42ms IncrementalHoareTripleChecker+Time [2021-11-02 14:29:32,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [802 Valid, 0 Invalid, 4623 Unknown, 0 Unchecked, 7.50ms Time], IncrementalHoareTripleChecker [5 Valid, 4618 Invalid, 0 Unknown, 0 Unchecked, 8120.42ms Time] [2021-11-02 14:29:32,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2021-11-02 14:29:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 2144. [2021-11-02 14:29:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 2131 states have (on average 1.302674800563116) internal successors, (2776), 2143 states have internal predecessors, (2776), 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-02 14:29:32,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 2776 transitions. [2021-11-02 14:29:32,114 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 2776 transitions. Word has length 79 [2021-11-02 14:29:32,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:29:32,115 INFO L470 AbstractCegarLoop]: Abstraction has 2144 states and 2776 transitions. [2021-11-02 14:29:32,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-02 14:29:32,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 2776 transitions. [2021-11-02 14:29:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-02 14:29:32,116 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:29:32,116 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 14:29:32,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 14:29:32,117 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:29:32,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:29:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash 559162765, now seen corresponding path program 1 times [2021-11-02 14:29:32,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:29:32,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057921758] [2021-11-02 14:29:32,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:29:32,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:29:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:29:32,218 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-02 14:29:32,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:29:32,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057921758] [2021-11-02 14:29:32,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057921758] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:29:32,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:29:32,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:29:32,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442474894] [2021-11-02 14:29:32,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:29:32,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:29:32,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:29:32,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:29:32,220 INFO L87 Difference]: Start difference. First operand 2144 states and 2776 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-02 14:29:41,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:29:41,510 INFO L93 Difference]: Finished difference Result 3914 states and 5068 transitions. [2021-11-02 14:29:41,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 14:29:41,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2021-11-02 14:29:41,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:29:41,520 INFO L225 Difference]: With dead ends: 3914 [2021-11-02 14:29:41,520 INFO L226 Difference]: Without dead ends: 3859 [2021-11-02 14:29:41,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.89ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:29:41,521 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 726 mSDsluCounter, 3049 mSDsCounter, 0 mSdLazyCounter, 5496 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8425.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.16ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 5496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9117.05ms IncrementalHoareTripleChecker+Time [2021-11-02 14:29:41,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [726 Valid, 0 Invalid, 5513 Unknown, 0 Unchecked, 8.16ms Time], IncrementalHoareTripleChecker [17 Valid, 5496 Invalid, 0 Unknown, 0 Unchecked, 9117.05ms Time] [2021-11-02 14:29:41,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3859 states. [2021-11-02 14:29:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3859 to 2149. [2021-11-02 14:29:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 2136 states have (on average 1.301498127340824) internal successors, (2780), 2148 states have internal predecessors, (2780), 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-02 14:29:41,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 2780 transitions. [2021-11-02 14:29:41,598 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 2780 transitions. Word has length 85 [2021-11-02 14:29:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:29:41,599 INFO L470 AbstractCegarLoop]: Abstraction has 2149 states and 2780 transitions. [2021-11-02 14:29:41,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-02 14:29:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2780 transitions. [2021-11-02 14:29:41,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-02 14:29:41,600 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:29:41,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 14:29:41,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 14:29:41,601 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:29:41,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:29:41,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1810418226, now seen corresponding path program 1 times [2021-11-02 14:29:41,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:29:41,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857453936] [2021-11-02 14:29:41,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:29:41,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:29:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:29:41,731 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-02 14:29:41,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:29:41,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857453936] [2021-11-02 14:29:41,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857453936] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:29:41,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:29:41,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:29:41,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117351168] [2021-11-02 14:29:41,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:29:41,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:29:41,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:29:41,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:29:41,733 INFO L87 Difference]: Start difference. First operand 2149 states and 2780 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-02 14:29:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:29:50,336 INFO L93 Difference]: Finished difference Result 5857 states and 7558 transitions. [2021-11-02 14:29:50,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 14:29:50,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2021-11-02 14:29:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:29:50,342 INFO L225 Difference]: With dead ends: 5857 [2021-11-02 14:29:50,342 INFO L226 Difference]: Without dead ends: 3975 [2021-11-02 14:29:50,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 49.89ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 14:29:50,345 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 817 mSDsluCounter, 2971 mSDsCounter, 0 mSdLazyCounter, 4547 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7761.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.81ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 4547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8391.43ms IncrementalHoareTripleChecker+Time [2021-11-02 14:29:50,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [817 Valid, 0 Invalid, 4555 Unknown, 0 Unchecked, 7.81ms Time], IncrementalHoareTripleChecker [8 Valid, 4547 Invalid, 0 Unknown, 0 Unchecked, 8391.43ms Time] [2021-11-02 14:29:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2021-11-02 14:29:50,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 2169. [2021-11-02 14:29:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2156 states have (on average 1.3000927643784788) internal successors, (2803), 2168 states have internal predecessors, (2803), 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-02 14:29:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2803 transitions. [2021-11-02 14:29:50,422 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2803 transitions. Word has length 86 [2021-11-02 14:29:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:29:50,422 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 2803 transitions. [2021-11-02 14:29:50,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-02 14:29:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2803 transitions. [2021-11-02 14:29:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-02 14:29:50,423 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:29:50,424 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 14:29:50,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 14:29:50,424 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:29:50,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:29:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1782949196, now seen corresponding path program 1 times [2021-11-02 14:29:50,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:29:50,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061096271] [2021-11-02 14:29:50,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:29:50,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:29:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:29:50,514 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-02 14:29:50,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:29:50,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061096271] [2021-11-02 14:29:50,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061096271] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:29:50,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:29:50,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:29:50,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346135786] [2021-11-02 14:29:50,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:29:50,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:29:50,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:29:50,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:29:50,516 INFO L87 Difference]: Start difference. First operand 2169 states and 2803 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-02 14:30:00,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:30:00,725 INFO L93 Difference]: Finished difference Result 7126 states and 9227 transitions. [2021-11-02 14:30:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 14:30:00,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2021-11-02 14:30:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:30:00,733 INFO L225 Difference]: With dead ends: 7126 [2021-11-02 14:30:00,733 INFO L226 Difference]: Without dead ends: 5242 [2021-11-02 14:30:00,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.75ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 14:30:00,736 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3691 mSDsluCounter, 3632 mSDsCounter, 0 mSdLazyCounter, 4930 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9160.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3691 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.65ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9902.83ms IncrementalHoareTripleChecker+Time [2021-11-02 14:30:00,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3691 Valid, 0 Invalid, 4946 Unknown, 0 Unchecked, 11.65ms Time], IncrementalHoareTripleChecker [16 Valid, 4930 Invalid, 0 Unknown, 0 Unchecked, 9902.83ms Time] [2021-11-02 14:30:00,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2021-11-02 14:30:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 2169. [2021-11-02 14:30:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2156 states have (on average 1.2954545454545454) internal successors, (2793), 2168 states have internal predecessors, (2793), 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-02 14:30:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2793 transitions. [2021-11-02 14:30:00,845 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2793 transitions. Word has length 86 [2021-11-02 14:30:00,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:30:00,845 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 2793 transitions. [2021-11-02 14:30:00,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-02 14:30:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2793 transitions. [2021-11-02 14:30:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-02 14:30:00,846 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:30:00,846 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 14:30:00,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 14:30:00,847 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:30:00,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:30:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash 268034802, now seen corresponding path program 1 times [2021-11-02 14:30:00,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:30:00,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565090771] [2021-11-02 14:30:00,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:30:00,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:30:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:30:00,952 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-02 14:30:00,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:30:00,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565090771] [2021-11-02 14:30:00,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565090771] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:30:00,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:30:00,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 14:30:00,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896968858] [2021-11-02 14:30:00,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:30:00,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:30:00,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:30:00,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:30:00,954 INFO L87 Difference]: Start difference. First operand 2169 states and 2793 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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-02 14:30:08,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:30:08,289 INFO L93 Difference]: Finished difference Result 3541 states and 4547 transitions. [2021-11-02 14:30:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 14:30:08,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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 86 [2021-11-02 14:30:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:30:08,295 INFO L225 Difference]: With dead ends: 3541 [2021-11-02 14:30:08,295 INFO L226 Difference]: Without dead ends: 3486 [2021-11-02 14:30:08,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.52ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:30:08,297 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1613 mSDsluCounter, 2787 mSDsCounter, 0 mSdLazyCounter, 4146 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6509.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.60ms SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 4146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7119.66ms IncrementalHoareTripleChecker+Time [2021-11-02 14:30:08,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1613 Valid, 0 Invalid, 4185 Unknown, 0 Unchecked, 6.60ms Time], IncrementalHoareTripleChecker [39 Valid, 4146 Invalid, 0 Unknown, 0 Unchecked, 7119.66ms Time] [2021-11-02 14:30:08,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2021-11-02 14:30:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 2214. [2021-11-02 14:30:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2214 states, 2201 states have (on average 1.2925942753293957) internal successors, (2845), 2213 states have internal predecessors, (2845), 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-02 14:30:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 2845 transitions. [2021-11-02 14:30:08,414 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 2845 transitions. Word has length 86 [2021-11-02 14:30:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:30:08,414 INFO L470 AbstractCegarLoop]: Abstraction has 2214 states and 2845 transitions. [2021-11-02 14:30:08,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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-02 14:30:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2845 transitions. [2021-11-02 14:30:08,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-02 14:30:08,416 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:30:08,416 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 14:30:08,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 14:30:08,416 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:30:08,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:30:08,417 INFO L85 PathProgramCache]: Analyzing trace with hash -642776665, now seen corresponding path program 1 times [2021-11-02 14:30:08,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:30:08,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929033477] [2021-11-02 14:30:08,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:30:08,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:30:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:30:08,503 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-02 14:30:08,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:30:08,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929033477] [2021-11-02 14:30:08,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929033477] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:30:08,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:30:08,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:30:08,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633348801] [2021-11-02 14:30:08,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:30:08,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:30:08,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:30:08,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:30:08,505 INFO L87 Difference]: Start difference. First operand 2214 states and 2845 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:30:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:30:17,862 INFO L93 Difference]: Finished difference Result 4028 states and 5175 transitions. [2021-11-02 14:30:17,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 14:30:17,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-11-02 14:30:17,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:30:17,868 INFO L225 Difference]: With dead ends: 4028 [2021-11-02 14:30:17,868 INFO L226 Difference]: Without dead ends: 3967 [2021-11-02 14:30:17,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 22.50ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:30:17,870 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 728 mSDsluCounter, 3048 mSDsCounter, 0 mSdLazyCounter, 5495 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8354.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.83ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9090.74ms IncrementalHoareTripleChecker+Time [2021-11-02 14:30:17,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [728 Valid, 0 Invalid, 5513 Unknown, 0 Unchecked, 8.83ms Time], IncrementalHoareTripleChecker [18 Valid, 5495 Invalid, 0 Unknown, 0 Unchecked, 9090.74ms Time] [2021-11-02 14:30:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3967 states. [2021-11-02 14:30:17,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 2225. [2021-11-02 14:30:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 2212 states have (on average 1.2915913200723328) internal successors, (2857), 2224 states have internal predecessors, (2857), 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-02 14:30:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 2857 transitions. [2021-11-02 14:30:17,976 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 2857 transitions. Word has length 92 [2021-11-02 14:30:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:30:17,977 INFO L470 AbstractCegarLoop]: Abstraction has 2225 states and 2857 transitions. [2021-11-02 14:30:17,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:30:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2857 transitions. [2021-11-02 14:30:17,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-02 14:30:17,978 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:30:17,979 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 14:30:17,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 14:30:17,979 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:30:17,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:30:17,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2144683865, now seen corresponding path program 1 times [2021-11-02 14:30:17,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:30:17,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933831014] [2021-11-02 14:30:17,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:30:17,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:30:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:30:18,088 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-02 14:30:18,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:30:18,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933831014] [2021-11-02 14:30:18,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933831014] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:30:18,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:30:18,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:30:18,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845094262] [2021-11-02 14:30:18,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:30:18,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:30:18,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:30:18,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:30:18,090 INFO L87 Difference]: Start difference. First operand 2225 states and 2857 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-02 14:30:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:30:26,455 INFO L93 Difference]: Finished difference Result 6090 states and 7800 transitions. [2021-11-02 14:30:26,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 14:30:26,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 93 [2021-11-02 14:30:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:30:26,463 INFO L225 Difference]: With dead ends: 6090 [2021-11-02 14:30:26,463 INFO L226 Difference]: Without dead ends: 4138 [2021-11-02 14:30:26,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 30.32ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 14:30:26,465 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 839 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 4568 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7496.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.80ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8116.84ms IncrementalHoareTripleChecker+Time [2021-11-02 14:30:26,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [839 Valid, 0 Invalid, 4575 Unknown, 0 Unchecked, 6.80ms Time], IncrementalHoareTripleChecker [7 Valid, 4568 Invalid, 0 Unknown, 0 Unchecked, 8116.84ms Time] [2021-11-02 14:30:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2021-11-02 14:30:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2236. [2021-11-02 14:30:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2223 states have (on average 1.2905982905982907) internal successors, (2869), 2235 states have internal predecessors, (2869), 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-02 14:30:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2869 transitions. [2021-11-02 14:30:26,581 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2869 transitions. Word has length 93 [2021-11-02 14:30:26,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:30:26,582 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 2869 transitions. [2021-11-02 14:30:26,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-02 14:30:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2869 transitions. [2021-11-02 14:30:26,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-02 14:30:26,583 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:30:26,583 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 14:30:26,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 14:30:26,584 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:30:26,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:30:26,586 INFO L85 PathProgramCache]: Analyzing trace with hash 607900007, now seen corresponding path program 1 times [2021-11-02 14:30:26,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:30:26,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169241583] [2021-11-02 14:30:26,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:30:26,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:30:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:30:26,689 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-02 14:30:26,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:30:26,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169241583] [2021-11-02 14:30:26,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169241583] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:30:26,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:30:26,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:30:26,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970305318] [2021-11-02 14:30:26,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 14:30:26,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:30:26,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 14:30:26,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-02 14:30:26,692 INFO L87 Difference]: Start difference. First operand 2236 states and 2869 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 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-02 14:30:33,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:30:33,895 INFO L93 Difference]: Finished difference Result 4362 states and 5593 transitions. [2021-11-02 14:30:33,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 14:30:33,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 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 93 [2021-11-02 14:30:33,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:30:33,901 INFO L225 Difference]: With dead ends: 4362 [2021-11-02 14:30:33,901 INFO L226 Difference]: Without dead ends: 4243 [2021-11-02 14:30:33,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.02ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-02 14:30:33,903 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4100 mSDsluCounter, 2544 mSDsCounter, 0 mSdLazyCounter, 3921 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6271.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.02ms SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 3921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6892.03ms IncrementalHoareTripleChecker+Time [2021-11-02 14:30:33,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4100 Valid, 0 Invalid, 3996 Unknown, 0 Unchecked, 9.02ms Time], IncrementalHoareTripleChecker [75 Valid, 3921 Invalid, 0 Unknown, 0 Unchecked, 6892.03ms Time] [2021-11-02 14:30:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4243 states. [2021-11-02 14:30:34,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4243 to 2245. [2021-11-02 14:30:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2245 states, 2232 states have (on average 1.2898745519713262) internal successors, (2879), 2244 states have internal predecessors, (2879), 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-02 14:30:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 2879 transitions. [2021-11-02 14:30:34,020 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 2879 transitions. Word has length 93 [2021-11-02 14:30:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:30:34,021 INFO L470 AbstractCegarLoop]: Abstraction has 2245 states and 2879 transitions. [2021-11-02 14:30:34,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 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-02 14:30:34,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 2879 transitions. [2021-11-02 14:30:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-02 14:30:34,022 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:30:34,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 14:30:34,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 14:30:34,022 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:30:34,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:30:34,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1307096688, now seen corresponding path program 1 times [2021-11-02 14:30:34,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:30:34,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791310926] [2021-11-02 14:30:34,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:30:34,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:30:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:30:34,137 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-02 14:30:34,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:30:34,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791310926] [2021-11-02 14:30:34,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791310926] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:30:34,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:30:34,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:30:34,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402285670] [2021-11-02 14:30:34,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:30:34,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:30:34,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:30:34,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:30:34,139 INFO L87 Difference]: Start difference. First operand 2245 states and 2879 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-02 14:30:38,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:30:38,794 INFO L93 Difference]: Finished difference Result 4141 states and 5304 transitions. [2021-11-02 14:30:38,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:30:38,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 98 [2021-11-02 14:30:38,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:30:38,797 INFO L225 Difference]: With dead ends: 4141 [2021-11-02 14:30:38,797 INFO L226 Difference]: Without dead ends: 2190 [2021-11-02 14:30:38,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.76ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:30:38,799 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 782 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 2283 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4028.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.99ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4459.49ms IncrementalHoareTripleChecker+Time [2021-11-02 14:30:38,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [782 Valid, 0 Invalid, 2305 Unknown, 0 Unchecked, 2.99ms Time], IncrementalHoareTripleChecker [22 Valid, 2283 Invalid, 0 Unknown, 0 Unchecked, 4459.49ms Time] [2021-11-02 14:30:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2021-11-02 14:30:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2180. [2021-11-02 14:30:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2167 states have (on average 1.2833410244577756) internal successors, (2781), 2179 states have internal predecessors, (2781), 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-02 14:30:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 2781 transitions. [2021-11-02 14:30:38,912 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 2781 transitions. Word has length 98 [2021-11-02 14:30:38,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:30:38,913 INFO L470 AbstractCegarLoop]: Abstraction has 2180 states and 2781 transitions. [2021-11-02 14:30:38,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-02 14:30:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2781 transitions. [2021-11-02 14:30:38,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-02 14:30:38,914 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:30:38,914 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 14:30:38,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-02 14:30:38,914 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:30:38,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:30:38,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1984260860, now seen corresponding path program 1 times [2021-11-02 14:30:38,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:30:38,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47643357] [2021-11-02 14:30:38,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:30:38,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:30:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:30:38,994 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-02 14:30:38,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:30:38,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47643357] [2021-11-02 14:30:38,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47643357] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:30:38,994 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:30:38,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:30:38,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818604011] [2021-11-02 14:30:38,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:30:38,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:30:38,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:30:38,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:30:38,996 INFO L87 Difference]: Start difference. First operand 2180 states and 2781 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:30:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:30:44,122 INFO L93 Difference]: Finished difference Result 2190 states and 2788 transitions. [2021-11-02 14:30:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 14:30:44,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-02 14:30:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:30:44,125 INFO L225 Difference]: With dead ends: 2190 [2021-11-02 14:30:44,125 INFO L226 Difference]: Without dead ends: 2156 [2021-11-02 14:30:44,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.76ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 14:30:44,126 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 3276 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4582.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.52ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4978.73ms IncrementalHoareTripleChecker+Time [2021-11-02 14:30:44,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 3277 Unknown, 0 Unchecked, 4.52ms Time], IncrementalHoareTripleChecker [1 Valid, 3276 Invalid, 0 Unknown, 0 Unchecked, 4978.73ms Time] [2021-11-02 14:30:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2021-11-02 14:30:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2152. [2021-11-02 14:30:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 2140 states have (on average 1.2855140186915888) internal successors, (2751), 2151 states have internal predecessors, (2751), 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-02 14:30:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2751 transitions. [2021-11-02 14:30:44,252 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2751 transitions. Word has length 99 [2021-11-02 14:30:44,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:30:44,252 INFO L470 AbstractCegarLoop]: Abstraction has 2152 states and 2751 transitions. [2021-11-02 14:30:44,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 14:30:44,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2751 transitions. [2021-11-02 14:30:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-02 14:30:44,254 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:30:44,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 14:30:44,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-02 14:30:44,254 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:30:44,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:30:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 973251299, now seen corresponding path program 1 times [2021-11-02 14:30:44,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:30:44,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613840597] [2021-11-02 14:30:44,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:30:44,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:30:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:30:44,345 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-02 14:30:44,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:30:44,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613840597] [2021-11-02 14:30:44,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613840597] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:30:44,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:30:44,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 14:30:44,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950453047] [2021-11-02 14:30:44,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:30:44,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:30:44,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:30:44,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:30:44,349 INFO L87 Difference]: Start difference. First operand 2152 states and 2751 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-02 14:30:48,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:30:48,086 INFO L93 Difference]: Finished difference Result 2160 states and 2757 transitions. [2021-11-02 14:30:48,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:30:48,087 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 126 [2021-11-02 14:30:48,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:30:48,089 INFO L225 Difference]: With dead ends: 2160 [2021-11-02 14:30:48,089 INFO L226 Difference]: Without dead ends: 2156 [2021-11-02 14:30:48,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.37ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:30:48,090 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1236 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3274.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.49ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3585.26ms IncrementalHoareTripleChecker+Time [2021-11-02 14:30:48,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1236 Valid, 0 Invalid, 1958 Unknown, 0 Unchecked, 3.49ms Time], IncrementalHoareTripleChecker [2 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 3585.26ms Time] [2021-11-02 14:30:48,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2021-11-02 14:30:48,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2152. [2021-11-02 14:30:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 2140 states have (on average 1.2845794392523364) internal successors, (2749), 2151 states have internal predecessors, (2749), 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-02 14:30:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2749 transitions. [2021-11-02 14:30:48,220 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2749 transitions. Word has length 126 [2021-11-02 14:30:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:30:48,220 INFO L470 AbstractCegarLoop]: Abstraction has 2152 states and 2749 transitions. [2021-11-02 14:30:48,220 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-02 14:30:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2749 transitions. [2021-11-02 14:30:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-02 14:30:48,221 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:30:48,221 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:30:48,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-02 14:30:48,222 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:30:48,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:30:48,222 INFO L85 PathProgramCache]: Analyzing trace with hash 451476494, now seen corresponding path program 1 times [2021-11-02 14:30:48,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:30:48,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351996882] [2021-11-02 14:30:48,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:30:48,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:30:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:30:48,311 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-02 14:30:48,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:30:48,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351996882] [2021-11-02 14:30:48,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351996882] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:30:48,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:30:48,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 14:30:48,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376595761] [2021-11-02 14:30:48,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:30:48,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:30:48,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:30:48,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:30:48,313 INFO L87 Difference]: Start difference. First operand 2152 states and 2749 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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-02 14:30:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:30:53,833 INFO L93 Difference]: Finished difference Result 4067 states and 5172 transitions. [2021-11-02 14:30:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 14:30:53,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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 131 [2021-11-02 14:30:53,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:30:53,836 INFO L225 Difference]: With dead ends: 4067 [2021-11-02 14:30:53,836 INFO L226 Difference]: Without dead ends: 2201 [2021-11-02 14:30:53,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.95ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:30:53,838 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 3269 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4918.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.86ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5333.57ms IncrementalHoareTripleChecker+Time [2021-11-02 14:30:53,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 3273 Unknown, 0 Unchecked, 4.86ms Time], IncrementalHoareTripleChecker [4 Valid, 3269 Invalid, 0 Unknown, 0 Unchecked, 5333.57ms Time] [2021-11-02 14:30:53,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2021-11-02 14:30:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 2154. [2021-11-02 14:30:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 2142 states have (on average 1.284780578898226) internal successors, (2752), 2153 states have internal predecessors, (2752), 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-02 14:30:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2752 transitions. [2021-11-02 14:30:53,972 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2752 transitions. Word has length 131 [2021-11-02 14:30:53,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:30:53,972 INFO L470 AbstractCegarLoop]: Abstraction has 2154 states and 2752 transitions. [2021-11-02 14:30:53,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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-02 14:30:53,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2752 transitions. [2021-11-02 14:30:53,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-02 14:30:53,973 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:30:53,973 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:30:53,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-02 14:30:53,974 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:30:53,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:30:53,974 INFO L85 PathProgramCache]: Analyzing trace with hash -555431090, now seen corresponding path program 1 times [2021-11-02 14:30:53,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:30:53,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751515994] [2021-11-02 14:30:53,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:30:53,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:30:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:30:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:30:54,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:30:54,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751515994] [2021-11-02 14:30:54,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751515994] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 14:30:54,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422741180] [2021-11-02 14:30:54,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:30:54,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 14:30:54,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 14:30:54,138 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-02 14:30:54,142 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-02 14:30:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:30:54,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 2217 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 14:30:54,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:30:54,899 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-02 14:30:54,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-02 14:30:54,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422741180] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:30:54,900 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-02 14:30:54,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-02 14:30:54,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842608632] [2021-11-02 14:30:54,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:30:54,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:30:54,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:30:54,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:30:54,901 INFO L87 Difference]: Start difference. First operand 2154 states and 2752 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-02 14:30:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:30:59,039 INFO L93 Difference]: Finished difference Result 4018 states and 5120 transitions. [2021-11-02 14:30:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:30:59,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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 131 [2021-11-02 14:30:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:30:59,042 INFO L225 Difference]: With dead ends: 4018 [2021-11-02 14:30:59,042 INFO L226 Difference]: Without dead ends: 2158 [2021-11-02 14:30:59,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.16ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:30:59,045 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1063 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3615.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.23ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3964.93ms IncrementalHoareTripleChecker+Time [2021-11-02 14:30:59,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1063 Valid, 0 Invalid, 1967 Unknown, 0 Unchecked, 3.23ms Time], IncrementalHoareTripleChecker [3 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 3964.93ms Time] [2021-11-02 14:30:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2021-11-02 14:30:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2154. [2021-11-02 14:30:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 2142 states have (on average 1.2829131652661065) internal successors, (2748), 2153 states have internal predecessors, (2748), 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-02 14:30:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2748 transitions. [2021-11-02 14:30:59,189 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2748 transitions. Word has length 131 [2021-11-02 14:30:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:30:59,189 INFO L470 AbstractCegarLoop]: Abstraction has 2154 states and 2748 transitions. [2021-11-02 14:30:59,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-02 14:30:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2748 transitions. [2021-11-02 14:30:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-02 14:30:59,191 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:30:59,191 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:30:59,215 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-02 14:30:59,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-02 14:30:59,404 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:30:59,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:30:59,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1591853852, now seen corresponding path program 1 times [2021-11-02 14:30:59,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:30:59,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45785012] [2021-11-02 14:30:59,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:30:59,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:30:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:30:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:30:59,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 14:30:59,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45785012] [2021-11-02 14:30:59,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45785012] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 14:30:59,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:30:59,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 14:30:59,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561185131] [2021-11-02 14:30:59,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:30:59,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 14:30:59,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:30:59,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:30:59,523 INFO L87 Difference]: Start difference. First operand 2154 states and 2748 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-02 14:31:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:31:03,718 INFO L93 Difference]: Finished difference Result 4077 states and 5182 transitions. [2021-11-02 14:31:03,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:31:03,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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 139 [2021-11-02 14:31:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:31:03,722 INFO L225 Difference]: With dead ends: 4077 [2021-11-02 14:31:03,722 INFO L226 Difference]: Without dead ends: 2217 [2021-11-02 14:31:03,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.47ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:31:03,725 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 720 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3675.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.37ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4011.21ms IncrementalHoareTripleChecker+Time [2021-11-02 14:31:03,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [720 Valid, 0 Invalid, 1793 Unknown, 0 Unchecked, 2.37ms Time], IncrementalHoareTripleChecker [28 Valid, 1765 Invalid, 0 Unknown, 0 Unchecked, 4011.21ms Time] [2021-11-02 14:31:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2021-11-02 14:31:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2124. [2021-11-02 14:31:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2124 states, 2112 states have (on average 1.2727272727272727) internal successors, (2688), 2123 states have internal predecessors, (2688), 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-02 14:31:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 2688 transitions. [2021-11-02 14:31:03,857 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 2688 transitions. Word has length 139 [2021-11-02 14:31:03,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:31:03,857 INFO L470 AbstractCegarLoop]: Abstraction has 2124 states and 2688 transitions. [2021-11-02 14:31:03,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-02 14:31:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2688 transitions. [2021-11-02 14:31:03,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-02 14:31:03,858 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:31:03,858 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:31:03,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-02 14:31:03,859 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:31:03,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:31:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1634788380, now seen corresponding path program 1 times [2021-11-02 14:31:03,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 14:31:03,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182661137] [2021-11-02 14:31:03,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:31:03,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 14:31:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 14:31:04,343 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 14:31:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 14:31:04,976 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 14:31:04,976 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-02 14:31:04,977 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (13 of 14 remaining) [2021-11-02 14:31:04,979 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (12 of 14 remaining) [2021-11-02 14:31:04,979 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (11 of 14 remaining) [2021-11-02 14:31:04,979 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (10 of 14 remaining) [2021-11-02 14:31:04,979 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (9 of 14 remaining) [2021-11-02 14:31:04,979 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (8 of 14 remaining) [2021-11-02 14:31:04,980 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 14 remaining) [2021-11-02 14:31:04,980 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (6 of 14 remaining) [2021-11-02 14:31:04,980 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (5 of 14 remaining) [2021-11-02 14:31:04,980 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 14 remaining) [2021-11-02 14:31:04,980 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 14 remaining) [2021-11-02 14:31:04,980 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 14 remaining) [2021-11-02 14:31:04,981 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 14 remaining) [2021-11-02 14:31:04,981 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (0 of 14 remaining) [2021-11-02 14:31:04,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-02 14:31:04,984 INFO L732 BasicCegarLoop]: Path program histogram: [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-02 14:31:04,988 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 14:31:05,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 02:31:05 BoogieIcfgContainer [2021-11-02 14:31:05,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 14:31:05,261 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 14:31:05,261 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 14:31:05,261 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 14:31:05,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 02:28:37" (3/4) ... [2021-11-02 14:31:05,264 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-02 14:31:05,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 14:31:05,264 INFO L158 Benchmark]: Toolchain (without parser) took 150970.01ms. Allocated memory was 100.7MB in the beginning and 415.2MB in the end (delta: 314.6MB). Free memory was 64.9MB in the beginning and 109.5MB in the end (delta: -44.6MB). Peak memory consumption was 270.1MB. Max. memory is 16.1GB. [2021-11-02 14:31:05,265 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 57.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 14:31:05,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1306.30ms. Allocated memory was 100.7MB in the beginning and 192.9MB in the end (delta: 92.3MB). Free memory was 64.6MB in the beginning and 131.0MB in the end (delta: -66.4MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. [2021-11-02 14:31:05,266 INFO L158 Benchmark]: Boogie Procedure Inliner took 154.51ms. Allocated memory is still 192.9MB. Free memory was 131.0MB in the beginning and 107.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-02 14:31:05,266 INFO L158 Benchmark]: Boogie Preprocessor took 162.88ms. Allocated memory is still 192.9MB. Free memory was 107.9MB in the beginning and 87.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-02 14:31:05,267 INFO L158 Benchmark]: RCFGBuilder took 1283.07ms. Allocated memory was 192.9MB in the beginning and 331.4MB in the end (delta: 138.4MB). Free memory was 87.0MB in the beginning and 226.7MB in the end (delta: -139.7MB). Peak memory consumption was 103.9MB. Max. memory is 16.1GB. [2021-11-02 14:31:05,267 INFO L158 Benchmark]: TraceAbstraction took 148052.20ms. Allocated memory was 331.4MB in the beginning and 415.2MB in the end (delta: 83.9MB). Free memory was 225.6MB in the beginning and 110.6MB in the end (delta: 115.1MB). Peak memory consumption was 221.0MB. Max. memory is 16.1GB. [2021-11-02 14:31:05,267 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 415.2MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 14:31:05,273 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 57.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1306.30ms. Allocated memory was 100.7MB in the beginning and 192.9MB in the end (delta: 92.3MB). Free memory was 64.6MB in the beginning and 131.0MB in the end (delta: -66.4MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 154.51ms. Allocated memory is still 192.9MB. Free memory was 131.0MB in the beginning and 107.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 162.88ms. Allocated memory is still 192.9MB. Free memory was 107.9MB in the beginning and 87.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * RCFGBuilder took 1283.07ms. Allocated memory was 192.9MB in the beginning and 331.4MB in the end (delta: 138.4MB). Free memory was 87.0MB in the beginning and 226.7MB in the end (delta: -139.7MB). Peak memory consumption was 103.9MB. Max. memory is 16.1GB. * TraceAbstraction took 148052.20ms. Allocated memory was 331.4MB in the beginning and 415.2MB in the end (delta: 83.9MB). Free memory was 225.6MB in the beginning and 110.6MB in the end (delta: 115.1MB). Peak memory consumption was 221.0MB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 415.2MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 6635, overapproximation of bitwiseOr at line 5696, overapproximation of shiftLeft at line 5141, overapproximation of bitwiseAnd at line 4928. Possible FailurePath: [L5170-L5181] static char const __mod_author63[40] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'V', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )' ', (char const )'P', (char const )'a', (char const )'v', (char const )'l', (char const )'i', (char const )'k', (char const )' ', (char const )'<', (char const )'v', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )'@', (char const )'s', (char const )'u', (char const )'s', (char const )'e', (char const )'.', (char const )'c', (char const )'z', (char const )'>', (char const )'\000'}; [L5182-L5197] static char const __mod_description64[53] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'T', (char const )'C', (char const )' ', (char const )'E', (char const )'L', (char const )'1', (char const )'2', (char const )'1', (char const )'0', (char const )'A', (char const )' ', (char const )'N', (char const )'e', (char const )'t', (char const )'M', (char const )'a', (char const )'t', (char const )'e', (char const )' ', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'E', (char const )'t', (char const )'h', (char const )'e', (char const )'r', (char const )'n', (char const )'e', (char const )'t', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )'\000'}; [L5198-L5202] static char const __mod_license65[12] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )'\000'}; [L5203-L5204] static char const driver_name[5] = { (char const )'c', (char const )'a', (char const )'t', (char const )'c', (char const )'\000'}; [L6129-L6176] static struct ethtool_ops const ops = {& catc_get_settings, (int (*)(struct net_device * , struct ethtool_cmd * ))0, & catc_get_drvinfo, (int (*)(struct net_device * ))0, (void (*)(struct net_device * , struct ethtool_regs * , void * ))0, (void (*)(struct net_device * , struct ethtool_wolinfo * ))0, (int (*)(struct net_device * , struct ethtool_wolinfo * ))0, (u32 (*)(struct net_device * ))0, (void (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * ))0, & ethtool_op_get_link, (int (*)(struct net_device * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (void (*)(struct net_device * , struct ethtool_ringparam * ))0, (int (*)(struct net_device * , struct ethtool_ringparam * ))0, (void (*)(struct net_device * , struct ethtool_pauseparam * ))0, (int (*)(struct net_device * , struct ethtool_pauseparam * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (void (*)(struct net_device * , struct ethtool_test * , u64 * ))0, (void (*)(struct net_device * , u32 stringset , u8 * ))0, (int (*)(struct net_device * , enum ethtool_phys_id_state ))0, (void (*)(struct net_device * , struct ethtool_stats * , u64 * ))0, (int (*)(struct net_device * ))0, (void (*)(struct net_device * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * , int ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * , void * ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * ))0, (int (*)(struct net_device * , struct ethtool_flash * ))0, (int (*)(struct net_device * , u32 * ))0, (int (*)(struct net_device * , struct ethtool_rx_ntuple * ))0, (int (*)(struct net_device * , u32 stringset , void * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir const * ))0, (void (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0, (int (*)(struct net_device * , struct ethtool_dump * , void * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0}; [L6231-L6269] static struct net_device_ops const catc_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & catc_open, & catc_stop, & catc_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, & catc_set_multicast_list, & eth_mac_addr, & eth_validate_addr, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, & eth_change_mtu, (int (*)(struct net_device *dev , struct neigh_parms * ))0, & catc_tx_timeout, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6270] static struct lock_class_key __key___9 ; [L6271] static struct lock_class_key __key___10 ; [L6272] static struct lock_class_key __key___11 ; [L6684-L6692] static struct usb_device_id catc_id_table[3] = { {(__u16 )3, (__u16 )1059, (__u16 )10, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )1059, (__u16 )12, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )2257, (__u16 )1, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6695-L6710] static struct usb_driver catc_driver = {driver_name, & catc_probe, & catc_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(catc_id_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6763] int LDV_IN_INTERRUPT ; [L6764] static int res_catc_open_15 ; [L6765] static int res_catc_stop_16 ; [L6766] static int res_catc_probe_17 ; [L6959] int ldv_urb_state = 0; [L6960] int ldv_coherent_state = 0; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6768] struct net_device *var_group1 ; [L6769] struct ethtool_drvinfo *var_group2 ; [L6770] struct ethtool_cmd *var_group3 ; [L6771] struct sk_buff *var_group4 ; [L6772] struct usb_interface *var_group5 ; [L6773] struct usb_device_id const *var_catc_probe_17_p1 ; [L6774] unsigned long var_catc_stats_timer_10_p0 ; [L6775] int tmp___7 ; [L6776] int ldv_s_catc_netdev_ops_net_device_ops ; [L6777] int ldv_s_catc_driver_usb_driver ; [L6778] int tmp___8 ; [L6779] int tmp___9 ; [L6782] LDV_IN_INTERRUPT = 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6714] int result ; [L6715] int tmp___7 ; [L5088] int tmp___7 ; [L7209] return __VERIFIER_nondet_int(); [L5091] tmp___7 = usb_register_driver(driver, & __this_module, "catc") [L5093] return (tmp___7); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6718] tmp___7 = usb_register(& catc_driver) [L6719] result = tmp___7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6721] COND TRUE result == 0 [L6727] return (result); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6784] tmp___7 = catc_init() [L6786] COND FALSE !(\read(tmp___7)) [L6790] ldv_s_catc_netdev_ops_net_device_ops = 0 [L6791] ldv_s_catc_driver_usb_driver = 0 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6793] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6796] tmp___9 = __VERIFIER_nondet_int() [L6798] COND TRUE \read(tmp___9) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6807] tmp___8 = __VERIFIER_nondet_int() [L6809] COND FALSE !(tmp___8 == 0) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6815] COND FALSE !(tmp___8 == 2) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6818] COND FALSE !(tmp___8 == 3) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6821] COND FALSE !(tmp___8 == 4) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6824] COND FALSE !(tmp___8 == 5) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6827] COND FALSE !(tmp___8 == 6) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6830] COND TRUE tmp___8 == 7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6895] COND TRUE ldv_s_catc_driver_usb_driver == 0 [L6274] struct usb_device *usbdev ; [L6275] struct usb_device *tmp___7 ; [L6276] struct net_device *netdev ; [L6277] struct catc *catc ; [L6278] u8 broadcast[6] ; [L6279] int i ; [L6280] int pktsz ; [L6281] int tmp___8 ; [L6282] void *tmp___9 ; [L6283] unsigned int tmp___10 ; [L6284] unsigned int tmp___11 ; [L6285] unsigned int tmp___12 ; [L6286] unsigned int tmp___13 ; [L6287] char const *tmp___14 ; [L6288] int tmp___15 ; [L5065] struct device const *__mptr ; [L5067] EXPR intf->dev.parent [L5067] __mptr = (struct device const *)intf->dev.parent [L5068] return ((struct usb_device *)((char *)__mptr - (unsigned int )(& ((struct usb_device *)0)->dev))); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6291] tmp___7 = interface_to_usbdev(intf) [L6292] usbdev = tmp___7 [L6293] EXPR intf->altsetting [L6293] EXPR (intf->altsetting)->desc.bInterfaceNumber [L7213] return __VERIFIER_nondet_int(); [L6293-L6294] tmp___8 = usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L6296] COND FALSE !(\read(tmp___8)) [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7117] return ldv_malloc(sizeof(struct net_device)); [L6304] netdev = alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L6306] COND FALSE !(! netdev) [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6311] tmp___9 = netdev_priv((struct net_device const *)netdev) [L6312] catc = (struct catc *)tmp___9 [L6313] netdev->netdev_ops = & catc_netdev_ops [L6314] netdev->watchdog_timeo = 1250 [L6315] netdev->ethtool_ops = & ops [L6316] catc->usbdev = usbdev [L6317] catc->netdev = netdev VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6320] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4851] return (& lock->__annonCompField18.rlock); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6326] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6343] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4851] return (& lock->__annonCompField18.rlock); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6349] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6366] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6377] catc->timer.data = (unsigned long )((long )catc) [L6378] catc->timer.function = & catc_stats_timer [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] return ldv_malloc(0UL); [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6379] catc->ctrl_urb = usb_alloc_urb(0, 208U) [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] return ldv_malloc(0UL); [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6380] catc->tx_urb = usb_alloc_urb(0, 208U) [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] return ldv_malloc(0UL); [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6381] catc->rx_urb = usb_alloc_urb(0, 208U) [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] return ldv_malloc(0UL); [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6382] catc->irq_urb = usb_alloc_urb(0, 208U) [L6384] EXPR catc->ctrl_urb VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6384] COND FALSE !(! catc->ctrl_urb) [L6387] EXPR catc->tx_urb VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6387] COND FALSE !(! catc->tx_urb) [L6390] EXPR catc->rx_urb VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6390] COND FALSE !(! catc->rx_urb) [L6393] EXPR catc->irq_urb VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6393] COND FALSE !(! catc->irq_urb) [L6406] EXPR usbdev->descriptor.idVendor VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6406] COND FALSE !((int )usbdev->descriptor.idVendor == 1059) [L6429] pktsz = 23070 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6432] tmp___10 = __create_pipe(usbdev, 0U) [L6433] catc->ctrl_urb [L5103] urb->dev = dev [L5104] urb->pipe = pipe [L5105] urb->setup_packet = setup_packet [L5106] urb->transfer_buffer = transfer_buffer [L5107] urb->transfer_buffer_length = (u32 )buffer_length [L5108] urb->complete = complete_fn [L5109] urb->context = context VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6436] tmp___11 = __create_pipe(usbdev, 1U) [L6437] catc->tx_urb [L5119] urb->dev = dev [L5120] urb->pipe = pipe [L5121] urb->transfer_buffer = transfer_buffer [L5122] urb->transfer_buffer_length = (u32 )buffer_length [L5123] urb->complete = complete_fn [L5124] urb->context = context VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6439] tmp___12 = __create_pipe(usbdev, 1U) [L6440] catc->rx_urb [L5119] urb->dev = dev [L5120] urb->pipe = pipe [L5121] urb->transfer_buffer = transfer_buffer [L5122] urb->transfer_buffer_length = (u32 )buffer_length [L5123] urb->complete = complete_fn [L5124] urb->context = context VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6442] tmp___13 = __create_pipe(usbdev, 2U) [L6443] catc->irq_urb [L5134] urb->dev = dev [L5135] urb->pipe = pipe [L5136] urb->transfer_buffer = transfer_buffer [L5137] urb->transfer_buffer_length = (u32 )buffer_length [L5138] urb->complete = complete_fn [L5139] urb->context = context [L5140] EXPR dev->speed VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5140] COND TRUE (unsigned int )dev->speed == 3U [L5141] urb->interval = 1 << (interval - 1) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5148] urb->start_frame = -1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6446] EXPR catc->is_f5u011 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6446] COND FALSE !(! catc->is_f5u011) [L6599] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5684] COND FALSE !(\read(dir)) [L5691] EXPR catc->usbdev [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5691] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5692] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5696] EXPR catc->usbdev [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5705] return (tmp___11); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6608] netdev->dev_addr [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5684] COND TRUE \read(dir) [L5686] EXPR catc->usbdev [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5686] tmp___7 = __create_pipe(catc->usbdev, 0U) [L5687] tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5696] EXPR catc->usbdev [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5705] return (tmp___11); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6612] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6620] catc->rxmode[0] = (u8 )11 [L6621] catc->rxmode[1] = (u8 )0 [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5684] COND FALSE !(\read(dir)) [L5691] EXPR catc->usbdev [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5691] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5692] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5696] EXPR catc->usbdev [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5705] return (tmp___11); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6627] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6634] catc->is_f5u011 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6634] COND TRUE catc->is_f5u011 [L6635] tmp___14 = "Belkin F5U011" VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6640] EXPR usbdev->bus [L6640] (usbdev->bus)->bus_name [L6641] netdev->dev_addr [L7138] return __VERIFIER_nondet_int(); [L6643] netdev->dev.parent = & intf->dev [L7187] return __VERIFIER_nondet_int(); [L6644] tmp___15 = register_netdev(netdev) [L6646] COND FALSE !(tmp___15 != 0) [L6658] return (0); [L6658] return (0); [L6658] return (0); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6897] res_catc_probe_17 = catc_probe(var_group5, var_catc_probe_17_p1) [L6900] COND FALSE !(\read(res_catc_probe_17)) [L6904] ldv_s_catc_driver_usb_driver = ldv_s_catc_driver_usb_driver + 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6793] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6796] tmp___9 = __VERIFIER_nondet_int() [L6798] COND TRUE \read(tmp___9) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6807] tmp___8 = __VERIFIER_nondet_int() [L6809] COND FALSE !(tmp___8 == 0) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6815] COND TRUE tmp___8 == 2 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6852] COND TRUE ldv_s_catc_netdev_ops_net_device_ops == 0 [L6178] struct catc *catc ; [L6179] void *tmp___7 ; [L6180] int status ; [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6183] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6184] catc = (struct catc *)tmp___7 [L6185] EXPR catc->irq_urb [L6185] EXPR catc->usbdev [L6185] (catc->irq_urb)->dev = catc->usbdev [L6186] EXPR catc->irq_urb [L7217] return __VERIFIER_nondet_int(); [L6186] status = usb_submit_urb(catc->irq_urb, 208U) [L6188] COND TRUE status < 0 [L6192] return (-1); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6854] res_catc_open_15 = catc_open(var_group1) [L6857] COND TRUE res_catc_open_15 < 0 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L7081] COND FALSE !(ldv_urb_state == 0) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L6946] reach_error() VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 689 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 147723.86ms, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 41.41ms, AutomataDifference: 140737.41ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 15.79ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26255 SdHoareTripleChecker+Valid, 136600.05ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26255 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 125368.98ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45548 mSDsCounter, 331 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 77470 IncrementalHoareTripleChecker+Invalid, 77801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 331 mSolverCounterUnsat, 12 mSDtfsCounter, 77470 mSolverCounterSat, 146.29ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 183 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 338.29ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2756occurred in iteration=8, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 2020.77ms AutomataMinimizationTime, 22 MinimizatonAttempts, 20949 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 216.43ms SsaConstructionTime, 1447.88ms SatisfiabilityAnalysisTime, 1909.83ms InterpolantComputationTime, 2118 NumberOfCodeBlocks, 2118 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1956 ConstructedInterpolants, 0 QuantifiedInterpolants, 4857 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2217 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 23 InterpolantComputations, 22 PerfectInterpolantSequences, 25/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-02 14:31:05,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 14:31:07,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 14:31:07,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 14:31:07,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 14:31:07,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 14:31:07,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 14:31:07,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 14:31:07,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 14:31:07,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 14:31:07,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 14:31:07,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 14:31:07,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 14:31:07,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 14:31:07,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 14:31:07,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 14:31:07,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 14:31:07,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 14:31:07,122 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 14:31:07,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 14:31:07,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 14:31:07,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 14:31:07,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 14:31:07,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 14:31:07,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 14:31:07,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 14:31:07,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 14:31:07,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 14:31:07,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 14:31:07,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 14:31:07,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 14:31:07,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 14:31:07,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 14:31:07,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 14:31:07,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 14:31:07,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 14:31:07,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 14:31:07,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 14:31:07,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 14:31:07,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 14:31:07,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 14:31:07,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 14:31:07,147 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-02 14:31:07,170 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 14:31:07,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 14:31:07,183 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 14:31:07,183 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 14:31:07,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 14:31:07,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 14:31:07,185 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 14:31:07,186 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 14:31:07,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 14:31:07,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 14:31:07,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 14:31:07,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 14:31:07,187 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-02 14:31:07,187 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-02 14:31:07,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 14:31:07,187 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 14:31:07,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 14:31:07,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 14:31:07,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 14:31:07,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 14:31:07,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 14:31:07,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 14:31:07,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 14:31:07,188 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 14:31:07,189 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-02 14:31:07,189 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-02 14:31:07,189 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 14:31:07,189 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 14:31:07,189 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 14:31:07,189 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 14:31:07,189 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-02 14:31:07,190 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c [2021-11-02 14:31:07,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 14:31:07,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 14:31:07,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 14:31:07,520 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 14:31:07,521 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 14:31:07,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-02 14:31:07,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12c9ad35b/8c75e2931d8c4a67b82d5028c6a2f071/FLAG775260b98 [2021-11-02 14:31:08,202 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 14:31:08,203 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-02 14:31:08,235 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12c9ad35b/8c75e2931d8c4a67b82d5028c6a2f071/FLAG775260b98 [2021-11-02 14:31:08,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12c9ad35b/8c75e2931d8c4a67b82d5028c6a2f071 [2021-11-02 14:31:08,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 14:31:08,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 14:31:08,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 14:31:08,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 14:31:08,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 14:31:08,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 02:31:08" (1/1) ... [2021-11-02 14:31:08,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad8df6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:31:08, skipping insertion in model container [2021-11-02 14:31:08,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 02:31:08" (1/1) ... [2021-11-02 14:31:08,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 14:31:08,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 14:31:09,580 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.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2021-11-02 14:31:09,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 14:31:09,661 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 14:31:09,859 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.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2021-11-02 14:31:09,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 14:31:10,170 INFO L208 MainTranslator]: Completed translation [2021-11-02 14:31:10,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:31:10 WrapperNode [2021-11-02 14:31:10,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 14:31:10,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 14:31:10,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 14:31:10,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 14:31:10,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:31:10" (1/1) ... [2021-11-02 14:31:10,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:31:10" (1/1) ... [2021-11-02 14:31:10,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 14:31:10,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 14:31:10,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 14:31:10,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 14:31:10,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:31:10" (1/1) ... [2021-11-02 14:31:10,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:31:10" (1/1) ... [2021-11-02 14:31:10,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:31:10" (1/1) ... [2021-11-02 14:31:10,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:31:10" (1/1) ... [2021-11-02 14:31:10,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:31:10" (1/1) ... [2021-11-02 14:31:10,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:31:10" (1/1) ... [2021-11-02 14:31:10,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:31:10" (1/1) ... [2021-11-02 14:31:10,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 14:31:10,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 14:31:10,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 14:31:10,528 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 14:31:10,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:31:10" (1/1) ... [2021-11-02 14:31:10,534 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 14:31:10,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 14:31:10,573 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-02 14:31:10,589 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-02 14:31:10,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-02 14:31:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-02 14:31:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-02 14:31:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-02 14:31:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-02 14:31:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-02 14:31:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-02 14:31:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-02 14:31:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-02 14:31:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-02 14:31:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 14:31:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 14:31:10,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 14:31:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-02 14:31:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-02 14:31:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-02 14:31:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 14:31:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-02 14:31:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-02 14:31:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-02 14:31:10,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 14:31:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-02 14:31:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 14:31:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-02 14:31:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-02 14:31:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-02 14:31:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-02 14:31:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-02 14:31:10,608 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-11-02 14:31:10,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 14:31:10,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 14:31:11,011 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-02 14:31:11,099 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-02 14:31:12,162 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##522: assume !false; [2021-11-02 14:31:12,163 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##521: assume false; [2021-11-02 14:31:12,163 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##41: assume !false; [2021-11-02 14:31:12,163 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume false; [2021-11-02 14:31:12,176 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 14:31:12,177 INFO L299 CfgBuilder]: Removed 647 assume(true) statements. [2021-11-02 14:31:12,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 02:31:12 BoogieIcfgContainer [2021-11-02 14:31:12,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 14:31:12,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 14:31:12,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 14:31:12,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 14:31:12,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 02:31:08" (1/3) ... [2021-11-02 14:31:12,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f28f79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 02:31:12, skipping insertion in model container [2021-11-02 14:31:12,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 02:31:10" (2/3) ... [2021-11-02 14:31:12,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f28f79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 02:31:12, skipping insertion in model container [2021-11-02 14:31:12,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 02:31:12" (3/3) ... [2021-11-02 14:31:12,186 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-02 14:31:12,190 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 14:31:12,191 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-11-02 14:31:12,240 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 14:31:12,246 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-02 14:31:12,246 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-11-02 14:31:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 689 states, 674 states have (on average 1.4940652818991098) internal successors, (1007), 688 states have internal predecessors, (1007), 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-02 14:31:12,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-02 14:31:12,274 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:31:12,275 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:31:12,276 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:31:12,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:31:12,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1802578412, now seen corresponding path program 1 times [2021-11-02 14:31:12,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:31:12,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269712820] [2021-11-02 14:31:12,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:31:12,292 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:31:12,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:31:12,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:31:12,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-02 14:31:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:31:12,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 14:31:12,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:31:12,940 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-02 14:31:12,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:31:12,962 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-02 14:31:12,963 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:31:12,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269712820] [2021-11-02 14:31:12,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269712820] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 14:31:12,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:31:12,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-02 14:31:12,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047517186] [2021-11-02 14:31:12,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 14:31:12,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:31:12,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 14:31:12,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 14:31:12,988 INFO L87 Difference]: Start difference. First operand has 689 states, 674 states have (on average 1.4940652818991098) internal successors, (1007), 688 states have internal predecessors, (1007), 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 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-02 14:31:15,078 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:17,271 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:19,322 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:20,554 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:25,271 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:27,686 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:29,124 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:30,361 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:31,657 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:35,855 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:37,593 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:39,621 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:41,458 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:43,482 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:46,390 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:47,579 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:49,626 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:51,040 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:52,339 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:54,356 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:31:59,287 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:01,403 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:02,700 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:04,759 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:06,593 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:08,216 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:10,241 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:11,990 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:14,009 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:16,418 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:18,494 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:20,467 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:26,523 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:29,836 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:31,868 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:36,382 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:37,409 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:41,495 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:44,931 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:47,155 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:50,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:32:50,136 INFO L93 Difference]: Finished difference Result 2632 states and 3855 transitions. [2021-11-02 14:32:50,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 14:32:50,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2021-11-02 14:32:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:32:50,157 INFO L225 Difference]: With dead ends: 2632 [2021-11-02 14:32:50,157 INFO L226 Difference]: Without dead ends: 1904 [2021-11-02 14:32:50,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.29ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 14:32:50,168 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 3206 mSDsluCounter, 2621 mSDsCounter, 0 mSdLazyCounter, 3454 mSolverCounterSat, 1 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 93764.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3206 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 3469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 47.90ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3454 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 96623.70ms IncrementalHoareTripleChecker+Time [2021-11-02 14:32:50,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3206 Valid, 48 Invalid, 3469 Unknown, 0 Unchecked, 47.90ms Time], IncrementalHoareTripleChecker [1 Valid, 3454 Invalid, 14 Unknown, 0 Unchecked, 96623.70ms Time] [2021-11-02 14:32:50,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2021-11-02 14:32:50,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 672. [2021-11-02 14:32:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 658 states have (on average 1.2917933130699089) internal successors, (850), 671 states have internal predecessors, (850), 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-02 14:32:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 850 transitions. [2021-11-02 14:32:50,231 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 850 transitions. Word has length 11 [2021-11-02 14:32:50,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:32:50,232 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 850 transitions. [2021-11-02 14:32:50,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-02 14:32:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 850 transitions. [2021-11-02 14:32:50,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-02 14:32:50,232 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:32:50,233 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:32:50,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-02 14:32:50,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 14:32:50,440 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:32:50,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:32:50,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1859836714, now seen corresponding path program 1 times [2021-11-02 14:32:50,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:32:50,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782434116] [2021-11-02 14:32:50,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:32:50,441 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:32:50,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:32:50,443 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:32:50,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-02 14:32:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:32:50,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 14:32:50,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:32:51,054 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-02 14:32:51,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:32:51,103 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-02 14:32:51,103 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:32:51,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782434116] [2021-11-02 14:32:51,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782434116] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 14:32:51,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:32:51,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 14:32:51,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972506274] [2021-11-02 14:32:51,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:32:51,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:32:51,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:32:51,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:32:51,105 INFO L87 Difference]: Start difference. First operand 672 states and 850 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-02 14:32:53,196 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:55,412 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:32:58,350 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:00,808 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:03,334 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:05,284 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:07,925 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:09,367 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:10,808 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:14,564 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:16,650 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:18,837 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:20,055 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:21,108 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:22,618 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:24,616 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:28,523 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:29,562 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:33,476 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:38,128 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:40,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:33:40,402 INFO L93 Difference]: Finished difference Result 1881 states and 2377 transitions. [2021-11-02 14:33:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:33:40,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2021-11-02 14:33:40,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:33:40,406 INFO L225 Difference]: With dead ends: 1881 [2021-11-02 14:33:40,406 INFO L226 Difference]: Without dead ends: 1221 [2021-11-02 14:33:40,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.61ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:33:40,408 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 675 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 13 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47558.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.94ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49084.00ms IncrementalHoareTripleChecker+Time [2021-11-02 14:33:40,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [675 Valid, 0 Invalid, 1688 Unknown, 0 Unchecked, 13.94ms Time], IncrementalHoareTripleChecker [13 Valid, 1667 Invalid, 8 Unknown, 0 Unchecked, 49084.00ms Time] [2021-11-02 14:33:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2021-11-02 14:33:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1176. [2021-11-02 14:33:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1162 states have (on average 1.2865748709122202) internal successors, (1495), 1175 states have internal predecessors, (1495), 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-02 14:33:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1495 transitions. [2021-11-02 14:33:40,438 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1495 transitions. Word has length 11 [2021-11-02 14:33:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:33:40,438 INFO L470 AbstractCegarLoop]: Abstraction has 1176 states and 1495 transitions. [2021-11-02 14:33:40,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-02 14:33:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1495 transitions. [2021-11-02 14:33:40,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-02 14:33:40,439 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:33:40,439 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:33:40,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-02 14:33:40,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 14:33:40,655 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:33:40,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:33:40,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1820364266, now seen corresponding path program 1 times [2021-11-02 14:33:40,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:33:40,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487361430] [2021-11-02 14:33:40,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:33:40,657 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:33:40,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:33:40,658 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:33:40,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-02 14:33:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:33:41,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 14:33:41,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:33:41,152 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-02 14:33:41,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:33:41,195 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-02 14:33:41,196 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:33:41,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487361430] [2021-11-02 14:33:41,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487361430] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 14:33:41,196 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:33:41,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 14:33:41,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723823351] [2021-11-02 14:33:41,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:33:41,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:33:41,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:33:41,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:33:41,197 INFO L87 Difference]: Start difference. First operand 1176 states and 1495 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-02 14:33:43,277 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:44,840 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:47,788 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:49,725 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:51,423 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:54,025 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:56,057 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:33:58,844 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:00,472 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:02,517 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:07,226 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:09,307 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:11,503 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:13,566 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:15,022 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:16,715 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:22,055 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:25,893 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:34:28,773 INFO L93 Difference]: Finished difference Result 2190 states and 2770 transitions. [2021-11-02 14:34:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 14:34:28,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2021-11-02 14:34:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:34:28,780 INFO L225 Difference]: With dead ends: 2190 [2021-11-02 14:34:28,781 INFO L226 Difference]: Without dead ends: 2185 [2021-11-02 14:34:28,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.57ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:34:28,786 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 660 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 0 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45908.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.51ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47379.83ms IncrementalHoareTripleChecker+Time [2021-11-02 14:34:28,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [660 Valid, 0 Invalid, 1686 Unknown, 0 Unchecked, 12.51ms Time], IncrementalHoareTripleChecker [0 Valid, 1677 Invalid, 9 Unknown, 0 Unchecked, 47379.83ms Time] [2021-11-02 14:34:28,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2021-11-02 14:34:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2065. [2021-11-02 14:34:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2065 states, 2051 states have (on average 1.2837640175524134) internal successors, (2633), 2064 states have internal predecessors, (2633), 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-02 14:34:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2633 transitions. [2021-11-02 14:34:28,832 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2633 transitions. Word has length 12 [2021-11-02 14:34:28,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:34:28,832 INFO L470 AbstractCegarLoop]: Abstraction has 2065 states and 2633 transitions. [2021-11-02 14:34:28,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-02 14:34:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2633 transitions. [2021-11-02 14:34:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-02 14:34:28,833 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:34:28,833 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:34:28,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-02 14:34:29,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 14:34:29,048 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:34:29,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:34:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash -965110428, now seen corresponding path program 1 times [2021-11-02 14:34:29,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:34:29,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842457459] [2021-11-02 14:34:29,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:34:29,049 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:34:29,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:34:29,050 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:34:29,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-02 14:34:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:34:29,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 14:34:29,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:34:29,685 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-02 14:34:29,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:34:29,805 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-02 14:34:29,805 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:34:29,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842457459] [2021-11-02 14:34:29,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842457459] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 14:34:29,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:34:29,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-02 14:34:29,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696967115] [2021-11-02 14:34:29,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:34:29,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:34:29,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:34:29,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:34:29,807 INFO L87 Difference]: Start difference. First operand 2065 states and 2633 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-02 14:34:31,896 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:34,095 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:36,825 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:39,288 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:42,181 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:43,388 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:45,488 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:47,502 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:50,437 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:52,463 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:55,183 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:57,203 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:34:58,290 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:01,816 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:03,528 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:05,910 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:07,111 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:09,552 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:11,567 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:13,647 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:15,754 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:17,798 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:19,850 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:21,726 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:23,917 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:25,101 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:28,340 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:31,714 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:34,080 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:36,153 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:35:37,325 INFO L93 Difference]: Finished difference Result 5327 states and 6872 transitions. [2021-11-02 14:35:37,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:35:37,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 35 [2021-11-02 14:35:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:35:37,335 INFO L225 Difference]: With dead ends: 5327 [2021-11-02 14:35:37,335 INFO L226 Difference]: Without dead ends: 3270 [2021-11-02 14:35:37,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.92ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:35:37,339 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1655 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 9 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65706.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 26.28ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67302.18ms IncrementalHoareTripleChecker+Time [2021-11-02 14:35:37,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1655 Valid, 0 Invalid, 1588 Unknown, 0 Unchecked, 26.28ms Time], IncrementalHoareTripleChecker [9 Valid, 1560 Invalid, 19 Unknown, 0 Unchecked, 67302.18ms Time] [2021-11-02 14:35:37,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2021-11-02 14:35:37,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3240. [2021-11-02 14:35:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3240 states, 3226 states have (on average 1.3031618102913824) internal successors, (4204), 3239 states have internal predecessors, (4204), 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-02 14:35:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3240 states to 3240 states and 4204 transitions. [2021-11-02 14:35:37,418 INFO L78 Accepts]: Start accepts. Automaton has 3240 states and 4204 transitions. Word has length 35 [2021-11-02 14:35:37,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:35:37,419 INFO L470 AbstractCegarLoop]: Abstraction has 3240 states and 4204 transitions. [2021-11-02 14:35:37,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-02 14:35:37,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 4204 transitions. [2021-11-02 14:35:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-02 14:35:37,424 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:35:37,424 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:35:37,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-02 14:35:37,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 14:35:37,635 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:35:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:35:37,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1872635211, now seen corresponding path program 1 times [2021-11-02 14:35:37,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:35:37,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820590736] [2021-11-02 14:35:37,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:35:37,637 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:35:37,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:35:37,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:35:37,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-02 14:35:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:35:38,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 14:35:38,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:35:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-02 14:35:38,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:35:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-02 14:35:38,313 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:35:38,313 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820590736] [2021-11-02 14:35:38,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820590736] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 14:35:38,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:35:38,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-02 14:35:38,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025991161] [2021-11-02 14:35:38,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:35:38,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:35:38,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:35:38,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:35:38,314 INFO L87 Difference]: Start difference. First operand 3240 states and 4204 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-02 14:35:40,391 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:43,389 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:45,726 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:47,742 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:50,140 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:52,171 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:54,006 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:55,344 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:57,107 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:35:59,854 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:03,459 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:05,440 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:07,477 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:09,515 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:11,706 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:14,018 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:15,747 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:19,792 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:21,075 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:23,140 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:26,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:36:26,628 INFO L93 Difference]: Finished difference Result 9010 states and 11824 transitions. [2021-11-02 14:36:26,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:36:26,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 46 [2021-11-02 14:36:26,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:36:26,644 INFO L225 Difference]: With dead ends: 9010 [2021-11-02 14:36:26,644 INFO L226 Difference]: Without dead ends: 5777 [2021-11-02 14:36:26,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.30ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:36:26,651 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1503 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 9 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46765.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.54ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48091.04ms IncrementalHoareTripleChecker+Time [2021-11-02 14:36:26,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1503 Valid, 0 Invalid, 1502 Unknown, 0 Unchecked, 17.54ms Time], IncrementalHoareTripleChecker [9 Valid, 1483 Invalid, 10 Unknown, 0 Unchecked, 48091.04ms Time] [2021-11-02 14:36:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5777 states. [2021-11-02 14:36:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5777 to 5427. [2021-11-02 14:36:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5427 states, 5413 states have (on average 1.3293922039534454) internal successors, (7196), 5426 states have internal predecessors, (7196), 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-02 14:36:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5427 states to 5427 states and 7196 transitions. [2021-11-02 14:36:26,761 INFO L78 Accepts]: Start accepts. Automaton has 5427 states and 7196 transitions. Word has length 46 [2021-11-02 14:36:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:36:26,762 INFO L470 AbstractCegarLoop]: Abstraction has 5427 states and 7196 transitions. [2021-11-02 14:36:26,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-02 14:36:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5427 states and 7196 transitions. [2021-11-02 14:36:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-02 14:36:26,765 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:36:26,765 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:36:26,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-02 14:36:26,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 14:36:26,990 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:36:26,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:36:26,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2056089327, now seen corresponding path program 1 times [2021-11-02 14:36:26,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:36:26,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195206385] [2021-11-02 14:36:26,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:36:26,991 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:36:26,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:36:26,993 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:36:26,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-02 14:36:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:36:27,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 14:36:27,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:36:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:36:27,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:36:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:36:27,796 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:36:27,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195206385] [2021-11-02 14:36:27,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195206385] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 14:36:27,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:36:27,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-02 14:36:27,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776174992] [2021-11-02 14:36:27,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 14:36:27,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:36:27,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 14:36:27,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 14:36:27,797 INFO L87 Difference]: Start difference. First operand 5427 states and 7196 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-02 14:36:29,886 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:34,008 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:39,671 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:42,223 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:44,241 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:46,264 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:50,328 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:52,355 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:56,497 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:36:58,517 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:00,255 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:02,279 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:03,991 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:06,013 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:07,444 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:09,462 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:16,893 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:18,911 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:20,943 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:22,476 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:24,499 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:26,152 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:27,278 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:28,920 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:30,862 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:32,377 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:33,909 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:35,529 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:37,551 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:39,305 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:40,856 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:48,094 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:50,406 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:51,596 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:52,781 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:55,278 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:57,346 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:37:58,993 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:05,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:38:05,654 INFO L93 Difference]: Finished difference Result 10894 states and 14434 transitions. [2021-11-02 14:38:05,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 14:38:05,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 53 [2021-11-02 14:38:05,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:38:05,668 INFO L225 Difference]: With dead ends: 10894 [2021-11-02 14:38:05,669 INFO L226 Difference]: Without dead ends: 5468 [2021-11-02 14:38:05,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 69.61ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 14:38:05,676 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 3354 mSDsCounter, 0 mSdLazyCounter, 4204 mSolverCounterSat, 4 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 95056.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.54ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4204 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 97568.03ms IncrementalHoareTripleChecker+Time [2021-11-02 14:38:05,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 4224 Unknown, 0 Unchecked, 20.54ms Time], IncrementalHoareTripleChecker [4 Valid, 4204 Invalid, 16 Unknown, 0 Unchecked, 97568.03ms Time] [2021-11-02 14:38:05,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2021-11-02 14:38:05,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 5429. [2021-11-02 14:38:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5429 states, 5415 states have (on average 1.3285318559556787) internal successors, (7194), 5428 states have internal predecessors, (7194), 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-02 14:38:05,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 7194 transitions. [2021-11-02 14:38:05,783 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 7194 transitions. Word has length 53 [2021-11-02 14:38:05,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:38:05,784 INFO L470 AbstractCegarLoop]: Abstraction has 5429 states and 7194 transitions. [2021-11-02 14:38:05,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-02 14:38:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 7194 transitions. [2021-11-02 14:38:05,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-02 14:38:05,786 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:38:05,786 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:38:05,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-02 14:38:06,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 14:38:06,003 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:38:06,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:38:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2124595902, now seen corresponding path program 1 times [2021-11-02 14:38:06,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:38:06,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007299900] [2021-11-02 14:38:06,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:38:06,004 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:38:06,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:38:06,005 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:38:06,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-02 14:38:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:38:06,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 14:38:06,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:38:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:38:06,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:38:06,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 14:38:06,965 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:38:06,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007299900] [2021-11-02 14:38:06,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007299900] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 14:38:06,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 14:38:06,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-02 14:38:06,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276214995] [2021-11-02 14:38:06,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 14:38:06,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:38:06,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 14:38:06,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-02 14:38:06,967 INFO L87 Difference]: Start difference. First operand 5429 states and 7194 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-02 14:38:09,052 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:11,799 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:13,832 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:15,711 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:17,739 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:22,489 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:24,146 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:26,517 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:28,147 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:31,881 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:33,916 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:36,060 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:37,952 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:39,504 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:41,152 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:42,467 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:45,429 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:47,276 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:49,833 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:54,338 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:56,466 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:38:58,636 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:00,186 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:02,036 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:03,360 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:05,378 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:08,032 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:11,621 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:13,643 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:16,566 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:17,867 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:18,944 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:30,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:39:30,173 INFO L93 Difference]: Finished difference Result 10935 states and 14499 transitions. [2021-11-02 14:39:30,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 14:39:30,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 54 [2021-11-02 14:39:30,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:39:30,186 INFO L225 Difference]: With dead ends: 10935 [2021-11-02 14:39:30,186 INFO L226 Difference]: Without dead ends: 5515 [2021-11-02 14:39:30,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.13ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-02 14:39:30,190 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 2506 mSDsCounter, 0 mSdLazyCounter, 3364 mSolverCounterSat, 3 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 80853.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.06ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3364 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 82993.52ms IncrementalHoareTripleChecker+Time [2021-11-02 14:39:30,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 3380 Unknown, 0 Unchecked, 11.06ms Time], IncrementalHoareTripleChecker [3 Valid, 3364 Invalid, 13 Unknown, 0 Unchecked, 82993.52ms Time] [2021-11-02 14:39:30,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5515 states. [2021-11-02 14:39:30,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5515 to 5434. [2021-11-02 14:39:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5434 states, 5420 states have (on average 1.3280442804428045) internal successors, (7198), 5433 states have internal predecessors, (7198), 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-02 14:39:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5434 states to 5434 states and 7198 transitions. [2021-11-02 14:39:30,282 INFO L78 Accepts]: Start accepts. Automaton has 5434 states and 7198 transitions. Word has length 54 [2021-11-02 14:39:30,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:39:30,283 INFO L470 AbstractCegarLoop]: Abstraction has 5434 states and 7198 transitions. [2021-11-02 14:39:30,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-02 14:39:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 5434 states and 7198 transitions. [2021-11-02 14:39:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-02 14:39:30,285 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:39:30,285 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:39:30,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-02 14:39:30,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 14:39:30,502 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:39:30,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:39:30,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1265501204, now seen corresponding path program 1 times [2021-11-02 14:39:30,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:39:30,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689117551] [2021-11-02 14:39:30,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:39:30,503 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:39:30,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:39:30,504 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:39:30,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-02 14:39:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:39:31,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 14:39:31,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:39:31,196 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-02 14:39:31,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:39:31,316 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-02 14:39:31,316 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:39:31,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689117551] [2021-11-02 14:39:31,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689117551] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 14:39:31,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:39:31,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-02 14:39:31,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594870353] [2021-11-02 14:39:31,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 14:39:31,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:39:31,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 14:39:31,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:39:31,317 INFO L87 Difference]: Start difference. First operand 5434 states and 7198 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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-02 14:39:33,403 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:35,636 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:40,185 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:42,339 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:44,150 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:46,108 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:50,000 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:51,211 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:53,235 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:54,548 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:56,484 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:39:58,502 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:00,409 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:02,323 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:04,355 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:08,599 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:10,621 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:12,018 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:14,038 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:15,657 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:17,443 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:19,469 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:21,559 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:23,213 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:24,663 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:33,690 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:37,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:40:37,973 INFO L93 Difference]: Finished difference Result 10927 states and 14522 transitions. [2021-11-02 14:40:37,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 14:40:37,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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 63 [2021-11-02 14:40:37,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:40:37,999 INFO L225 Difference]: With dead ends: 10927 [2021-11-02 14:40:38,000 INFO L226 Difference]: Without dead ends: 5502 [2021-11-02 14:40:38,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.51ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 14:40:38,007 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 11 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64667.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.67ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66457.63ms IncrementalHoareTripleChecker+Time [2021-11-02 14:40:38,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 2533 Unknown, 0 Unchecked, 8.67ms Time], IncrementalHoareTripleChecker [11 Valid, 2513 Invalid, 9 Unknown, 0 Unchecked, 66457.63ms Time] [2021-11-02 14:40:38,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5502 states. [2021-11-02 14:40:38,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5502 to 5502. [2021-11-02 14:40:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5502 states, 5488 states have (on average 1.3239795918367347) internal successors, (7266), 5501 states have internal predecessors, (7266), 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-02 14:40:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5502 states to 5502 states and 7266 transitions. [2021-11-02 14:40:38,127 INFO L78 Accepts]: Start accepts. Automaton has 5502 states and 7266 transitions. Word has length 63 [2021-11-02 14:40:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:40:38,128 INFO L470 AbstractCegarLoop]: Abstraction has 5502 states and 7266 transitions. [2021-11-02 14:40:38,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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-02 14:40:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 5502 states and 7266 transitions. [2021-11-02 14:40:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-02 14:40:38,131 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:40:38,131 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-02 14:40:38,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-02 14:40:38,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 14:40:38,343 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:40:38,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:40:38,344 INFO L85 PathProgramCache]: Analyzing trace with hash 946886345, now seen corresponding path program 1 times [2021-11-02 14:40:38,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:40:38,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940154578] [2021-11-02 14:40:38,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 14:40:38,345 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:40:38,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:40:38,346 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:40:38,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-02 14:40:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 14:40:38,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-02 14:40:38,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:40:39,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 14:40:39,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:40:39,563 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 14:40:39,564 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:40:39,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940154578] [2021-11-02 14:40:39,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940154578] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 14:40:39,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 14:40:39,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-02 14:40:39,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717746738] [2021-11-02 14:40:39,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 14:40:39,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:40:39,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 14:40:39,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 14:40:39,566 INFO L87 Difference]: Start difference. First operand 5502 states and 7266 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-02 14:40:41,665 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:44,670 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:50,072 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:53,238 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:54,698 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:40:55,987 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:01,895 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:03,923 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:05,739 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:07,440 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:09,464 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:11,180 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:12,449 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:14,462 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:15,744 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:16,913 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:22,190 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:24,210 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:26,228 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:28,430 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:31,069 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:32,499 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:33,767 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:36,186 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:39,417 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:41,153 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:43,421 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:45,253 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:41:55,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 14:41:55,542 INFO L93 Difference]: Finished difference Result 11131 states and 14794 transitions. [2021-11-02 14:41:55,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 14:41:55,543 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-11-02 14:41:55,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 14:41:55,551 INFO L225 Difference]: With dead ends: 11131 [2021-11-02 14:41:55,551 INFO L226 Difference]: Without dead ends: 5638 [2021-11-02 14:41:55,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 383.15ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-02 14:41:55,557 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 2471 mSDsCounter, 0 mSdLazyCounter, 3367 mSolverCounterSat, 48 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 73198.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.97ms SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3367 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 75608.76ms IncrementalHoareTripleChecker+Time [2021-11-02 14:41:55,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 3426 Unknown, 0 Unchecked, 10.97ms Time], IncrementalHoareTripleChecker [48 Valid, 3367 Invalid, 11 Unknown, 0 Unchecked, 75608.76ms Time] [2021-11-02 14:41:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2021-11-02 14:41:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 5638. [2021-11-02 14:41:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5638 states, 5624 states have (on average 1.316145092460882) internal successors, (7402), 5637 states have internal predecessors, (7402), 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-02 14:41:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5638 states to 5638 states and 7402 transitions. [2021-11-02 14:41:55,655 INFO L78 Accepts]: Start accepts. Automaton has 5638 states and 7402 transitions. Word has length 66 [2021-11-02 14:41:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 14:41:55,655 INFO L470 AbstractCegarLoop]: Abstraction has 5638 states and 7402 transitions. [2021-11-02 14:41:55,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-02 14:41:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 5638 states and 7402 transitions. [2021-11-02 14:41:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-02 14:41:55,657 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 14:41:55,657 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 14:41:55,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-02 14:41:55,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 14:41:55,879 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-02 14:41:55,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 14:41:55,880 INFO L85 PathProgramCache]: Analyzing trace with hash -398302743, now seen corresponding path program 2 times [2021-11-02 14:41:55,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 14:41:55,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955220329] [2021-11-02 14:41:55,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 14:41:55,881 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 14:41:55,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 14:41:55,881 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 14:41:55,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-02 14:41:56,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-02 14:41:56,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 14:41:56,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 14:41:56,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 14:41:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-02 14:41:56,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 14:41:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-02 14:41:56,753 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 14:41:56,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955220329] [2021-11-02 14:41:56,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955220329] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 14:41:56,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 14:41:56,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 14:41:56,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312267833] [2021-11-02 14:41:56,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 14:41:56,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 14:41:56,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 14:41:56,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 14:41:56,754 INFO L87 Difference]: Start difference. First operand 5638 states and 7402 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 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-02 14:41:58,837 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:01,452 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:02,982 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:06,751 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:07,990 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:10,674 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:12,347 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:14,400 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:16,183 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:19,169 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:25,345 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:28,372 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:30,474 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:33,659 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:35,570 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:37,236 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 14:42:38,498 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15