./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 c36dfa3b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.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-c36dfa3 [2021-11-04 00:09:46,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 00:09:46,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 00:09:46,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 00:09:46,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 00:09:46,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 00:09:46,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 00:09:46,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 00:09:46,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 00:09:46,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 00:09:46,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 00:09:46,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 00:09:46,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 00:09:46,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 00:09:46,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 00:09:46,200 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 00:09:46,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 00:09:46,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 00:09:46,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 00:09:46,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 00:09:46,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 00:09:46,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 00:09:46,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 00:09:46,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 00:09:46,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 00:09:46,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 00:09:46,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 00:09:46,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 00:09:46,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 00:09:46,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 00:09:46,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 00:09:46,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 00:09:46,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 00:09:46,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 00:09:46,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 00:09:46,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 00:09:46,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 00:09:46,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 00:09:46,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 00:09:46,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 00:09:46,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 00:09:46,228 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-04 00:09:46,255 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 00:09:46,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 00:09:46,256 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 00:09:46,256 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 00:09:46,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 00:09:46,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 00:09:46,257 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 00:09:46,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 00:09:46,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-04 00:09:46,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 00:09:46,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 00:09:46,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 00:09:46,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 00:09:46,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 00:09:46,259 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 00:09:46,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 00:09:46,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 00:09:46,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 00:09:46,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 00:09:46,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 00:09:46,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 00:09:46,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 00:09:46,260 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 00:09:46,260 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-04 00:09:46,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-04 00:09:46,260 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 00:09:46,260 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 00:09:46,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 00:09:46,262 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 00:09:46,262 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-04 00:09:46,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 00:09:46,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 00:09:46,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 00:09:46,494 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 00:09:46,495 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 00:09:46,495 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-04 00:09:46,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1149e61cf/2c324c59e47f4938b8ad82b27d0ca26d/FLAG55e98242c [2021-11-04 00:09:47,111 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 00:09:47,112 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-04 00:09:47,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1149e61cf/2c324c59e47f4938b8ad82b27d0ca26d/FLAG55e98242c [2021-11-04 00:09:47,572 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1149e61cf/2c324c59e47f4938b8ad82b27d0ca26d [2021-11-04 00:09:47,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 00:09:47,575 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 00:09:47,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 00:09:47,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 00:09:47,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 00:09:47,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:09:47" (1/1) ... [2021-11-04 00:09:47,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7459111c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:47, skipping insertion in model container [2021-11-04 00:09:47,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:09:47" (1/1) ... [2021-11-04 00:09:47,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 00:09:47,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 00:09:48,455 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-04 00:09:48,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 00:09:48,518 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 00:09:48,712 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-04 00:09:48,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 00:09:48,926 INFO L208 MainTranslator]: Completed translation [2021-11-04 00:09:48,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:48 WrapperNode [2021-11-04 00:09:48,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 00:09:48,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 00:09:48,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 00:09:48,929 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 00:09:48,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:48" (1/1) ... [2021-11-04 00:09:48,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:48" (1/1) ... [2021-11-04 00:09:49,106 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 00:09:49,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 00:09:49,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 00:09:49,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 00:09:49,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:48" (1/1) ... [2021-11-04 00:09:49,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:48" (1/1) ... [2021-11-04 00:09:49,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:48" (1/1) ... [2021-11-04 00:09:49,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:48" (1/1) ... [2021-11-04 00:09:49,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:48" (1/1) ... [2021-11-04 00:09:49,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:48" (1/1) ... [2021-11-04 00:09:49,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:48" (1/1) ... [2021-11-04 00:09:49,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 00:09:49,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 00:09:49,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 00:09:49,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 00:09:49,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:48" (1/1) ... [2021-11-04 00:09:49,286 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 00:09:49,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 00:09:49,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-04 00:09:49,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-04 00:09:49,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-04 00:09:49,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-04 00:09:49,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-04 00:09:49,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-04 00:09:49,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-04 00:09:49,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-04 00:09:49,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 00:09:49,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 00:09:49,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 00:09:49,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 00:09:49,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 00:09:49,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-04 00:09:49,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-04 00:09:49,343 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-11-04 00:09:49,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 00:09:49,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 00:09:49,700 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-04 00:09:49,810 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-04 00:09:50,695 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##522: assume !false; [2021-11-04 00:09:50,695 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##521: assume false; [2021-11-04 00:09:50,695 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##41: assume !false; [2021-11-04 00:09:50,696 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume false; [2021-11-04 00:09:50,708 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 00:09:50,708 INFO L299 CfgBuilder]: Removed 647 assume(true) statements. [2021-11-04 00:09:50,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:09:50 BoogieIcfgContainer [2021-11-04 00:09:50,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 00:09:50,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 00:09:50,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 00:09:50,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 00:09:50,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 12:09:47" (1/3) ... [2021-11-04 00:09:50,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6425910c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:09:50, skipping insertion in model container [2021-11-04 00:09:50,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:09:48" (2/3) ... [2021-11-04 00:09:50,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6425910c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:09:50, skipping insertion in model container [2021-11-04 00:09:50,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:09:50" (3/3) ... [2021-11-04 00:09:50,716 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-04 00:09:50,719 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 00:09:50,720 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-11-04 00:09:50,759 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 00:09:50,765 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-04 00:09:50,765 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-11-04 00:09:50,791 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-04 00:09:50,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-04 00:09:50,795 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:09:50,795 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:09:50,796 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-04 00:09:50,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:09:50,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1802578412, now seen corresponding path program 1 times [2021-11-04 00:09:50,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:09:50,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507779394] [2021-11-04 00:09:50,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:09:50,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:09:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:09:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:09:51,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:09:51,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507779394] [2021-11-04 00:09:51,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507779394] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:09:51,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:09:51,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-04 00:09:51,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401491886] [2021-11-04 00:09:51,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:09:51,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:09:51,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:09:51,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:09:51,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:09:51,172 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-04 00:09:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:09:54,255 INFO L93 Difference]: Finished difference Result 2020 states and 2970 transitions. [2021-11-04 00:09:54,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:09:54,257 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-04 00:09:54,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:09:54,273 INFO L225 Difference]: With dead ends: 2020 [2021-11-04 00:09:54,273 INFO L226 Difference]: Without dead ends: 1312 [2021-11-04 00:09:54,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.50ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:09:54,280 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 836 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2596.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.34ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2955.47ms IncrementalHoareTripleChecker+Time [2021-11-04 00:09:54,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [836 Valid, 24 Invalid, 1721 Unknown, 0 Unchecked, 18.34ms Time], IncrementalHoareTripleChecker [13 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 2955.47ms Time] [2021-11-04 00:09:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2021-11-04 00:09:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1288. [2021-11-04 00:09:54,377 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-04 00:09:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1643 transitions. [2021-11-04 00:09:54,380 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1643 transitions. Word has length 11 [2021-11-04 00:09:54,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:09:54,381 INFO L470 AbstractCegarLoop]: Abstraction has 1288 states and 1643 transitions. [2021-11-04 00:09:54,381 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-04 00:09:54,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1643 transitions. [2021-11-04 00:09:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-04 00:09:54,381 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:09:54,382 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:09:54,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-04 00:09:54,382 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-04 00:09:54,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:09:54,383 INFO L85 PathProgramCache]: Analyzing trace with hash 45356904, now seen corresponding path program 1 times [2021-11-04 00:09:54,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:09:54,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171005569] [2021-11-04 00:09:54,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:09:54,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:09:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:09:54,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:09:54,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:09:54,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171005569] [2021-11-04 00:09:54,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171005569] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:09:54,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:09:54,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-04 00:09:54,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991843612] [2021-11-04 00:09:54,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:09:54,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:09:54,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:09:54,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:09:54,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:09:54,485 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-04 00:09:56,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:09:56,120 INFO L93 Difference]: Finished difference Result 1288 states and 1643 transitions. [2021-11-04 00:09:56,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:09:56,121 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-04 00:09:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:09:56,125 INFO L225 Difference]: With dead ends: 1288 [2021-11-04 00:09:56,125 INFO L226 Difference]: Without dead ends: 1283 [2021-11-04 00:09:56,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.29ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:09:56,128 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 835 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1415.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.15ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1565.90ms IncrementalHoareTripleChecker+Time [2021-11-04 00:09:56,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [835 Valid, 0 Invalid, 845 Unknown, 0 Unchecked, 2.15ms Time], IncrementalHoareTripleChecker [0 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1565.90ms Time] [2021-11-04 00:09:56,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2021-11-04 00:09:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2021-11-04 00:09:56,176 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-04 00:09:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1633 transitions. [2021-11-04 00:09:56,181 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1633 transitions. Word has length 12 [2021-11-04 00:09:56,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:09:56,182 INFO L470 AbstractCegarLoop]: Abstraction has 1283 states and 1633 transitions. [2021-11-04 00:09:56,182 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-04 00:09:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1633 transitions. [2021-11-04 00:09:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-04 00:09:56,184 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:09:56,184 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-04 00:09:56,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-04 00:09:56,190 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-04 00:09:56,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:09:56,190 INFO L85 PathProgramCache]: Analyzing trace with hash -965110428, now seen corresponding path program 1 times [2021-11-04 00:09:56,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:09:56,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935936637] [2021-11-04 00:09:56,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:09:56,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:09:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:09:56,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:09:56,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:09:56,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935936637] [2021-11-04 00:09:56,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935936637] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:09:56,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:09:56,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:09:56,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908269243] [2021-11-04 00:09:56,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:09:56,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:09:56,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:09:56,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:09:56,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:09:56,321 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-04 00:09:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:09:59,125 INFO L93 Difference]: Finished difference Result 3119 states and 4010 transitions. [2021-11-04 00:09:59,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:09:59,125 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-04 00:09:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:09:59,131 INFO L225 Difference]: With dead ends: 3119 [2021-11-04 00:09:59,131 INFO L226 Difference]: Without dead ends: 1844 [2021-11-04 00:09:59,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.33ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:09:59,135 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 768 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2480.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.01ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2721.67ms IncrementalHoareTripleChecker+Time [2021-11-04 00:09:59,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [768 Valid, 0 Invalid, 1285 Unknown, 0 Unchecked, 3.01ms Time], IncrementalHoareTripleChecker [5 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 2721.67ms Time] [2021-11-04 00:09:59,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2021-11-04 00:09:59,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1840. [2021-11-04 00:09:59,182 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-04 00:09:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2377 transitions. [2021-11-04 00:09:59,186 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2377 transitions. Word has length 35 [2021-11-04 00:09:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:09:59,186 INFO L470 AbstractCegarLoop]: Abstraction has 1840 states and 2377 transitions. [2021-11-04 00:09:59,186 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-04 00:09:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2377 transitions. [2021-11-04 00:09:59,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-04 00:09:59,194 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:09:59,195 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-04 00:09:59,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-04 00:09:59,195 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-04 00:09:59,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:09:59,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2056089327, now seen corresponding path program 1 times [2021-11-04 00:09:59,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:09:59,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208521853] [2021-11-04 00:09:59,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:09:59,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:09:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:09:59,306 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-04 00:09:59,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:09:59,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208521853] [2021-11-04 00:09:59,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208521853] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:09:59,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:09:59,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 00:09:59,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004194082] [2021-11-04 00:09:59,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:09:59,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:09:59,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:09:59,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:09:59,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:09:59,310 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-04 00:10:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:10:03,719 INFO L93 Difference]: Finished difference Result 3679 states and 4752 transitions. [2021-11-04 00:10:03,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:10:03,719 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-04 00:10:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:10:03,725 INFO L225 Difference]: With dead ends: 3679 [2021-11-04 00:10:03,725 INFO L226 Difference]: Without dead ends: 1842 [2021-11-04 00:10:03,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.24ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:10:03,734 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 2525 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3955.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.43ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4311.61ms IncrementalHoareTripleChecker+Time [2021-11-04 00:10:03,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 2528 Unknown, 0 Unchecked, 5.43ms Time], IncrementalHoareTripleChecker [3 Valid, 2525 Invalid, 0 Unknown, 0 Unchecked, 4311.61ms Time] [2021-11-04 00:10:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2021-11-04 00:10:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1838. [2021-11-04 00:10:03,771 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-04 00:10:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2371 transitions. [2021-11-04 00:10:03,773 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2371 transitions. Word has length 53 [2021-11-04 00:10:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:10:03,774 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2371 transitions. [2021-11-04 00:10:03,774 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-04 00:10:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2371 transitions. [2021-11-04 00:10:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-04 00:10:03,775 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:10:03,776 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-04 00:10:03,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-04 00:10:03,776 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-04 00:10:03,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:10:03,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1050619864, now seen corresponding path program 1 times [2021-11-04 00:10:03,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:10:03,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399523222] [2021-11-04 00:10:03,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:10:03,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:10:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:10:03,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:10:03,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:10:03,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399523222] [2021-11-04 00:10:03,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399523222] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:10:03,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:10:03,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:10:03,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846236815] [2021-11-04 00:10:03,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:10:03,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:10:03,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:10:03,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:10:03,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:10:03,928 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-04 00:10:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:10:12,492 INFO L93 Difference]: Finished difference Result 5464 states and 7047 transitions. [2021-11-04 00:10:12,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 00:10:12,492 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-04 00:10:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:10:12,524 INFO L225 Difference]: With dead ends: 5464 [2021-11-04 00:10:12,525 INFO L226 Difference]: Without dead ends: 3632 [2021-11-04 00:10:12,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.08ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:10:12,547 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 817 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 4522 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7727.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.03ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8403.11ms IncrementalHoareTripleChecker+Time [2021-11-04 00:10:12,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [817 Valid, 0 Invalid, 4528 Unknown, 0 Unchecked, 12.03ms Time], IncrementalHoareTripleChecker [6 Valid, 4522 Invalid, 0 Unknown, 0 Unchecked, 8403.11ms Time] [2021-11-04 00:10:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3632 states. [2021-11-04 00:10:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 1841. [2021-11-04 00:10:12,622 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-04 00:10:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2373 transitions. [2021-11-04 00:10:12,624 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2373 transitions. Word has length 78 [2021-11-04 00:10:12,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:10:12,626 INFO L470 AbstractCegarLoop]: Abstraction has 1841 states and 2373 transitions. [2021-11-04 00:10:12,627 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-04 00:10:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2373 transitions. [2021-11-04 00:10:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-04 00:10:12,628 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:10:12,629 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-04 00:10:12,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-04 00:10:12,629 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-04 00:10:12,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:10:12,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1494520538, now seen corresponding path program 1 times [2021-11-04 00:10:12,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:10:12,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048458613] [2021-11-04 00:10:12,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:10:12,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:10:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:10:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:10:12,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:10:12,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048458613] [2021-11-04 00:10:12,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048458613] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:10:12,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:10:12,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:10:12,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407455814] [2021-11-04 00:10:12,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:10:12,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:10:12,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:10:12,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:10:12,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:10:12,775 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-04 00:10:22,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:10:22,911 INFO L93 Difference]: Finished difference Result 5587 states and 7218 transitions. [2021-11-04 00:10:22,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 00:10:22,912 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-04 00:10:22,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:10:22,921 INFO L225 Difference]: With dead ends: 5587 [2021-11-04 00:10:22,921 INFO L226 Difference]: Without dead ends: 3755 [2021-11-04 00:10:22,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 19.58ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-04 00:10:22,925 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3573 mSDsluCounter, 3748 mSDsCounter, 0 mSdLazyCounter, 5569 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9147.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3573 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.44ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 5569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9952.36ms IncrementalHoareTripleChecker+Time [2021-11-04 00:10:22,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3573 Valid, 0 Invalid, 5583 Unknown, 0 Unchecked, 15.44ms Time], IncrementalHoareTripleChecker [14 Valid, 5569 Invalid, 0 Unknown, 0 Unchecked, 9952.36ms Time] [2021-11-04 00:10:22,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2021-11-04 00:10:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 1853. [2021-11-04 00:10:22,972 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-04 00:10:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2385 transitions. [2021-11-04 00:10:22,975 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2385 transitions. Word has length 78 [2021-11-04 00:10:22,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:10:22,975 INFO L470 AbstractCegarLoop]: Abstraction has 1853 states and 2385 transitions. [2021-11-04 00:10:22,975 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-04 00:10:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2385 transitions. [2021-11-04 00:10:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-04 00:10:22,976 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:10:22,977 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-04 00:10:22,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-04 00:10:22,977 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-04 00:10:22,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:10:22,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1517152792, now seen corresponding path program 1 times [2021-11-04 00:10:22,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:10:22,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817485578] [2021-11-04 00:10:22,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:10:22,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:10:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:10:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:10:23,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:10:23,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817485578] [2021-11-04 00:10:23,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817485578] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:10:23,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:10:23,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:10:23,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805670143] [2021-11-04 00:10:23,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:10:23,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:10:23,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:10:23,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:10:23,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:10:23,088 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-04 00:10:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:10:32,439 INFO L93 Difference]: Finished difference Result 3616 states and 4663 transitions. [2021-11-04 00:10:32,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 00:10:32,440 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-04 00:10:32,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:10:32,451 INFO L225 Difference]: With dead ends: 3616 [2021-11-04 00:10:32,455 INFO L226 Difference]: Without dead ends: 3554 [2021-11-04 00:10:32,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 23.72ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:10:32,458 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 725 mSDsluCounter, 3059 mSDsCounter, 0 mSdLazyCounter, 5510 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8418.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.32ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 5510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9164.30ms IncrementalHoareTripleChecker+Time [2021-11-04 00:10:32,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [725 Valid, 0 Invalid, 5525 Unknown, 0 Unchecked, 10.32ms Time], IncrementalHoareTripleChecker [15 Valid, 5510 Invalid, 0 Unknown, 0 Unchecked, 9164.30ms Time] [2021-11-04 00:10:32,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2021-11-04 00:10:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 1853. [2021-11-04 00:10:32,513 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-04 00:10:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2383 transitions. [2021-11-04 00:10:32,516 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2383 transitions. Word has length 78 [2021-11-04 00:10:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:10:32,516 INFO L470 AbstractCegarLoop]: Abstraction has 1853 states and 2383 transitions. [2021-11-04 00:10:32,516 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-04 00:10:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2383 transitions. [2021-11-04 00:10:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-04 00:10:32,517 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:10:32,518 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-04 00:10:32,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-04 00:10:32,518 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-04 00:10:32,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:10:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash 948357624, now seen corresponding path program 1 times [2021-11-04 00:10:32,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:10:32,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294223867] [2021-11-04 00:10:32,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:10:32,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:10:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:10:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:10:32,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:10:32,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294223867] [2021-11-04 00:10:32,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294223867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:10:32,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:10:32,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:10:32,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198526272] [2021-11-04 00:10:32,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:10:32,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:10:32,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:10:32,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:10:32,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:10:32,643 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-04 00:10:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:10:37,880 INFO L93 Difference]: Finished difference Result 2830 states and 3618 transitions. [2021-11-04 00:10:37,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:10:37,880 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-04 00:10:37,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:10:37,888 INFO L225 Difference]: With dead ends: 2830 [2021-11-04 00:10:37,888 INFO L226 Difference]: Without dead ends: 2806 [2021-11-04 00:10:37,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.16ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:10:37,889 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1514 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 3277 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4651.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.31ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5122.63ms IncrementalHoareTripleChecker+Time [2021-11-04 00:10:37,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1514 Valid, 0 Invalid, 3307 Unknown, 0 Unchecked, 5.31ms Time], IncrementalHoareTripleChecker [30 Valid, 3277 Invalid, 0 Unknown, 0 Unchecked, 5122.63ms Time] [2021-11-04 00:10:37,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2021-11-04 00:10:37,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2756. [2021-11-04 00:10:37,984 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-04 00:10:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 3557 transitions. [2021-11-04 00:10:37,989 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 3557 transitions. Word has length 79 [2021-11-04 00:10:37,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:10:37,990 INFO L470 AbstractCegarLoop]: Abstraction has 2756 states and 3557 transitions. [2021-11-04 00:10:37,990 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-04 00:10:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3557 transitions. [2021-11-04 00:10:37,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-04 00:10:37,991 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:10:37,991 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-04 00:10:37,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-04 00:10:37,992 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-04 00:10:37,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:10:37,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1804226248, now seen corresponding path program 1 times [2021-11-04 00:10:37,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:10:37,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176950093] [2021-11-04 00:10:37,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:10:37,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:10:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:10:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:10:38,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:10:38,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176950093] [2021-11-04 00:10:38,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176950093] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:10:38,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:10:38,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:10:38,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112669519] [2021-11-04 00:10:38,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:10:38,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:10:38,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:10:38,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:10:38,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:10:38,188 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-04 00:10:46,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:10:46,664 INFO L93 Difference]: Finished difference Result 6794 states and 8773 transitions. [2021-11-04 00:10:46,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 00:10:46,664 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-04 00:10:46,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:10:46,675 INFO L225 Difference]: With dead ends: 6794 [2021-11-04 00:10:46,675 INFO L226 Difference]: Without dead ends: 3952 [2021-11-04 00:10:46,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 37.36ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-04 00:10:46,680 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 802 mSDsluCounter, 3013 mSDsCounter, 0 mSdLazyCounter, 4618 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7600.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.14ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8239.24ms IncrementalHoareTripleChecker+Time [2021-11-04 00:10:46,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [802 Valid, 0 Invalid, 4623 Unknown, 0 Unchecked, 7.14ms Time], IncrementalHoareTripleChecker [5 Valid, 4618 Invalid, 0 Unknown, 0 Unchecked, 8239.24ms Time] [2021-11-04 00:10:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2021-11-04 00:10:46,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 2144. [2021-11-04 00:10:46,750 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-04 00:10:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 2776 transitions. [2021-11-04 00:10:46,753 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 2776 transitions. Word has length 79 [2021-11-04 00:10:46,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:10:46,754 INFO L470 AbstractCegarLoop]: Abstraction has 2144 states and 2776 transitions. [2021-11-04 00:10:46,754 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-04 00:10:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 2776 transitions. [2021-11-04 00:10:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-04 00:10:46,755 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:10:46,755 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-04 00:10:46,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-04 00:10:46,755 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-04 00:10:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:10:46,756 INFO L85 PathProgramCache]: Analyzing trace with hash 559162765, now seen corresponding path program 1 times [2021-11-04 00:10:46,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:10:46,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829298107] [2021-11-04 00:10:46,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:10:46,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:10:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:10:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:10:46,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:10:46,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829298107] [2021-11-04 00:10:46,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829298107] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:10:46,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:10:46,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:10:46,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025214849] [2021-11-04 00:10:46,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:10:46,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:10:46,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:10:46,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:10:46,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:10:46,860 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-04 00:10:56,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:10:56,360 INFO L93 Difference]: Finished difference Result 3914 states and 5068 transitions. [2021-11-04 00:10:56,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 00:10:56,360 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-04 00:10:56,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:10:56,377 INFO L225 Difference]: With dead ends: 3914 [2021-11-04 00:10:56,379 INFO L226 Difference]: Without dead ends: 3859 [2021-11-04 00:10:56,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 23.32ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:10:56,380 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 726 mSDsluCounter, 3049 mSDsCounter, 0 mSdLazyCounter, 5496 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8598.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.48ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 5496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9321.44ms IncrementalHoareTripleChecker+Time [2021-11-04 00:10:56,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [726 Valid, 0 Invalid, 5513 Unknown, 0 Unchecked, 8.48ms Time], IncrementalHoareTripleChecker [17 Valid, 5496 Invalid, 0 Unknown, 0 Unchecked, 9321.44ms Time] [2021-11-04 00:10:56,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3859 states. [2021-11-04 00:10:56,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3859 to 2149. [2021-11-04 00:10:56,470 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-04 00:10:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 2780 transitions. [2021-11-04 00:10:56,473 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 2780 transitions. Word has length 85 [2021-11-04 00:10:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:10:56,474 INFO L470 AbstractCegarLoop]: Abstraction has 2149 states and 2780 transitions. [2021-11-04 00:10:56,474 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-04 00:10:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2780 transitions. [2021-11-04 00:10:56,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-04 00:10:56,475 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:10:56,475 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-04 00:10:56,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-04 00:10:56,476 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-04 00:10:56,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:10:56,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1810418226, now seen corresponding path program 1 times [2021-11-04 00:10:56,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:10:56,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087726825] [2021-11-04 00:10:56,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:10:56,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:10:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:10:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:10:56,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:10:56,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087726825] [2021-11-04 00:10:56,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087726825] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:10:56,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:10:56,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:10:56,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973832762] [2021-11-04 00:10:56,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:10:56,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:10:56,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:10:56,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:10:56,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:10:56,655 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-04 00:11:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:05,334 INFO L93 Difference]: Finished difference Result 5857 states and 7558 transitions. [2021-11-04 00:11:05,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 00:11:05,334 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-04 00:11:05,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:05,342 INFO L225 Difference]: With dead ends: 5857 [2021-11-04 00:11:05,342 INFO L226 Difference]: Without dead ends: 3975 [2021-11-04 00:11:05,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.11ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-04 00:11:05,349 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 817 mSDsluCounter, 2971 mSDsCounter, 0 mSdLazyCounter, 4547 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7859.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.73ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 4547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8485.36ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:05,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [817 Valid, 0 Invalid, 4555 Unknown, 0 Unchecked, 6.73ms Time], IncrementalHoareTripleChecker [8 Valid, 4547 Invalid, 0 Unknown, 0 Unchecked, 8485.36ms Time] [2021-11-04 00:11:05,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2021-11-04 00:11:05,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 2169. [2021-11-04 00:11:05,449 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-04 00:11:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2803 transitions. [2021-11-04 00:11:05,451 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2803 transitions. Word has length 86 [2021-11-04 00:11:05,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:05,451 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 2803 transitions. [2021-11-04 00:11:05,451 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-04 00:11:05,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2803 transitions. [2021-11-04 00:11:05,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-04 00:11:05,452 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:05,452 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-04 00:11:05,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-04 00:11:05,453 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-04 00:11:05,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:05,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1782949196, now seen corresponding path program 1 times [2021-11-04 00:11:05,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:05,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315783540] [2021-11-04 00:11:05,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:05,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:05,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:05,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315783540] [2021-11-04 00:11:05,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315783540] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:05,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:05,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:11:05,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074862509] [2021-11-04 00:11:05,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:05,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:11:05,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:05,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:11:05,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:11:05,543 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-04 00:11:16,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:16,116 INFO L93 Difference]: Finished difference Result 7126 states and 9227 transitions. [2021-11-04 00:11:16,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 00:11:16,117 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-04 00:11:16,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:16,125 INFO L225 Difference]: With dead ends: 7126 [2021-11-04 00:11:16,125 INFO L226 Difference]: Without dead ends: 5242 [2021-11-04 00:11:16,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 26.85ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-04 00:11:16,129 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3691 mSDsluCounter, 3632 mSDsCounter, 0 mSdLazyCounter, 4930 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9488.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3691 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.73ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10270.79ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:16,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3691 Valid, 0 Invalid, 4946 Unknown, 0 Unchecked, 11.73ms Time], IncrementalHoareTripleChecker [16 Valid, 4930 Invalid, 0 Unknown, 0 Unchecked, 10270.79ms Time] [2021-11-04 00:11:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2021-11-04 00:11:16,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 2169. [2021-11-04 00:11:16,250 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-04 00:11:16,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2793 transitions. [2021-11-04 00:11:16,252 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2793 transitions. Word has length 86 [2021-11-04 00:11:16,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:16,253 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 2793 transitions. [2021-11-04 00:11:16,253 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-04 00:11:16,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2793 transitions. [2021-11-04 00:11:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-04 00:11:16,254 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:16,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] [2021-11-04 00:11:16,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-04 00:11:16,254 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-04 00:11:16,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:16,255 INFO L85 PathProgramCache]: Analyzing trace with hash 268034802, now seen corresponding path program 1 times [2021-11-04 00:11:16,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:16,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981956182] [2021-11-04 00:11:16,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:16,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:16,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:16,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981956182] [2021-11-04 00:11:16,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981956182] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:16,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:16,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 00:11:16,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514396374] [2021-11-04 00:11:16,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:16,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:11:16,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:16,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:11:16,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:11:16,361 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-04 00:11:23,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:23,866 INFO L93 Difference]: Finished difference Result 3541 states and 4547 transitions. [2021-11-04 00:11:23,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 00:11:23,866 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-04 00:11:23,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:23,873 INFO L225 Difference]: With dead ends: 3541 [2021-11-04 00:11:23,873 INFO L226 Difference]: Without dead ends: 3486 [2021-11-04 00:11:23,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.27ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:11:23,877 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1613 mSDsluCounter, 2787 mSDsCounter, 0 mSdLazyCounter, 4146 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6658.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.55ms SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 4146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7295.34ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:23,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1613 Valid, 0 Invalid, 4185 Unknown, 0 Unchecked, 7.55ms Time], IncrementalHoareTripleChecker [39 Valid, 4146 Invalid, 0 Unknown, 0 Unchecked, 7295.34ms Time] [2021-11-04 00:11:23,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2021-11-04 00:11:23,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 2214. [2021-11-04 00:11:24,002 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-04 00:11:24,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 2845 transitions. [2021-11-04 00:11:24,005 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 2845 transitions. Word has length 86 [2021-11-04 00:11:24,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:24,006 INFO L470 AbstractCegarLoop]: Abstraction has 2214 states and 2845 transitions. [2021-11-04 00:11:24,006 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-04 00:11:24,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2845 transitions. [2021-11-04 00:11:24,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-04 00:11:24,031 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:24,031 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-04 00:11:24,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-04 00:11:24,032 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-04 00:11:24,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:24,033 INFO L85 PathProgramCache]: Analyzing trace with hash -642776665, now seen corresponding path program 1 times [2021-11-04 00:11:24,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:24,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357230440] [2021-11-04 00:11:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:24,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:24,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:24,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:24,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357230440] [2021-11-04 00:11:24,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357230440] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:24,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:24,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:11:24,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292131036] [2021-11-04 00:11:24,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:24,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:11:24,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:24,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:11:24,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:11:24,199 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-04 00:11:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:33,563 INFO L93 Difference]: Finished difference Result 4028 states and 5175 transitions. [2021-11-04 00:11:33,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 00:11:33,563 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-04 00:11:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:33,569 INFO L225 Difference]: With dead ends: 4028 [2021-11-04 00:11:33,570 INFO L226 Difference]: Without dead ends: 3967 [2021-11-04 00:11:33,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 22.68ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:11:33,571 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 728 mSDsluCounter, 3048 mSDsCounter, 0 mSdLazyCounter, 5495 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8395.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.86ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9093.33ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:33,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [728 Valid, 0 Invalid, 5513 Unknown, 0 Unchecked, 8.86ms Time], IncrementalHoareTripleChecker [18 Valid, 5495 Invalid, 0 Unknown, 0 Unchecked, 9093.33ms Time] [2021-11-04 00:11:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3967 states. [2021-11-04 00:11:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 2225. [2021-11-04 00:11:33,698 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-04 00:11:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 2857 transitions. [2021-11-04 00:11:33,700 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 2857 transitions. Word has length 92 [2021-11-04 00:11:33,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:33,700 INFO L470 AbstractCegarLoop]: Abstraction has 2225 states and 2857 transitions. [2021-11-04 00:11:33,700 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-04 00:11:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2857 transitions. [2021-11-04 00:11:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-04 00:11:33,701 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:33,702 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-04 00:11:33,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-04 00:11:33,702 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-04 00:11:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2144683865, now seen corresponding path program 1 times [2021-11-04 00:11:33,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:33,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681968776] [2021-11-04 00:11:33,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:33,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:33,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:33,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:33,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681968776] [2021-11-04 00:11:33,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681968776] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:33,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:33,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:11:33,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345320273] [2021-11-04 00:11:33,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:33,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:11:33,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:33,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:11:33,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:11:33,822 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-04 00:11:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:42,793 INFO L93 Difference]: Finished difference Result 6090 states and 7800 transitions. [2021-11-04 00:11:42,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 00:11:42,794 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-04 00:11:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:42,800 INFO L225 Difference]: With dead ends: 6090 [2021-11-04 00:11:42,801 INFO L226 Difference]: Without dead ends: 4138 [2021-11-04 00:11:42,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.20ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-04 00:11:42,804 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 839 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 4568 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8015.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.94ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8674.72ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:42,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [839 Valid, 0 Invalid, 4575 Unknown, 0 Unchecked, 7.94ms Time], IncrementalHoareTripleChecker [7 Valid, 4568 Invalid, 0 Unknown, 0 Unchecked, 8674.72ms Time] [2021-11-04 00:11:42,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2021-11-04 00:11:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2236. [2021-11-04 00:11:42,941 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-04 00:11:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2869 transitions. [2021-11-04 00:11:42,943 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2869 transitions. Word has length 93 [2021-11-04 00:11:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:42,944 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 2869 transitions. [2021-11-04 00:11:42,944 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-04 00:11:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2869 transitions. [2021-11-04 00:11:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-04 00:11:42,945 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:42,945 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-04 00:11:42,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-04 00:11:42,946 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-04 00:11:42,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:42,946 INFO L85 PathProgramCache]: Analyzing trace with hash 607900007, now seen corresponding path program 1 times [2021-11-04 00:11:42,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:42,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492252078] [2021-11-04 00:11:42,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:42,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:43,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:43,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492252078] [2021-11-04 00:11:43,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492252078] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:43,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:43,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:11:43,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061440489] [2021-11-04 00:11:43,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:43,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 00:11:43,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:43,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 00:11:43,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-04 00:11:43,059 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-04 00:11:50,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:50,663 INFO L93 Difference]: Finished difference Result 4362 states and 5593 transitions. [2021-11-04 00:11:50,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 00:11:50,664 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-04 00:11:50,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:50,671 INFO L225 Difference]: With dead ends: 4362 [2021-11-04 00:11:50,671 INFO L226 Difference]: Without dead ends: 4243 [2021-11-04 00:11:50,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.42ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-04 00:11:50,673 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4100 mSDsluCounter, 2544 mSDsCounter, 0 mSdLazyCounter, 3921 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6602.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.47ms SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 3921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7272.46ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:50,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4100 Valid, 0 Invalid, 3996 Unknown, 0 Unchecked, 10.47ms Time], IncrementalHoareTripleChecker [75 Valid, 3921 Invalid, 0 Unknown, 0 Unchecked, 7272.46ms Time] [2021-11-04 00:11:50,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4243 states. [2021-11-04 00:11:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4243 to 2245. [2021-11-04 00:11:50,810 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-04 00:11:50,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 2879 transitions. [2021-11-04 00:11:50,814 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 2879 transitions. Word has length 93 [2021-11-04 00:11:50,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:50,816 INFO L470 AbstractCegarLoop]: Abstraction has 2245 states and 2879 transitions. [2021-11-04 00:11:50,816 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-04 00:11:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 2879 transitions. [2021-11-04 00:11:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-04 00:11:50,817 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:50,817 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-04 00:11:50,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-04 00:11:50,818 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-04 00:11:50,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:50,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1307096688, now seen corresponding path program 1 times [2021-11-04 00:11:50,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:50,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884163800] [2021-11-04 00:11:50,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:50,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:50,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:50,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884163800] [2021-11-04 00:11:50,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884163800] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:50,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:50,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:11:50,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988864630] [2021-11-04 00:11:50,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:50,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:11:50,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:50,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:11:50,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:11:50,932 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-04 00:11:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:11:55,805 INFO L93 Difference]: Finished difference Result 4141 states and 5304 transitions. [2021-11-04 00:11:55,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:11:55,805 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-04 00:11:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:11:55,808 INFO L225 Difference]: With dead ends: 4141 [2021-11-04 00:11:55,808 INFO L226 Difference]: Without dead ends: 2190 [2021-11-04 00:11:55,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.16ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:11:55,811 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 782 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 2283 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4194.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.55ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4640.15ms IncrementalHoareTripleChecker+Time [2021-11-04 00:11:55,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [782 Valid, 0 Invalid, 2305 Unknown, 0 Unchecked, 3.55ms Time], IncrementalHoareTripleChecker [22 Valid, 2283 Invalid, 0 Unknown, 0 Unchecked, 4640.15ms Time] [2021-11-04 00:11:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2021-11-04 00:11:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2180. [2021-11-04 00:11:55,937 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-04 00:11:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 2781 transitions. [2021-11-04 00:11:55,940 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 2781 transitions. Word has length 98 [2021-11-04 00:11:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:11:55,941 INFO L470 AbstractCegarLoop]: Abstraction has 2180 states and 2781 transitions. [2021-11-04 00:11:55,941 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-04 00:11:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2781 transitions. [2021-11-04 00:11:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-04 00:11:55,953 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:11:55,953 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-04 00:11:55,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-04 00:11:55,954 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-04 00:11:55,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:11:55,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1984260860, now seen corresponding path program 1 times [2021-11-04 00:11:55,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:11:55,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609853711] [2021-11-04 00:11:55,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:11:55,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:11:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:11:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:11:56,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:11:56,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609853711] [2021-11-04 00:11:56,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609853711] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:11:56,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:11:56,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:11:56,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28519796] [2021-11-04 00:11:56,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:11:56,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:11:56,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:11:56,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:11:56,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:11:56,041 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-04 00:12:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:12:01,598 INFO L93 Difference]: Finished difference Result 2190 states and 2788 transitions. [2021-11-04 00:12:01,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 00:12:01,599 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-04 00:12:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:12:01,601 INFO L225 Difference]: With dead ends: 2190 [2021-11-04 00:12:01,601 INFO L226 Difference]: Without dead ends: 2156 [2021-11-04 00:12:01,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.63ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-04 00:12:01,602 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 3276 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4912.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.13ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5357.13ms IncrementalHoareTripleChecker+Time [2021-11-04 00:12:01,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 3277 Unknown, 0 Unchecked, 5.13ms Time], IncrementalHoareTripleChecker [1 Valid, 3276 Invalid, 0 Unknown, 0 Unchecked, 5357.13ms Time] [2021-11-04 00:12:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2021-11-04 00:12:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2152. [2021-11-04 00:12:01,715 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-04 00:12:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2751 transitions. [2021-11-04 00:12:01,718 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2751 transitions. Word has length 99 [2021-11-04 00:12:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:12:01,718 INFO L470 AbstractCegarLoop]: Abstraction has 2152 states and 2751 transitions. [2021-11-04 00:12:01,718 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-04 00:12:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2751 transitions. [2021-11-04 00:12:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-04 00:12:01,719 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:12:01,719 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-04 00:12:01,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-04 00:12:01,720 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-04 00:12:01,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:12:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash 973251299, now seen corresponding path program 1 times [2021-11-04 00:12:01,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:12:01,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102880617] [2021-11-04 00:12:01,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:12:01,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:12:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:12:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:12:01,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:12:01,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102880617] [2021-11-04 00:12:01,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102880617] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:12:01,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:12:01,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 00:12:01,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275508156] [2021-11-04 00:12:01,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:12:01,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:12:01,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:12:01,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:12:01,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:12:01,800 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-04 00:12:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:12:05,749 INFO L93 Difference]: Finished difference Result 2160 states and 2757 transitions. [2021-11-04 00:12:05,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:12:05,749 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-04 00:12:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:12:05,752 INFO L225 Difference]: With dead ends: 2160 [2021-11-04 00:12:05,752 INFO L226 Difference]: Without dead ends: 2156 [2021-11-04 00:12:05,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.92ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:12:05,753 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1236 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3445.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.40ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3781.86ms IncrementalHoareTripleChecker+Time [2021-11-04 00:12:05,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1236 Valid, 0 Invalid, 1958 Unknown, 0 Unchecked, 4.40ms Time], IncrementalHoareTripleChecker [2 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 3781.86ms Time] [2021-11-04 00:12:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2021-11-04 00:12:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2152. [2021-11-04 00:12:05,911 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-04 00:12:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2749 transitions. [2021-11-04 00:12:05,913 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2749 transitions. Word has length 126 [2021-11-04 00:12:05,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:12:05,914 INFO L470 AbstractCegarLoop]: Abstraction has 2152 states and 2749 transitions. [2021-11-04 00:12:05,914 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-04 00:12:05,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2749 transitions. [2021-11-04 00:12:05,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-04 00:12:05,915 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:12:05,915 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-04 00:12:05,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-04 00:12:05,916 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-04 00:12:05,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:12:05,916 INFO L85 PathProgramCache]: Analyzing trace with hash 451476494, now seen corresponding path program 1 times [2021-11-04 00:12:05,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:12:05,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193216697] [2021-11-04 00:12:05,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:12:05,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:12:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:12:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:12:06,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:12:06,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193216697] [2021-11-04 00:12:06,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193216697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:12:06,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:12:06,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 00:12:06,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417898762] [2021-11-04 00:12:06,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:12:06,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:12:06,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:12:06,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:12:06,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:12:06,039 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-04 00:12:11,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:12:11,540 INFO L93 Difference]: Finished difference Result 4067 states and 5172 transitions. [2021-11-04 00:12:11,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 00:12:11,541 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-04 00:12:11,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:12:11,543 INFO L225 Difference]: With dead ends: 4067 [2021-11-04 00:12:11,543 INFO L226 Difference]: Without dead ends: 2201 [2021-11-04 00:12:11,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.73ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:12:11,545 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 3269 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4869.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.89ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5289.57ms IncrementalHoareTripleChecker+Time [2021-11-04 00:12:11,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 3273 Unknown, 0 Unchecked, 4.89ms Time], IncrementalHoareTripleChecker [4 Valid, 3269 Invalid, 0 Unknown, 0 Unchecked, 5289.57ms Time] [2021-11-04 00:12:11,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2021-11-04 00:12:11,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 2154. [2021-11-04 00:12:11,659 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-04 00:12:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2752 transitions. [2021-11-04 00:12:11,661 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2752 transitions. Word has length 131 [2021-11-04 00:12:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:12:11,662 INFO L470 AbstractCegarLoop]: Abstraction has 2154 states and 2752 transitions. [2021-11-04 00:12:11,662 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-04 00:12:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2752 transitions. [2021-11-04 00:12:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-04 00:12:11,663 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:12:11,663 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-04 00:12:11,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-04 00:12:11,663 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-04 00:12:11,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:12:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash -555431090, now seen corresponding path program 1 times [2021-11-04 00:12:11,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:12:11,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152486668] [2021-11-04 00:12:11,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:12:11,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:12:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:12:11,777 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-04 00:12:11,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:12:11,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152486668] [2021-11-04 00:12:11,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152486668] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 00:12:11,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055792260] [2021-11-04 00:12:11,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:12:11,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 00:12:11,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 00:12:11,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-04 00:12:11,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-04 00:12:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:12:12,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 2217 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-04 00:12:12,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:12:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:12:12,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-04 00:12:12,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055792260] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:12:12,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-04 00:12:12,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-04 00:12:12,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193498911] [2021-11-04 00:12:12,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:12:12,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:12:12,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:12:12,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:12:12,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:12:12,564 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-04 00:12:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:12:16,656 INFO L93 Difference]: Finished difference Result 4018 states and 5120 transitions. [2021-11-04 00:12:16,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:12:16,657 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-04 00:12:16,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:12:16,659 INFO L225 Difference]: With dead ends: 4018 [2021-11-04 00:12:16,659 INFO L226 Difference]: Without dead ends: 2158 [2021-11-04 00:12:16,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.06ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:12:16,662 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1063 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3564.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.60ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3913.37ms IncrementalHoareTripleChecker+Time [2021-11-04 00:12:16,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1063 Valid, 0 Invalid, 1967 Unknown, 0 Unchecked, 3.60ms Time], IncrementalHoareTripleChecker [3 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 3913.37ms Time] [2021-11-04 00:12:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2021-11-04 00:12:16,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2154. [2021-11-04 00:12:16,808 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-04 00:12:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2748 transitions. [2021-11-04 00:12:16,810 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2748 transitions. Word has length 131 [2021-11-04 00:12:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:12:16,810 INFO L470 AbstractCegarLoop]: Abstraction has 2154 states and 2748 transitions. [2021-11-04 00:12:16,811 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-04 00:12:16,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2748 transitions. [2021-11-04 00:12:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-04 00:12:16,812 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:12:16,812 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-04 00:12:16,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-04 00:12:17,027 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-04 00:12:17,027 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-04 00:12:17,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:12:17,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1591853852, now seen corresponding path program 1 times [2021-11-04 00:12:17,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:12:17,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921399726] [2021-11-04 00:12:17,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:12:17,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:12:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:12:17,133 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-04 00:12:17,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 00:12:17,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921399726] [2021-11-04 00:12:17,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921399726] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 00:12:17,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:12:17,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 00:12:17,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666874796] [2021-11-04 00:12:17,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 00:12:17,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:12:17,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 00:12:17,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:12:17,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:12:17,136 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-04 00:12:21,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:12:21,385 INFO L93 Difference]: Finished difference Result 4077 states and 5182 transitions. [2021-11-04 00:12:21,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:12:21,386 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-04 00:12:21,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:12:21,389 INFO L225 Difference]: With dead ends: 4077 [2021-11-04 00:12:21,389 INFO L226 Difference]: Without dead ends: 2217 [2021-11-04 00:12:21,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.41ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:12:21,392 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 720 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3696.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.71ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4044.13ms IncrementalHoareTripleChecker+Time [2021-11-04 00:12:21,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [720 Valid, 0 Invalid, 1793 Unknown, 0 Unchecked, 2.71ms Time], IncrementalHoareTripleChecker [28 Valid, 1765 Invalid, 0 Unknown, 0 Unchecked, 4044.13ms Time] [2021-11-04 00:12:21,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2021-11-04 00:12:21,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2124. [2021-11-04 00:12:21,528 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-04 00:12:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 2688 transitions. [2021-11-04 00:12:21,530 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 2688 transitions. Word has length 139 [2021-11-04 00:12:21,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:12:21,530 INFO L470 AbstractCegarLoop]: Abstraction has 2124 states and 2688 transitions. [2021-11-04 00:12:21,530 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-04 00:12:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2688 transitions. [2021-11-04 00:12:21,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-04 00:12:21,531 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:12:21,532 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-04 00:12:21,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-04 00:12:21,532 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-04 00:12:21,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:12:21,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1634788380, now seen corresponding path program 1 times [2021-11-04 00:12:21,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 00:12:21,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550476603] [2021-11-04 00:12:21,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:12:21,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 00:12:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-04 00:12:22,011 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-04 00:12:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-04 00:12:22,508 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-04 00:12:22,509 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-04 00:12:22,509 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (13 of 14 remaining) [2021-11-04 00:12:22,510 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (12 of 14 remaining) [2021-11-04 00:12:22,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (11 of 14 remaining) [2021-11-04 00:12:22,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (10 of 14 remaining) [2021-11-04 00:12:22,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (9 of 14 remaining) [2021-11-04 00:12:22,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (8 of 14 remaining) [2021-11-04 00:12:22,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 14 remaining) [2021-11-04 00:12:22,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (6 of 14 remaining) [2021-11-04 00:12:22,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (5 of 14 remaining) [2021-11-04 00:12:22,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 14 remaining) [2021-11-04 00:12:22,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 14 remaining) [2021-11-04 00:12:22,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 14 remaining) [2021-11-04 00:12:22,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 14 remaining) [2021-11-04 00:12:22,513 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (0 of 14 remaining) [2021-11-04 00:12:22,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-04 00:12:22,516 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-04 00:12:22,518 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-04 00:12:22,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.11 12:12:22 BoogieIcfgContainer [2021-11-04 00:12:22,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-04 00:12:22,781 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-04 00:12:22,781 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-04 00:12:22,781 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-04 00:12:22,781 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:09:50" (3/4) ... [2021-11-04 00:12:22,783 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-04 00:12:22,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-04 00:12:22,783 INFO L158 Benchmark]: Toolchain (without parser) took 155208.60ms. Allocated memory was 92.3MB in the beginning and 501.2MB in the end (delta: 408.9MB). Free memory was 65.9MB in the beginning and 313.4MB in the end (delta: -247.5MB). Peak memory consumption was 159.7MB. Max. memory is 16.1GB. [2021-11-04 00:12:22,784 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory was 73.1MB in the beginning and 73.1MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-04 00:12:22,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1352.26ms. Allocated memory was 92.3MB in the beginning and 176.2MB in the end (delta: 83.9MB). Free memory was 65.5MB in the beginning and 127.6MB in the end (delta: -62.1MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2021-11-04 00:12:22,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 179.25ms. Allocated memory is still 176.2MB. Free memory was 127.6MB in the beginning and 104.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-04 00:12:22,785 INFO L158 Benchmark]: Boogie Preprocessor took 170.32ms. Allocated memory is still 176.2MB. Free memory was 104.5MB in the beginning and 82.3MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-04 00:12:22,785 INFO L158 Benchmark]: RCFGBuilder took 1431.27ms. Allocated memory was 176.2MB in the beginning and 325.1MB in the end (delta: 148.9MB). Free memory was 82.3MB in the beginning and 176.2MB in the end (delta: -94.0MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2021-11-04 00:12:22,785 INFO L158 Benchmark]: TraceAbstraction took 152068.19ms. Allocated memory was 325.1MB in the beginning and 501.2MB in the end (delta: 176.2MB). Free memory was 176.2MB in the beginning and 313.4MB in the end (delta: -137.1MB). Peak memory consumption was 228.8MB. Max. memory is 16.1GB. [2021-11-04 00:12:22,786 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 501.2MB. Free memory is still 313.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-04 00:12:22,791 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.17ms. Allocated memory is still 92.3MB. Free memory was 73.1MB in the beginning and 73.1MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1352.26ms. Allocated memory was 92.3MB in the beginning and 176.2MB in the end (delta: 83.9MB). Free memory was 65.5MB in the beginning and 127.6MB in the end (delta: -62.1MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 179.25ms. Allocated memory is still 176.2MB. Free memory was 127.6MB in the beginning and 104.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 170.32ms. Allocated memory is still 176.2MB. Free memory was 104.5MB in the beginning and 82.3MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1431.27ms. Allocated memory was 176.2MB in the beginning and 325.1MB in the end (delta: 148.9MB). Free memory was 82.3MB in the beginning and 176.2MB in the end (delta: -94.0MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. * TraceAbstraction took 152068.19ms. Allocated memory was 325.1MB in the beginning and 501.2MB in the end (delta: 176.2MB). Free memory was 176.2MB in the beginning and 313.4MB in the end (delta: -137.1MB). Peak memory consumption was 228.8MB. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 501.2MB. Free memory is still 313.4MB. 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: 151758.50ms, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 73.43ms, AutomataDifference: 144456.83ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 19.03ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26255 SdHoareTripleChecker+Valid, 139875.95ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26255 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 128293.73ms 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, 165.22ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 183 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 342.01ms 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: 2208.89ms AutomataMinimizationTime, 22 MinimizatonAttempts, 20949 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 235.10ms SsaConstructionTime, 1584.02ms SatisfiabilityAnalysisTime, 1889.73ms 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-04 00:12:22,816 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-c36dfa3 [2021-11-04 00:12:24,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 00:12:24,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 00:12:24,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 00:12:24,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 00:12:24,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 00:12:24,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 00:12:24,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 00:12:24,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 00:12:24,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 00:12:24,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 00:12:24,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 00:12:24,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 00:12:24,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 00:12:24,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 00:12:24,714 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 00:12:24,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 00:12:24,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 00:12:24,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 00:12:24,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 00:12:24,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 00:12:24,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 00:12:24,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 00:12:24,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 00:12:24,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 00:12:24,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 00:12:24,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 00:12:24,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 00:12:24,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 00:12:24,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 00:12:24,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 00:12:24,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 00:12:24,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 00:12:24,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 00:12:24,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 00:12:24,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 00:12:24,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 00:12:24,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 00:12:24,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 00:12:24,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 00:12:24,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 00:12:24,741 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-04 00:12:24,773 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 00:12:24,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 00:12:24,775 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 00:12:24,775 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 00:12:24,776 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 00:12:24,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 00:12:24,777 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 00:12:24,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 00:12:24,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 00:12:24,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 00:12:24,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 00:12:24,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 00:12:24,778 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-04 00:12:24,778 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-04 00:12:24,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 00:12:24,779 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 00:12:24,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 00:12:24,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 00:12:24,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 00:12:24,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 00:12:24,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 00:12:24,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 00:12:24,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 00:12:24,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 00:12:24,780 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-04 00:12:24,780 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-04 00:12:24,780 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 00:12:24,781 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 00:12:24,781 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 00:12:24,781 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 00:12:24,781 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-04 00:12:24,781 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-04 00:12:25,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 00:12:25,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 00:12:25,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 00:12:25,058 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 00:12:25,059 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 00:12:25,060 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-04 00:12:25,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c4154df3/5162952bde674a0e97240fcfa901931a/FLAG5c9146b13 [2021-11-04 00:12:25,657 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 00:12:25,657 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-04 00:12:25,683 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c4154df3/5162952bde674a0e97240fcfa901931a/FLAG5c9146b13 [2021-11-04 00:12:26,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c4154df3/5162952bde674a0e97240fcfa901931a [2021-11-04 00:12:26,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 00:12:26,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 00:12:26,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 00:12:26,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 00:12:26,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 00:12:26,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:12:26" (1/1) ... [2021-11-04 00:12:26,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344d105d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:12:26, skipping insertion in model container [2021-11-04 00:12:26,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:12:26" (1/1) ... [2021-11-04 00:12:26,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 00:12:26,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 00:12:27,018 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-04 00:12:27,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 00:12:27,101 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 00:12:27,331 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-04 00:12:27,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 00:12:27,630 INFO L208 MainTranslator]: Completed translation [2021-11-04 00:12:27,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:12:27 WrapperNode [2021-11-04 00:12:27,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 00:12:27,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 00:12:27,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 00:12:27,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 00:12:27,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:12:27" (1/1) ... [2021-11-04 00:12:27,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:12:27" (1/1) ... [2021-11-04 00:12:27,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 00:12:27,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 00:12:27,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 00:12:27,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 00:12:27,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:12:27" (1/1) ... [2021-11-04 00:12:27,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:12:27" (1/1) ... [2021-11-04 00:12:27,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:12:27" (1/1) ... [2021-11-04 00:12:27,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:12:27" (1/1) ... [2021-11-04 00:12:27,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:12:27" (1/1) ... [2021-11-04 00:12:27,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:12:27" (1/1) ... [2021-11-04 00:12:27,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:12:27" (1/1) ... [2021-11-04 00:12:27,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 00:12:27,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 00:12:27,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 00:12:27,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 00:12:27,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:12:27" (1/1) ... [2021-11-04 00:12:27,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 00:12:27,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 00:12:28,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-04 00:12:28,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-04 00:12:28,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-04 00:12:28,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-04 00:12:28,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-04 00:12:28,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-04 00:12:28,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-04 00:12:28,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-04 00:12:28,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-04 00:12:28,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-04 00:12:28,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-04 00:12:28,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-04 00:12:28,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-04 00:12:28,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 00:12:28,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 00:12:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-04 00:12:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-04 00:12:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-04 00:12:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 00:12:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-04 00:12:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-04 00:12:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-04 00:12:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 00:12:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-04 00:12:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 00:12:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-04 00:12:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-04 00:12:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-04 00:12:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-04 00:12:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-04 00:12:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-11-04 00:12:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 00:12:28,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 00:12:28,417 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-04 00:12:28,448 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-04 00:12:29,487 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##522: assume !false; [2021-11-04 00:12:29,487 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##521: assume false; [2021-11-04 00:12:29,487 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##41: assume !false; [2021-11-04 00:12:29,487 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume false; [2021-11-04 00:12:29,506 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 00:12:29,507 INFO L299 CfgBuilder]: Removed 647 assume(true) statements. [2021-11-04 00:12:29,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:12:29 BoogieIcfgContainer [2021-11-04 00:12:29,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 00:12:29,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 00:12:29,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 00:12:29,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 00:12:29,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 12:12:26" (1/3) ... [2021-11-04 00:12:29,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce799e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:12:29, skipping insertion in model container [2021-11-04 00:12:29,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:12:27" (2/3) ... [2021-11-04 00:12:29,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce799e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:12:29, skipping insertion in model container [2021-11-04 00:12:29,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:12:29" (3/3) ... [2021-11-04 00:12:29,515 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-04 00:12:29,519 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 00:12:29,519 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-11-04 00:12:29,571 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 00:12:29,579 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-04 00:12:29,579 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-11-04 00:12:29,601 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-04 00:12:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-04 00:12:29,604 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:12:29,605 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:12:29,606 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-04 00:12:29,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:12:29,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1802578412, now seen corresponding path program 1 times [2021-11-04 00:12:29,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:12:29,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823036003] [2021-11-04 00:12:29,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:12:29,621 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:12:29,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:12:29,622 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-04 00:12:29,665 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-04 00:12:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:12:30,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-04 00:12:30,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:12:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:12:30,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:12:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:12:30,295 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:12:30,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823036003] [2021-11-04 00:12:30,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823036003] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:12:30,295 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:12:30,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-04 00:12:30,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201770992] [2021-11-04 00:12:30,297 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:12:30,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 00:12:30,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:12:30,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 00:12:30,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 00:12:30,334 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-04 00:12:32,432 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-04 00:12:34,755 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-04 00:12:36,776 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-04 00:12:40,952 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-04 00:12:44,529 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-04 00:12:46,550 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-04 00:12:47,907 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:12:51,204 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-04 00:12:53,227 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-04 00:12:56,250 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-04 00:12:58,270 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-04 00:13:00,286 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-04 00:13:02,308 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-04 00:13:04,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-04 00:13:09,586 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-04 00:13:11,703 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-04 00:13:13,930 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-04 00:13:15,273 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-04 00:13:16,866 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:18,077 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-04 00:13:19,778 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-04 00:13:21,862 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-04 00:13:23,885 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-04 00:13:25,904 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-04 00:13:27,560 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-04 00:13:33,644 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-04 00:13:34,950 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:40,058 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-04 00:13:43,520 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:45,522 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-04 00:13:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:13:48,343 INFO L93 Difference]: Finished difference Result 2468 states and 3603 transitions. [2021-11-04 00:13:48,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 00:13:48,345 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-04 00:13:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:13:48,372 INFO L225 Difference]: With dead ends: 2468 [2021-11-04 00:13:48,373 INFO L226 Difference]: Without dead ends: 1740 [2021-11-04 00:13:48,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.38ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-04 00:13:48,383 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 2762 mSDsluCounter, 2609 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 1 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75169.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2762 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 3457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 44.86ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77540.71ms IncrementalHoareTripleChecker+Time [2021-11-04 00:13:48,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2762 Valid, 48 Invalid, 3457 Unknown, 0 Unchecked, 44.86ms Time], IncrementalHoareTripleChecker [1 Valid, 3442 Invalid, 14 Unknown, 0 Unchecked, 77540.71ms Time] [2021-11-04 00:13:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2021-11-04 00:13:48,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 672. [2021-11-04 00:13:48,480 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-04 00:13:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 850 transitions. [2021-11-04 00:13:48,482 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 850 transitions. Word has length 11 [2021-11-04 00:13:48,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:13:48,483 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 850 transitions. [2021-11-04 00:13:48,483 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-04 00:13:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 850 transitions. [2021-11-04 00:13:48,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-04 00:13:48,484 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:13:48,484 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:13:48,504 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-04 00:13:48,703 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-04 00:13:48,703 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-04 00:13:48,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:13:48,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1859836714, now seen corresponding path program 1 times [2021-11-04 00:13:48,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:13:48,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662705458] [2021-11-04 00:13:48,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:13:48,705 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:13:48,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:13:48,708 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-04 00:13:48,720 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-04 00:13:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:13:49,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 00:13:49,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:13:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:13:49,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:13:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:13:49,309 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:13:49,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662705458] [2021-11-04 00:13:49,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662705458] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:13:49,309 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:13:49,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-04 00:13:49,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581310560] [2021-11-04 00:13:49,310 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:13:49,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:13:49,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:13:49,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:13:49,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:13:49,311 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-04 00:13:51,463 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:13:53,684 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-04 00:13:56,774 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-04 00:13:59,510 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-04 00:14:03,176 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-04 00:14:06,253 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-04 00:14:07,904 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-04 00:14:09,498 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:12,300 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-04 00:14:15,226 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-04 00:14:17,270 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-04 00:14:19,433 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-04 00:14:20,517 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-04 00:14:21,947 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-04 00:14:24,679 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-04 00:14:27,826 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-04 00:14:29,606 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-04 00:14:31,030 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:14:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:14:35,415 INFO L93 Difference]: Finished difference Result 1877 states and 2372 transitions. [2021-11-04 00:14:35,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:14:35,416 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-04 00:14:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:14:35,419 INFO L225 Difference]: With dead ends: 1877 [2021-11-04 00:14:35,419 INFO L226 Difference]: Without dead ends: 1217 [2021-11-04 00:14:35,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.73ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:14:35,421 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 669 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 13 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44446.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.32ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45920.33ms IncrementalHoareTripleChecker+Time [2021-11-04 00:14:35,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 0 Invalid, 1686 Unknown, 0 Unchecked, 12.32ms Time], IncrementalHoareTripleChecker [13 Valid, 1664 Invalid, 9 Unknown, 0 Unchecked, 45920.33ms Time] [2021-11-04 00:14:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2021-11-04 00:14:35,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1118. [2021-11-04 00:14:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1104 states have (on average 1.2835144927536233) internal successors, (1417), 1117 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:14:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1417 transitions. [2021-11-04 00:14:35,443 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1417 transitions. Word has length 11 [2021-11-04 00:14:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:14:35,443 INFO L470 AbstractCegarLoop]: Abstraction has 1118 states and 1417 transitions. [2021-11-04 00:14:35,443 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-04 00:14:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1417 transitions. [2021-11-04 00:14:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-04 00:14:35,444 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:14:35,444 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 00:14:35,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-04 00:14:35,657 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-04 00:14:35,657 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-04 00:14:35,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:14:35,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1820364266, now seen corresponding path program 1 times [2021-11-04 00:14:35,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:14:35,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046303370] [2021-11-04 00:14:35,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:14:35,659 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:14:35,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:14:35,660 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-04 00:14:35,661 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-04 00:14:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:14:36,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 00:14:36,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:14:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:14:36,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:14:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:14:36,299 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:14:36,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046303370] [2021-11-04 00:14:36,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046303370] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:14:36,299 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:14:36,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-04 00:14:36,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752964419] [2021-11-04 00:14:36,299 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:14:36,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:14:36,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:14:36,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:14:36,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:14:36,300 INFO L87 Difference]: Start difference. First operand 1118 states and 1417 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-04 00:14:38,390 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-04 00:14:40,629 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-04 00:14:43,861 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-04 00:14:46,595 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-04 00:14:48,619 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-04 00:14:52,242 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-04 00:14:53,952 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-04 00:14:57,145 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-04 00:14:59,175 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-04 00:15:02,101 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-04 00:15:04,141 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-04 00:15:07,820 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-04 00:15:09,942 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-04 00:15:11,994 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-04 00:15:13,904 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-04 00:15:15,923 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-04 00:15:20,869 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-04 00:15:23,333 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-04 00:15:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:15:26,109 INFO L93 Difference]: Finished difference Result 1686 states and 2120 transitions. [2021-11-04 00:15:26,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:15:26,110 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-04 00:15:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:15:26,115 INFO L225 Difference]: With dead ends: 1686 [2021-11-04 00:15:26,115 INFO L226 Difference]: Without dead ends: 1681 [2021-11-04 00:15:26,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.35ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:15:26,116 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 696 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 0 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48071.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.50ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49627.15ms IncrementalHoareTripleChecker+Time [2021-11-04 00:15:26,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [696 Valid, 0 Invalid, 1686 Unknown, 0 Unchecked, 12.50ms Time], IncrementalHoareTripleChecker [0 Valid, 1674 Invalid, 12 Unknown, 0 Unchecked, 49627.15ms Time] [2021-11-04 00:15:26,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2021-11-04 00:15:26,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1615. [2021-11-04 00:15:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1601 states have (on average 1.283572767020612) internal successors, (2055), 1614 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:15:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2055 transitions. [2021-11-04 00:15:26,160 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2055 transitions. Word has length 12 [2021-11-04 00:15:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:15:26,160 INFO L470 AbstractCegarLoop]: Abstraction has 1615 states and 2055 transitions. [2021-11-04 00:15:26,160 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-04 00:15:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2055 transitions. [2021-11-04 00:15:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-04 00:15:26,162 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:15:26,162 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] [2021-11-04 00:15:26,180 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-04 00:15:26,375 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-04 00:15:26,386 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-04 00:15:26,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:15:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1203856960, now seen corresponding path program 1 times [2021-11-04 00:15:26,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:15:26,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501268731] [2021-11-04 00:15:26,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:15:26,387 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:15:26,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:15:26,388 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-04 00:15:26,390 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-04 00:15:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:15:26,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 00:15:26,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:15:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-04 00:15:27,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:15:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-04 00:15:27,172 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:15:27,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501268731] [2021-11-04 00:15:27,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501268731] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:15:27,172 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:15:27,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-04 00:15:27,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806871450] [2021-11-04 00:15:27,172 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:15:27,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:15:27,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:15:27,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:15:27,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:15:27,173 INFO L87 Difference]: Start difference. First operand 1615 states and 2055 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:15:29,262 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-04 00:15:31,525 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-04 00:15:34,420 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:15:36,051 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:15:38,520 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-04 00:15:40,406 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-04 00:15:42,670 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-04 00:15:44,690 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-04 00:15:46,736 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-04 00:15:50,735 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-04 00:15:52,843 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-04 00:15:54,888 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-04 00:15:57,083 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-04 00:16:01,018 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-04 00:16:07,586 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-04 00:16:10,109 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-04 00:16:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:16:13,744 INFO L93 Difference]: Finished difference Result 3825 states and 4877 transitions. [2021-11-04 00:16:13,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:16:13,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-04 00:16:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:16:13,753 INFO L225 Difference]: With dead ends: 3825 [2021-11-04 00:16:13,753 INFO L226 Difference]: Without dead ends: 2661 [2021-11-04 00:16:13,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.59ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:16:13,756 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 670 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 13 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44790.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.77ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46392.66ms IncrementalHoareTripleChecker+Time [2021-11-04 00:16:13,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [670 Valid, 0 Invalid, 1685 Unknown, 0 Unchecked, 8.77ms Time], IncrementalHoareTripleChecker [13 Valid, 1661 Invalid, 11 Unknown, 0 Unchecked, 46392.66ms Time] [2021-11-04 00:16:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2021-11-04 00:16:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2167. [2021-11-04 00:16:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2153 states have (on average 1.2833255921969344) internal successors, (2763), 2166 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:16:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 2763 transitions. [2021-11-04 00:16:13,802 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 2763 transitions. Word has length 28 [2021-11-04 00:16:13,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:16:13,802 INFO L470 AbstractCegarLoop]: Abstraction has 2167 states and 2763 transitions. [2021-11-04 00:16:13,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:16:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 2763 transitions. [2021-11-04 00:16:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-04 00:16:13,803 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:16:13,803 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] [2021-11-04 00:16:13,819 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-04 00:16:14,017 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-04 00:16:14,017 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-04 00:16:14,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:16:14,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1335138924, now seen corresponding path program 1 times [2021-11-04 00:16:14,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:16:14,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136157586] [2021-11-04 00:16:14,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:16:14,018 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:16:14,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:16:14,023 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-04 00:16:14,024 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-04 00:16:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:16:14,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 00:16:14,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:16:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-04 00:16:14,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:16:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-04 00:16:14,805 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:16:14,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136157586] [2021-11-04 00:16:14,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136157586] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:16:14,805 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:16:14,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-04 00:16:14,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613351818] [2021-11-04 00:16:14,806 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:16:14,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:16:14,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:16:14,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:16:14,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:16:14,807 INFO L87 Difference]: Start difference. First operand 2167 states and 2763 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:16:16,898 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-04 00:16:19,646 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-04 00:16:22,085 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-04 00:16:24,763 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-04 00:16:26,800 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-04 00:16:29,612 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-04 00:16:31,628 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-04 00:16:33,673 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-04 00:16:37,545 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-04 00:16:39,591 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-04 00:16:41,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-04 00:16:43,780 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-04 00:16:46,118 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-04 00:16:48,300 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-04 00:16:53,787 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-04 00:16:54,913 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-04 00:17:00,261 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-04 00:17:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:17:01,978 INFO L93 Difference]: Finished difference Result 4162 states and 5293 transitions. [2021-11-04 00:17:01,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 00:17:01,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-04 00:17:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:17:01,991 INFO L225 Difference]: With dead ends: 4162 [2021-11-04 00:17:01,991 INFO L226 Difference]: Without dead ends: 4157 [2021-11-04 00:17:01,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.55ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:17:01,995 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 655 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 0 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45376.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.61ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46995.48ms IncrementalHoareTripleChecker+Time [2021-11-04 00:17:01,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [655 Valid, 0 Invalid, 1684 Unknown, 0 Unchecked, 6.61ms Time], IncrementalHoareTripleChecker [0 Valid, 1672 Invalid, 12 Unknown, 0 Unchecked, 46995.48ms Time] [2021-11-04 00:17:01,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4157 states. [2021-11-04 00:17:02,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4157 to 3977. [2021-11-04 00:17:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3977 states, 3963 states have (on average 1.2811001766338632) internal successors, (5077), 3976 states have internal predecessors, (5077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:17:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 5077 transitions. [2021-11-04 00:17:02,068 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 5077 transitions. Word has length 29 [2021-11-04 00:17:02,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:17:02,069 INFO L470 AbstractCegarLoop]: Abstraction has 3977 states and 5077 transitions. [2021-11-04 00:17:02,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:17:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 5077 transitions. [2021-11-04 00:17:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-04 00:17:02,075 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:17:02,075 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-04 00:17:02,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-04 00:17:02,288 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-04 00:17:02,288 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-04 00:17:02,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:17:02,289 INFO L85 PathProgramCache]: Analyzing trace with hash -965110428, now seen corresponding path program 1 times [2021-11-04 00:17:02,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:17:02,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983068164] [2021-11-04 00:17:02,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:17:02,290 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:17:02,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:17:02,291 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-04 00:17:02,292 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-04 00:17:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:17:02,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 00:17:02,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:17:02,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:17:02,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:17:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:17:03,027 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:17:03,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983068164] [2021-11-04 00:17:03,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983068164] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:17:03,027 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:17:03,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-04 00:17:03,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384833236] [2021-11-04 00:17:03,028 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:17:03,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:17:03,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:17:03,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:17:03,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:17:03,028 INFO L87 Difference]: Start difference. First operand 3977 states and 5077 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-04 00:17:05,119 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-04 00:17:07,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-04 00:17:10,920 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-04 00:17:13,115 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:17:15,140 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-04 00:17:18,634 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-04 00:17:20,674 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-04 00:17:24,203 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-04 00:17:25,958 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-04 00:17:27,985 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-04 00:17:33,557 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-04 00:17:36,035 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-04 00:17:37,695 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:17:39,226 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-04 00:17:41,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-04 00:17:45,893 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:17:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:17:48,646 INFO L93 Difference]: Finished difference Result 10003 states and 12934 transitions. [2021-11-04 00:17:48,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:17:48,646 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-04 00:17:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:17:48,664 INFO L225 Difference]: With dead ends: 10003 [2021-11-04 00:17:48,664 INFO L226 Difference]: Without dead ends: 6032 [2021-11-04 00:17:48,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.33ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:17:48,672 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1378 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 9 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43859.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.62ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45352.16ms IncrementalHoareTripleChecker+Time [2021-11-04 00:17:48,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1378 Valid, 0 Invalid, 1495 Unknown, 0 Unchecked, 14.62ms Time], IncrementalHoareTripleChecker [9 Valid, 1475 Invalid, 11 Unknown, 0 Unchecked, 45352.16ms Time] [2021-11-04 00:17:48,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2021-11-04 00:17:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 5668. [2021-11-04 00:17:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5668 states, 5654 states have (on average 1.3070392642377078) internal successors, (7390), 5667 states have internal predecessors, (7390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:17:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5668 states to 5668 states and 7390 transitions. [2021-11-04 00:17:48,852 INFO L78 Accepts]: Start accepts. Automaton has 5668 states and 7390 transitions. Word has length 35 [2021-11-04 00:17:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:17:48,852 INFO L470 AbstractCegarLoop]: Abstraction has 5668 states and 7390 transitions. [2021-11-04 00:17:48,852 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-04 00:17:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 5668 states and 7390 transitions. [2021-11-04 00:17:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-04 00:17:48,855 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:17:48,855 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-04 00:17:48,891 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-04 00:17:49,092 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-04 00:17:49,093 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-04 00:17:49,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:17:49,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1872635211, now seen corresponding path program 1 times [2021-11-04 00:17:49,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:17:49,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111747099] [2021-11-04 00:17:49,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:17:49,095 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:17:49,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:17:49,096 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-04 00:17:49,097 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-04 00:17:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:17:49,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 00:17:49,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:17:49,813 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-04 00:17:49,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:17:49,981 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-04 00:17:49,982 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:17:49,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111747099] [2021-11-04 00:17:49,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111747099] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:17:49,982 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:17:49,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-04 00:17:49,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32346157] [2021-11-04 00:17:49,983 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:17:49,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:17:49,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:17:49,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:17:49,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:17:49,985 INFO L87 Difference]: Start difference. First operand 5668 states and 7390 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-04 00:17:52,084 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-04 00:17:56,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-04 00:17:59,131 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-04 00:18:00,260 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-04 00:18:02,275 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-04 00:18:05,049 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-04 00:18:06,951 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:18:09,500 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:18:11,523 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-04 00:18:13,100 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-04 00:18:18,652 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-04 00:18:20,380 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-04 00:18:22,265 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-04 00:18:24,563 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-04 00:18:26,154 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:18:28,365 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-04 00:18:29,626 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:18:33,864 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-04 00:18:35,780 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:18:37,160 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-04 00:18:39,818 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-04 00:18:43,005 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-04 00:18:45,086 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-04 00:18:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:18:46,245 INFO L93 Difference]: Finished difference Result 12461 states and 16366 transitions. [2021-11-04 00:18:46,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:18:46,245 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-04 00:18:46,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:18:46,264 INFO L225 Difference]: With dead ends: 12461 [2021-11-04 00:18:46,264 INFO L226 Difference]: Without dead ends: 8108 [2021-11-04 00:18:46,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.20ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:18:46,271 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1587 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 9 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54269.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.60ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55975.88ms IncrementalHoareTripleChecker+Time [2021-11-04 00:18:46,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1587 Valid, 0 Invalid, 1571 Unknown, 0 Unchecked, 12.60ms Time], IncrementalHoareTripleChecker [9 Valid, 1552 Invalid, 10 Unknown, 0 Unchecked, 55975.88ms Time] [2021-11-04 00:18:46,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8108 states. [2021-11-04 00:18:46,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8108 to 6114. [2021-11-04 00:18:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6114 states, 6100 states have (on average 1.3068852459016393) internal successors, (7972), 6113 states have internal predecessors, (7972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:18:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6114 states to 6114 states and 7972 transitions. [2021-11-04 00:18:46,395 INFO L78 Accepts]: Start accepts. Automaton has 6114 states and 7972 transitions. Word has length 46 [2021-11-04 00:18:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:18:46,396 INFO L470 AbstractCegarLoop]: Abstraction has 6114 states and 7972 transitions. [2021-11-04 00:18:46,396 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-04 00:18:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 6114 states and 7972 transitions. [2021-11-04 00:18:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-04 00:18:46,398 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:18:46,398 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-04 00:18:46,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-04 00:18:46,612 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-04 00:18:46,612 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-04 00:18:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:18:46,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2056089327, now seen corresponding path program 1 times [2021-11-04 00:18:46,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:18:46,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659476102] [2021-11-04 00:18:46,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:18:46,614 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:18:46,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:18:46,625 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-04 00:18:46,626 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-04 00:18:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:18:47,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-04 00:18:47,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:18:47,283 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-04 00:18:47,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:18:47,399 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-04 00:18:47,399 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:18:47,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659476102] [2021-11-04 00:18:47,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659476102] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:18:47,399 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:18:47,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-04 00:18:47,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173470110] [2021-11-04 00:18:47,399 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:18:47,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 00:18:47,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:18:47,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 00:18:47,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-04 00:18:47,400 INFO L87 Difference]: Start difference. First operand 6114 states and 7972 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-04 00:18:49,489 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-04 00:18:51,630 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:18:53,657 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-04 00:18:55,680 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-04 00:18:59,922 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-04 00:19:01,756 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-04 00:19:03,337 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-04 00:19:05,359 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-04 00:19:08,117 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:19:10,139 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-04 00:19:12,159 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-04 00:19:15,075 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-04 00:19:17,099 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-04 00:19:19,491 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-04 00:19:20,678 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-04 00:19:21,962 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-04 00:19:23,995 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-04 00:19:29,076 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-04 00:19:31,154 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-04 00:19:33,181 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-04 00:19:35,202 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-04 00:19:36,652 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:19:38,405 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-04 00:19:39,876 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-04 00:19:42,247 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-04 00:19:48,827 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-04 00:19:49,951 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-04 00:19:56,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:19:56,300 INFO L93 Difference]: Finished difference Result 12284 states and 16006 transitions. [2021-11-04 00:19:56,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 00:19:56,301 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-04 00:19:56,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:19:56,313 INFO L225 Difference]: With dead ends: 12284 [2021-11-04 00:19:56,317 INFO L226 Difference]: Without dead ends: 6155 [2021-11-04 00:19:56,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 50.68ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-04 00:19:56,323 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 1690 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 5 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66823.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.89ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68625.21ms IncrementalHoareTripleChecker+Time [2021-11-04 00:19:56,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 2558 Unknown, 0 Unchecked, 10.89ms Time], IncrementalHoareTripleChecker [5 Valid, 2539 Invalid, 14 Unknown, 0 Unchecked, 68625.21ms Time] [2021-11-04 00:19:56,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6155 states. [2021-11-04 00:19:56,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6155 to 5936. [2021-11-04 00:19:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5936 states, 5922 states have (on average 1.3066531577169875) internal successors, (7738), 5935 states have internal predecessors, (7738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:19:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5936 states to 5936 states and 7738 transitions. [2021-11-04 00:19:56,415 INFO L78 Accepts]: Start accepts. Automaton has 5936 states and 7738 transitions. Word has length 53 [2021-11-04 00:19:56,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:19:56,415 INFO L470 AbstractCegarLoop]: Abstraction has 5936 states and 7738 transitions. [2021-11-04 00:19:56,415 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-04 00:19:56,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5936 states and 7738 transitions. [2021-11-04 00:19:56,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-04 00:19:56,418 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:19:56,418 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] [2021-11-04 00:19:56,437 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-04 00:19:56,634 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-04 00:19:56,635 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-04 00:19:56,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:19:56,635 INFO L85 PathProgramCache]: Analyzing trace with hash -203967039, now seen corresponding path program 1 times [2021-11-04 00:19:56,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:19:56,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756249769] [2021-11-04 00:19:56,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:19:56,636 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:19:56,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:19:56,637 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-04 00:19:56,638 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-04 00:19:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:19:57,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-04 00:19:57,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:19:57,439 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-04 00:19:57,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:19:57,636 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-04 00:19:57,636 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:19:57,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756249769] [2021-11-04 00:19:57,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756249769] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-04 00:19:57,637 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-04 00:19:57,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-04 00:19:57,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565711106] [2021-11-04 00:19:57,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-04 00:19:57,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 00:19:57,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:19:57,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 00:19:57,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-04 00:19:57,638 INFO L87 Difference]: Start difference. First operand 5936 states and 7738 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:19:59,731 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-04 00:20:03,052 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-04 00:20:05,083 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-04 00:20:10,340 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-04 00:20:13,365 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-04 00:20:17,125 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-04 00:20:19,147 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-04 00:20:20,254 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-04 00:20:22,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-04 00:20:24,318 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-04 00:20:27,354 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-04 00:20:29,137 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-04 00:20:31,162 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-04 00:20:33,200 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-04 00:20:35,936 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-04 00:20:41,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-04 00:20:43,286 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-04 00:20:45,319 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-04 00:20:47,338 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-04 00:20:49,411 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-04 00:20:52,725 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-04 00:20:59,926 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-04 00:21:01,004 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-04 00:21:03,214 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:21:05,023 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-04 00:21:06,923 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-04 00:21:09,332 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-04 00:21:10,660 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:21:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:21:16,196 INFO L93 Difference]: Finished difference Result 12027 states and 15686 transitions. [2021-11-04 00:21:16,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 00:21:16,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 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 62 [2021-11-04 00:21:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:21:16,208 INFO L225 Difference]: With dead ends: 12027 [2021-11-04 00:21:16,208 INFO L226 Difference]: Without dead ends: 6100 [2021-11-04 00:21:16,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.73ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-04 00:21:16,216 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 2526 mSDsCounter, 0 mSdLazyCounter, 3380 mSolverCounterSat, 3 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75911.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.90ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3380 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 78318.86ms IncrementalHoareTripleChecker+Time [2021-11-04 00:21:16,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 3398 Unknown, 0 Unchecked, 16.90ms Time], IncrementalHoareTripleChecker [3 Valid, 3380 Invalid, 15 Unknown, 0 Unchecked, 78318.86ms Time] [2021-11-04 00:21:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6100 states. [2021-11-04 00:21:16,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6100 to 6040. [2021-11-04 00:21:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6040 states, 6026 states have (on average 1.3053435114503817) internal successors, (7866), 6039 states have internal predecessors, (7866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:21:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6040 states to 6040 states and 7866 transitions. [2021-11-04 00:21:16,364 INFO L78 Accepts]: Start accepts. Automaton has 6040 states and 7866 transitions. Word has length 62 [2021-11-04 00:21:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:21:16,365 INFO L470 AbstractCegarLoop]: Abstraction has 6040 states and 7866 transitions. [2021-11-04 00:21:16,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:21:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 6040 states and 7866 transitions. [2021-11-04 00:21:16,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-04 00:21:16,367 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:21:16,367 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] [2021-11-04 00:21:16,404 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-04 00:21:16,604 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-04 00:21:16,604 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-04 00:21:16,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:21:16,605 INFO L85 PathProgramCache]: Analyzing trace with hash -825031388, now seen corresponding path program 1 times [2021-11-04 00:21:16,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:21:16,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579408823] [2021-11-04 00:21:16,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:21:16,606 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:21:16,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:21:16,607 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-04 00:21:16,611 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-04 00:21:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:21:17,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-04 00:21:17,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:21:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:21:17,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:21:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 00:21:17,510 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:21:17,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579408823] [2021-11-04 00:21:17,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579408823] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:21:17,510 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:21:17,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-04 00:21:17,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203749328] [2021-11-04 00:21:17,510 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:21:17,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 00:21:17,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:21:17,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 00:21:17,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:21:17,511 INFO L87 Difference]: Start difference. First operand 6040 states and 7866 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:21:19,594 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-04 00:21:22,634 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-04 00:21:26,022 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-04 00:21:28,704 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-04 00:21:30,677 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-04 00:21:33,663 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-04 00:21:35,689 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-04 00:21:37,724 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-04 00:21:39,856 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-04 00:21:41,148 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:21:43,170 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-04 00:21:47,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-04 00:21:48,862 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-04 00:21:50,703 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-04 00:21:52,203 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-04 00:21:53,917 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-04 00:21:55,794 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-04 00:21:57,812 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-04 00:22:06,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:22:06,865 INFO L93 Difference]: Finished difference Result 12147 states and 15874 transitions. [2021-11-04 00:22:06,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 00:22:06,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 69 [2021-11-04 00:22:06,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:22:06,875 INFO L225 Difference]: With dead ends: 12147 [2021-11-04 00:22:06,875 INFO L226 Difference]: Without dead ends: 6116 [2021-11-04 00:22:06,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.11ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 00:22:06,882 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 12 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47686.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.15ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49160.34ms IncrementalHoareTripleChecker+Time [2021-11-04 00:22:06,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1699 Unknown, 0 Unchecked, 6.15ms Time], IncrementalHoareTripleChecker [12 Valid, 1678 Invalid, 9 Unknown, 0 Unchecked, 49160.34ms Time] [2021-11-04 00:22:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6116 states. [2021-11-04 00:22:06,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6116 to 6116. [2021-11-04 00:22:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6116 states, 6102 states have (on average 1.301540478531629) internal successors, (7942), 6115 states have internal predecessors, (7942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:22:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6116 states to 6116 states and 7942 transitions. [2021-11-04 00:22:06,979 INFO L78 Accepts]: Start accepts. Automaton has 6116 states and 7942 transitions. Word has length 69 [2021-11-04 00:22:06,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:22:06,979 INFO L470 AbstractCegarLoop]: Abstraction has 6116 states and 7942 transitions. [2021-11-04 00:22:06,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:22:06,979 INFO L276 IsEmpty]: Start isEmpty. Operand 6116 states and 7942 transitions. [2021-11-04 00:22:06,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-04 00:22:06,980 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:22:06,981 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, 1, 1, 1, 1, 1, 1] [2021-11-04 00:22:07,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-04 00:22:07,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-04 00:22:07,202 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-04 00:22:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:22:07,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1743274983, now seen corresponding path program 1 times [2021-11-04 00:22:07,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:22:07,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189942800] [2021-11-04 00:22:07,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 00:22:07,204 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:22:07,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:22:07,205 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-04 00:22:07,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-04 00:22:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 00:22:07,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-04 00:22:07,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:22:08,158 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-04 00:22:08,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:22:08,506 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-04 00:22:08,506 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:22:08,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189942800] [2021-11-04 00:22:08,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189942800] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-04 00:22:08,506 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-04 00:22:08,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-04 00:22:08,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780189869] [2021-11-04 00:22:08,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-04 00:22:08,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-04 00:22:08,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:22:08,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-04 00:22:08,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-04 00:22:08,508 INFO L87 Difference]: Start difference. First operand 6116 states and 7942 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:22:10,600 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-04 00:22:16,033 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-04 00:22:21,965 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-04 00:22:24,807 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-04 00:22:31,539 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-04 00:22:33,561 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-04 00:22:35,585 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-04 00:22:37,613 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-04 00:22:39,653 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-04 00:22:41,866 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-04 00:22:43,914 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-04 00:22:50,205 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-04 00:22:52,385 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-04 00:22:53,747 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:22:55,764 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-04 00:22:57,783 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-04 00:22:59,436 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-04 00:23:01,961 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-04 00:23:06,557 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-04 00:23:08,098 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:23:09,378 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-04 00:23:12,257 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-04 00:23:14,886 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-04 00:23:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 00:23:22,251 INFO L93 Difference]: Finished difference Result 12375 states and 16178 transitions. [2021-11-04 00:23:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-04 00:23:22,252 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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 72 [2021-11-04 00:23:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 00:23:22,261 INFO L225 Difference]: With dead ends: 12375 [2021-11-04 00:23:22,262 INFO L226 Difference]: Without dead ends: 6268 [2021-11-04 00:23:22,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 406.37ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-04 00:23:22,269 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 3358 mSolverCounterSat, 49 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70406.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.11ms SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3358 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 73291.37ms IncrementalHoareTripleChecker+Time [2021-11-04 00:23:22,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 3422 Unknown, 0 Unchecked, 15.11ms Time], IncrementalHoareTripleChecker [49 Valid, 3358 Invalid, 15 Unknown, 0 Unchecked, 73291.37ms Time] [2021-11-04 00:23:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6268 states. [2021-11-04 00:23:22,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6268 to 6268. [2021-11-04 00:23:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6268 states, 6254 states have (on average 1.2942117045091142) internal successors, (8094), 6267 states have internal predecessors, (8094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:23:22,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6268 states to 6268 states and 8094 transitions. [2021-11-04 00:23:22,372 INFO L78 Accepts]: Start accepts. Automaton has 6268 states and 8094 transitions. Word has length 72 [2021-11-04 00:23:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 00:23:22,373 INFO L470 AbstractCegarLoop]: Abstraction has 6268 states and 8094 transitions. [2021-11-04 00:23:22,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:23:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 6268 states and 8094 transitions. [2021-11-04 00:23:22,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-04 00:23:22,375 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 00:23:22,375 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, 1, 1, 1, 1, 1, 1] [2021-11-04 00:23:22,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-04 00:23:22,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-04 00:23:22,592 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-04 00:23:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 00:23:22,593 INFO L85 PathProgramCache]: Analyzing trace with hash 599584569, now seen corresponding path program 2 times [2021-11-04 00:23:22,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 00:23:22,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121038475] [2021-11-04 00:23:22,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-04 00:23:22,594 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 00:23:22,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 00:23:22,595 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-04 00:23:22,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-04 00:23:23,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-04 00:23:23,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-04 00:23:23,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 00:23:23,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 00:23:23,415 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-04 00:23:23,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 00:23:23,751 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-04 00:23:23,751 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 00:23:23,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121038475] [2021-11-04 00:23:23,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121038475] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 00:23:23,751 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 00:23:23,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-04 00:23:23,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283191911] [2021-11-04 00:23:23,751 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 00:23:23,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 00:23:23,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 00:23:23,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 00:23:23,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 00:23:23,752 INFO L87 Difference]: Start difference. First operand 6268 states and 8094 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 00:23:25,844 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-04 00:23:30,463 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-04 00:23:33,581 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-04 00:23:35,607 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-04 00:23:37,057 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-04 00:23:39,060 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-04 00:23:40,786 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-04 00:23:44,361 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-04 00:23:46,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-04 00:23:47,990 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:23:50,012 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-04 00:23: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-04 00:23:54,392 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 00:23:55,480 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-04 00:24:03,153 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 [] Killed by 15