./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 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-validator-v0.6/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d0954289a294fb2be404f98afcefa652a2fbf60d586d07e7d68c419183f4ff07 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 15:15:41,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 15:15:41,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 15:15:41,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 15:15:41,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 15:15:41,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 15:15:41,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 15:15:41,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 15:15:41,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 15:15:41,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 15:15:41,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 15:15:41,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 15:15:41,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 15:15:41,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 15:15:41,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 15:15:41,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 15:15:41,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 15:15:41,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 15:15:41,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 15:15:41,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 15:15:41,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 15:15:41,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 15:15:41,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 15:15:41,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 15:15:41,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 15:15:41,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 15:15:41,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 15:15:41,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 15:15:41,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 15:15:41,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 15:15:41,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 15:15:41,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 15:15:41,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 15:15:41,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 15:15:41,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 15:15:41,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 15:15:41,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 15:15:41,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 15:15:41,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 15:15:41,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 15:15:41,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 15:15:41,882 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 15:15:41,900 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 15:15:41,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 15:15:41,900 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 15:15:41,901 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 15:15:41,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 15:15:41,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 15:15:41,902 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 15:15:41,902 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 15:15:41,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 15:15:41,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 15:15:41,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 15:15:41,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 15:15:41,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 15:15:41,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 15:15:41,903 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 15:15:41,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 15:15:41,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 15:15:41,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 15:15:41,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 15:15:41,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 15:15:41,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 15:15:41,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 15:15:41,904 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 15:15:41,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 15:15:41,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 15:15:41,905 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 15:15:41,905 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 15:15:41,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 15:15:41,906 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 15:15:41,906 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 -> d0954289a294fb2be404f98afcefa652a2fbf60d586d07e7d68c419183f4ff07 [2021-11-06 15:15:42,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 15:15:42,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 15:15:42,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 15:15:42,160 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 15:15:42,162 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 15:15:42,163 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point.cil.out.i [2021-11-06 15:15:42,235 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aa3d184c/e7b07d2d2d7e442983fb58e7d3699cbf/FLAG275242d2b [2021-11-06 15:15:42,828 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 15:15:42,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point.cil.out.i [2021-11-06 15:15:42,868 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aa3d184c/e7b07d2d2d7e442983fb58e7d3699cbf/FLAG275242d2b [2021-11-06 15:15:43,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aa3d184c/e7b07d2d2d7e442983fb58e7d3699cbf [2021-11-06 15:15:43,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 15:15:43,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 15:15:43,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 15:15:43,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 15:15:43,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 15:15:43,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 03:15:43" (1/1) ... [2021-11-06 15:15:43,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c7a0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:15:43, skipping insertion in model container [2021-11-06 15:15:43,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 03:15:43" (1/1) ... [2021-11-06 15:15:43,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 15:15:43,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 15:15:43,580 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name writepages at C: (*writepages)(struct address_space___0 * , struct writeback_control * ) [3507] [2021-11-06 15:15:43,581 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name readpages at C: (*readpages)(struct file___0 *filp , struct address_space___0 *mapping , struct list_head *pages , unsigned int nr_pages ) [3509-3510] [2021-11-06 15:15:43,581 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name write_begin at C: (*write_begin)(struct file___0 * , struct address_space___0 *mapping , loff_t pos , unsigned int len , unsigned int flags , struct page **pagep , void **fsdata ) [3511-3513] [2021-11-06 15:15:43,581 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name write_end at C: (*write_end)(struct file___0 * , struct address_space___0 *mapping , loff_t pos , unsigned int len , unsigned int copied , struct page *page , void *fsdata ) [3514-3515] [2021-11-06 15:15:43,581 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name bmap at C: (*bmap)(struct address_space___0 * , sector_t ) [3516] [2021-11-06 15:15:43,582 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name get_xip_mem at C: (*get_xip_mem)(struct address_space___0 * , unsigned long , int , void ** , unsigned long * ) [3522-3523] [2021-11-06 15:15:43,582 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name migratepage at C: (*migratepage)(struct address_space___0 * , struct page * , struct page * ) [3524] [2021-11-06 15:15:43,582 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name error_remove_page at C: (*error_remove_page)(struct address_space___0 * , struct page * ) [3527] [2021-11-06 15:15:43,591 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name carrier_raised at C: (*carrier_raised)(struct tty_port___0 *port ) [3940] [2021-11-06 15:15:43,599 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name dtr_rts at C: (*dtr_rts)(struct tty_port___0 *port , int raise ) [3941] [2021-11-06 15:15:43,600 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name shutdown at C: (*shutdown)(struct tty_port___0 *port ) [3942] [2021-11-06 15:15:43,600 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name drop at C: (*drop)(struct tty_port___0 *port ) [3943] [2021-11-06 15:15:43,600 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name activate at C: (*activate)(struct tty_port___0 *port , struct tty_struct___0 *tty ) [3944] [2021-11-06 15:15:43,601 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name destruct at C: (*destruct)(struct tty_port___0 *port ) [3945] [2021-11-06 15:15:43,834 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-validator-v0.6/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point.cil.out.i[130795,130808] [2021-11-06 15:15:44,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 15:15:44,194 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 15:15:44,288 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name writepages at C: (*writepages)(struct address_space___0 * , struct writeback_control * ) [3507] [2021-11-06 15:15:44,288 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name readpages at C: (*readpages)(struct file___0 *filp , struct address_space___0 *mapping , struct list_head *pages , unsigned int nr_pages ) [3509-3510] [2021-11-06 15:15:44,288 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name write_begin at C: (*write_begin)(struct file___0 * , struct address_space___0 *mapping , loff_t pos , unsigned int len , unsigned int flags , struct page **pagep , void **fsdata ) [3511-3513] [2021-11-06 15:15:44,289 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name write_end at C: (*write_end)(struct file___0 * , struct address_space___0 *mapping , loff_t pos , unsigned int len , unsigned int copied , struct page *page , void *fsdata ) [3514-3515] [2021-11-06 15:15:44,290 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name bmap at C: (*bmap)(struct address_space___0 * , sector_t ) [3516] [2021-11-06 15:15:44,291 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name get_xip_mem at C: (*get_xip_mem)(struct address_space___0 * , unsigned long , int , void ** , unsigned long * ) [3522-3523] [2021-11-06 15:15:44,291 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name migratepage at C: (*migratepage)(struct address_space___0 * , struct page * , struct page * ) [3524] [2021-11-06 15:15:44,292 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name error_remove_page at C: (*error_remove_page)(struct address_space___0 * , struct page * ) [3527] [2021-11-06 15:15:44,298 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name carrier_raised at C: (*carrier_raised)(struct tty_port___0 *port ) [3940] [2021-11-06 15:15:44,299 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name dtr_rts at C: (*dtr_rts)(struct tty_port___0 *port , int raise ) [3941] [2021-11-06 15:15:44,300 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name shutdown at C: (*shutdown)(struct tty_port___0 *port ) [3942] [2021-11-06 15:15:44,300 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name drop at C: (*drop)(struct tty_port___0 *port ) [3943] [2021-11-06 15:15:44,300 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name activate at C: (*activate)(struct tty_port___0 *port , struct tty_struct___0 *tty ) [3944] [2021-11-06 15:15:44,301 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name destruct at C: (*destruct)(struct tty_port___0 *port ) [3945] [2021-11-06 15:15:44,318 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-validator-v0.6/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point.cil.out.i[130795,130808] [2021-11-06 15:15:44,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 15:15:44,510 INFO L208 MainTranslator]: Completed translation [2021-11-06 15:15:44,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:15:44 WrapperNode [2021-11-06 15:15:44,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 15:15:44,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 15:15:44,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 15:15:44,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 15:15:44,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:15:44" (1/1) ... [2021-11-06 15:15:44,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:15:44" (1/1) ... [2021-11-06 15:15:44,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 15:15:44,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 15:15:44,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 15:15:44,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 15:15:44,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:15:44" (1/1) ... [2021-11-06 15:15:44,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:15:44" (1/1) ... [2021-11-06 15:15:44,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:15:44" (1/1) ... [2021-11-06 15:15:44,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:15:44" (1/1) ... [2021-11-06 15:15:44,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:15:44" (1/1) ... [2021-11-06 15:15:44,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:15:44" (1/1) ... [2021-11-06 15:15:45,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:15:44" (1/1) ... [2021-11-06 15:15:45,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 15:15:45,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 15:15:45,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 15:15:45,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 15:15:45,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:15:44" (1/1) ... [2021-11-06 15:15:45,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 15:15:45,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 15:15:45,133 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-06 15:15:45,167 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-06 15:15:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 15:15:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 15:15:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 15:15:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 15:15:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 15:15:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 15:15:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_alloc_notrace [2021-11-06 15:15:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 15:15:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 15:15:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 15:15:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 15:15:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 15:15:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 15:15:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 15:15:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 15:15:45,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 15:15:59,373 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 15:15:59,373 INFO L299 CfgBuilder]: Removed 1401 assume(true) statements. [2021-11-06 15:15:59,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 03:15:59 BoogieIcfgContainer [2021-11-06 15:15:59,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 15:15:59,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 15:15:59,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 15:15:59,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 15:15:59,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 03:15:43" (1/3) ... [2021-11-06 15:15:59,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c82af2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 03:15:59, skipping insertion in model container [2021-11-06 15:15:59,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:15:44" (2/3) ... [2021-11-06 15:15:59,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c82af2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 03:15:59, skipping insertion in model container [2021-11-06 15:15:59,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 03:15:59" (3/3) ... [2021-11-06 15:15:59,383 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point.cil.out.i [2021-11-06 15:15:59,387 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 15:15:59,387 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-06 15:15:59,425 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 15:15:59,430 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-06 15:15:59,430 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-06 15:15:59,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 1817 states, 1805 states have (on average 1.5501385041551246) internal successors, (2798), 1816 states have internal predecessors, (2798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:15:59,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-06 15:15:59,469 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:15:59,470 INFO L513 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] [2021-11-06 15:15:59,470 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:15:59,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:15:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash 666057958, now seen corresponding path program 1 times [2021-11-06 15:15:59,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:15:59,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562036572] [2021-11-06 15:15:59,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:15:59,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:15:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:15:59,915 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-06 15:15:59,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:15:59,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562036572] [2021-11-06 15:15:59,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562036572] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:15:59,916 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:15:59,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:15:59,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584485872] [2021-11-06 15:15:59,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:15:59,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:15:59,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:15:59,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:15:59,941 INFO L87 Difference]: Start difference. First operand has 1817 states, 1805 states have (on average 1.5501385041551246) internal successors, (2798), 1816 states have internal predecessors, (2798), 0 states have call successors, (0), 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 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:16:00,315 INFO L93 Difference]: Finished difference Result 2765 states and 4178 transitions. [2021-11-06 15:16:00,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:16:00,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-11-06 15:16:00,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:16:00,339 INFO L225 Difference]: With dead ends: 2765 [2021-11-06 15:16:00,347 INFO L226 Difference]: Without dead ends: 931 [2021-11-06 15:16:00,354 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:16:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-11-06 15:16:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 931. [2021-11-06 15:16:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 920 states have (on average 1.392391304347826) internal successors, (1281), 930 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1281 transitions. [2021-11-06 15:16:00,430 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1281 transitions. Word has length 31 [2021-11-06 15:16:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:16:00,430 INFO L470 AbstractCegarLoop]: Abstraction has 931 states and 1281 transitions. [2021-11-06 15:16:00,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1281 transitions. [2021-11-06 15:16:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 15:16:00,433 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:16:00,433 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 15:16:00,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 15:16:00,434 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:16:00,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:16:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash 361424456, now seen corresponding path program 1 times [2021-11-06 15:16:00,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:16:00,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100025175] [2021-11-06 15:16:00,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:16:00,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:16:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:16:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:16:00,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:16:00,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100025175] [2021-11-06 15:16:00,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100025175] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:16:00,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:16:00,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:16:00,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196554408] [2021-11-06 15:16:00,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:16:00,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:16:00,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:16:00,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:16:00,577 INFO L87 Difference]: Start difference. First operand 931 states and 1281 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:16:03,041 INFO L93 Difference]: Finished difference Result 1924 states and 2684 transitions. [2021-11-06 15:16:03,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:16:03,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2021-11-06 15:16:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:16:03,046 INFO L225 Difference]: With dead ends: 1924 [2021-11-06 15:16:03,046 INFO L226 Difference]: Without dead ends: 1021 [2021-11-06 15:16:03,048 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:16:03,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2021-11-06 15:16:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1021. [2021-11-06 15:16:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1010 states have (on average 1.388118811881188) internal successors, (1402), 1020 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:03,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1402 transitions. [2021-11-06 15:16:03,068 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1402 transitions. Word has length 52 [2021-11-06 15:16:03,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:16:03,068 INFO L470 AbstractCegarLoop]: Abstraction has 1021 states and 1402 transitions. [2021-11-06 15:16:03,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1402 transitions. [2021-11-06 15:16:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-06 15:16:03,070 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:16:03,070 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:16:03,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 15:16:03,070 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:16:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:16:03,071 INFO L85 PathProgramCache]: Analyzing trace with hash 403906542, now seen corresponding path program 1 times [2021-11-06 15:16:03,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:16:03,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280424409] [2021-11-06 15:16:03,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:16:03,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:16:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:16:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 15:16:03,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:16:03,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280424409] [2021-11-06 15:16:03,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280424409] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:16:03,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:16:03,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:16:03,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322137797] [2021-11-06 15:16:03,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:16:03,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:16:03,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:16:03,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:16:03,201 INFO L87 Difference]: Start difference. First operand 1021 states and 1402 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:11,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:16:11,406 INFO L93 Difference]: Finished difference Result 2018 states and 2779 transitions. [2021-11-06 15:16:11,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:16:11,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2021-11-06 15:16:11,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:16:11,410 INFO L225 Difference]: With dead ends: 2018 [2021-11-06 15:16:11,410 INFO L226 Difference]: Without dead ends: 1025 [2021-11-06 15:16:11,412 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:16:11,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2021-11-06 15:16:11,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1025. [2021-11-06 15:16:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1014 states have (on average 1.3865877712031558) internal successors, (1406), 1024 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1406 transitions. [2021-11-06 15:16:11,432 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1406 transitions. Word has length 56 [2021-11-06 15:16:11,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:16:11,433 INFO L470 AbstractCegarLoop]: Abstraction has 1025 states and 1406 transitions. [2021-11-06 15:16:11,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1406 transitions. [2021-11-06 15:16:11,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-06 15:16:11,434 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:16:11,434 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:16:11,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 15:16:11,434 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:16:11,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:16:11,435 INFO L85 PathProgramCache]: Analyzing trace with hash 403966124, now seen corresponding path program 1 times [2021-11-06 15:16:11,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:16:11,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721311294] [2021-11-06 15:16:11,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:16:11,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:16:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:16:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 15:16:11,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:16:11,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721311294] [2021-11-06 15:16:11,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721311294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:16:11,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:16:11,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 15:16:11,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403874019] [2021-11-06 15:16:11,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 15:16:11,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:16:11,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 15:16:11,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:16:11,744 INFO L87 Difference]: Start difference. First operand 1025 states and 1406 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:16:12,264 INFO L93 Difference]: Finished difference Result 2914 states and 4011 transitions. [2021-11-06 15:16:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 15:16:12,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2021-11-06 15:16:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:16:12,272 INFO L225 Difference]: With dead ends: 2914 [2021-11-06 15:16:12,272 INFO L226 Difference]: Without dead ends: 1914 [2021-11-06 15:16:12,274 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 15:16:12,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2021-11-06 15:16:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1025. [2021-11-06 15:16:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1014 states have (on average 1.3856015779092703) internal successors, (1405), 1024 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:12,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1405 transitions. [2021-11-06 15:16:12,304 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1405 transitions. Word has length 56 [2021-11-06 15:16:12,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:16:12,304 INFO L470 AbstractCegarLoop]: Abstraction has 1025 states and 1405 transitions. [2021-11-06 15:16:12,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1405 transitions. [2021-11-06 15:16:12,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 15:16:12,306 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:16:12,306 INFO L513 BasicCegarLoop]: trace histogram [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-06 15:16:12,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 15:16:12,307 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:16:12,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:16:12,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1262603864, now seen corresponding path program 1 times [2021-11-06 15:16:12,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:16:12,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550951218] [2021-11-06 15:16:12,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:16:12,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:16:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:16:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:16:12,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:16:12,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550951218] [2021-11-06 15:16:12,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550951218] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:16:12,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:16:12,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 15:16:12,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764213451] [2021-11-06 15:16:12,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 15:16:12,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:16:12,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 15:16:12,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-06 15:16:12,644 INFO L87 Difference]: Start difference. First operand 1025 states and 1405 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:16:49,879 INFO L93 Difference]: Finished difference Result 14877 states and 20825 transitions. [2021-11-06 15:16:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-06 15:16:49,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-06 15:16:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:16:49,930 INFO L225 Difference]: With dead ends: 14877 [2021-11-06 15:16:49,930 INFO L226 Difference]: Without dead ends: 14861 [2021-11-06 15:16:49,938 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-11-06 15:16:49,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14861 states. [2021-11-06 15:16:50,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14861 to 1975. [2021-11-06 15:16:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1964 states have (on average 1.3890020366598779) internal successors, (2728), 1974 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2728 transitions. [2021-11-06 15:16:50,081 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2728 transitions. Word has length 58 [2021-11-06 15:16:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:16:50,082 INFO L470 AbstractCegarLoop]: Abstraction has 1975 states and 2728 transitions. [2021-11-06 15:16:50,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2728 transitions. [2021-11-06 15:16:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 15:16:50,085 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:16:50,085 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-06 15:16:50,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 15:16:50,086 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:16:50,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:16:50,086 INFO L85 PathProgramCache]: Analyzing trace with hash -596405054, now seen corresponding path program 1 times [2021-11-06 15:16:50,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:16:50,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419110466] [2021-11-06 15:16:50,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:16:50,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:16:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:16:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 15:16:50,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:16:50,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419110466] [2021-11-06 15:16:50,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419110466] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:16:50,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:16:50,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:16:50,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082992223] [2021-11-06 15:16:50,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:16:50,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:16:50,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:16:50,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:16:50,233 INFO L87 Difference]: Start difference. First operand 1975 states and 2728 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:16:52,729 INFO L93 Difference]: Finished difference Result 4102 states and 5734 transitions. [2021-11-06 15:16:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:16:52,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 73 [2021-11-06 15:16:52,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:16:52,736 INFO L225 Difference]: With dead ends: 4102 [2021-11-06 15:16:52,736 INFO L226 Difference]: Without dead ends: 2155 [2021-11-06 15:16:52,738 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:16:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2021-11-06 15:16:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2155. [2021-11-06 15:16:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2144 states have (on average 1.3852611940298507) internal successors, (2970), 2154 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:52,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2970 transitions. [2021-11-06 15:16:52,795 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2970 transitions. Word has length 73 [2021-11-06 15:16:52,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:16:52,796 INFO L470 AbstractCegarLoop]: Abstraction has 2155 states and 2970 transitions. [2021-11-06 15:16:52,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2970 transitions. [2021-11-06 15:16:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-06 15:16:52,797 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:16:52,797 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:16:52,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 15:16:52,798 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:16:52,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:16:52,798 INFO L85 PathProgramCache]: Analyzing trace with hash -591201673, now seen corresponding path program 1 times [2021-11-06 15:16:52,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:16:52,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273174116] [2021-11-06 15:16:52,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:16:52,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:16:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:16:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-06 15:16:53,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:16:53,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273174116] [2021-11-06 15:16:53,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273174116] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 15:16:53,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128976621] [2021-11-06 15:16:53,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:16:53,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 15:16:53,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 15:16:53,149 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-06 15:16:53,153 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-06 15:16:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:16:53,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 1804 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 15:16:53,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:16:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-06 15:16:53,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128976621] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:16:53,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 15:16:53,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2021-11-06 15:16:53,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105034600] [2021-11-06 15:16:53,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 15:16:53,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:16:53,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 15:16:53,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-06 15:16:53,923 INFO L87 Difference]: Start difference. First operand 2155 states and 2970 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:16:56,298 INFO L93 Difference]: Finished difference Result 6377 states and 8798 transitions. [2021-11-06 15:16:56,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 15:16:56,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-06 15:16:56,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:16:56,310 INFO L225 Difference]: With dead ends: 6377 [2021-11-06 15:16:56,311 INFO L226 Difference]: Without dead ends: 4194 [2021-11-06 15:16:56,314 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-11-06 15:16:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4194 states. [2021-11-06 15:16:56,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4194 to 2139. [2021-11-06 15:16:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2128 states have (on average 1.380639097744361) internal successors, (2938), 2138 states have internal predecessors, (2938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2938 transitions. [2021-11-06 15:16:56,387 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2938 transitions. Word has length 80 [2021-11-06 15:16:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:16:56,388 INFO L470 AbstractCegarLoop]: Abstraction has 2139 states and 2938 transitions. [2021-11-06 15:16:56,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:16:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2938 transitions. [2021-11-06 15:16:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-06 15:16:56,390 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:16:56,390 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:16:56,415 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-06 15:16:56,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 15:16:56,608 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:16:56,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:16:56,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1346059703, now seen corresponding path program 1 times [2021-11-06 15:16:56,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:16:56,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000056475] [2021-11-06 15:16:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:16:56,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:16:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:16:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-06 15:16:56,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:16:56,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000056475] [2021-11-06 15:16:56,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000056475] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 15:16:56,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147566424] [2021-11-06 15:16:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:16:56,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 15:16:56,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 15:16:56,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 15:16:56,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-06 15:17:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:17:02,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 1906 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 15:17:02,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:17:02,958 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-06 15:17:02,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147566424] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:17:02,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 15:17:02,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2021-11-06 15:17:02,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907409438] [2021-11-06 15:17:02,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:17:02,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:17:02,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:17:02,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-06 15:17:02,961 INFO L87 Difference]: Start difference. First operand 2139 states and 2938 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:05,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:17:05,250 INFO L93 Difference]: Finished difference Result 3195 states and 4391 transitions. [2021-11-06 15:17:05,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:17:05,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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-06 15:17:05,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:17:05,258 INFO L225 Difference]: With dead ends: 3195 [2021-11-06 15:17:05,259 INFO L226 Difference]: Without dead ends: 3179 [2021-11-06 15:17:05,260 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-06 15:17:05,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2021-11-06 15:17:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2142. [2021-11-06 15:17:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 2131 states have (on average 1.380103237916471) internal successors, (2941), 2141 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 2941 transitions. [2021-11-06 15:17:05,360 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 2941 transitions. Word has length 86 [2021-11-06 15:17:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:17:05,360 INFO L470 AbstractCegarLoop]: Abstraction has 2142 states and 2941 transitions. [2021-11-06 15:17:05,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 2941 transitions. [2021-11-06 15:17:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-06 15:17:05,363 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:17:05,363 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:17:05,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-06 15:17:05,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-06 15:17:05,573 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:17:05,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:17:05,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1531915141, now seen corresponding path program 1 times [2021-11-06 15:17:05,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:17:05,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794569583] [2021-11-06 15:17:05,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:17:05,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:17:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:17:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-06 15:17:05,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:17:05,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794569583] [2021-11-06 15:17:05,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794569583] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:17:05,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:17:05,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 15:17:05,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386901080] [2021-11-06 15:17:05,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 15:17:05,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:17:05,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 15:17:05,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:17:05,669 INFO L87 Difference]: Start difference. First operand 2142 states and 2941 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:07,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:17:07,955 INFO L93 Difference]: Finished difference Result 5286 states and 7222 transitions. [2021-11-06 15:17:07,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 15:17:07,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-11-06 15:17:07,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:17:07,962 INFO L225 Difference]: With dead ends: 5286 [2021-11-06 15:17:07,962 INFO L226 Difference]: Without dead ends: 3172 [2021-11-06 15:17:07,965 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 15:17:07,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3172 states. [2021-11-06 15:17:08,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3172 to 2146. [2021-11-06 15:17:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 2135 states have (on average 1.379391100702576) internal successors, (2945), 2145 states have internal predecessors, (2945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2945 transitions. [2021-11-06 15:17:08,032 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2945 transitions. Word has length 94 [2021-11-06 15:17:08,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:17:08,033 INFO L470 AbstractCegarLoop]: Abstraction has 2146 states and 2945 transitions. [2021-11-06 15:17:08,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2945 transitions. [2021-11-06 15:17:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-06 15:17:08,034 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:17:08,035 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2021-11-06 15:17:08,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 15:17:08,035 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:17:08,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:17:08,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1197144400, now seen corresponding path program 1 times [2021-11-06 15:17:08,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:17:08,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172417664] [2021-11-06 15:17:08,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:17:08,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:17:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:17:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-06 15:17:08,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:17:08,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172417664] [2021-11-06 15:17:08,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172417664] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:17:08,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:17:08,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:17:08,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80954639] [2021-11-06 15:17:08,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:17:08,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:17:08,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:17:08,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:17:08,159 INFO L87 Difference]: Start difference. First operand 2146 states and 2945 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:17:10,697 INFO L93 Difference]: Finished difference Result 4440 states and 6160 transitions. [2021-11-06 15:17:10,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:17:10,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-06 15:17:10,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:17:10,701 INFO L225 Difference]: With dead ends: 4440 [2021-11-06 15:17:10,701 INFO L226 Difference]: Without dead ends: 2322 [2021-11-06 15:17:10,703 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:17:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2021-11-06 15:17:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2322. [2021-11-06 15:17:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 2311 states have (on average 1.37559498052791) internal successors, (3179), 2321 states have internal predecessors, (3179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:10,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3179 transitions. [2021-11-06 15:17:10,764 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3179 transitions. Word has length 99 [2021-11-06 15:17:10,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:17:10,764 INFO L470 AbstractCegarLoop]: Abstraction has 2322 states and 3179 transitions. [2021-11-06 15:17:10,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3179 transitions. [2021-11-06 15:17:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-11-06 15:17:10,767 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:17:10,767 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:17:10,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 15:17:10,768 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:17:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:17:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash -525453231, now seen corresponding path program 1 times [2021-11-06 15:17:10,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:17:10,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035694440] [2021-11-06 15:17:10,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:17:10,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:17:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:17:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-06 15:17:10,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:17:10,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035694440] [2021-11-06 15:17:10,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035694440] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:17:10,881 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:17:10,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 15:17:10,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543747377] [2021-11-06 15:17:10,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:17:10,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:17:10,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:17:10,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:17:10,882 INFO L87 Difference]: Start difference. First operand 2322 states and 3179 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:17:11,043 INFO L93 Difference]: Finished difference Result 4616 states and 6326 transitions. [2021-11-06 15:17:11,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:17:11,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 125 [2021-11-06 15:17:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:17:11,048 INFO L225 Difference]: With dead ends: 4616 [2021-11-06 15:17:11,048 INFO L226 Difference]: Without dead ends: 2322 [2021-11-06 15:17:11,051 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:17:11,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2021-11-06 15:17:11,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2322. [2021-11-06 15:17:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 2311 states have (on average 1.333621808740805) internal successors, (3082), 2321 states have internal predecessors, (3082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3082 transitions. [2021-11-06 15:17:11,118 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3082 transitions. Word has length 125 [2021-11-06 15:17:11,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:17:11,118 INFO L470 AbstractCegarLoop]: Abstraction has 2322 states and 3082 transitions. [2021-11-06 15:17:11,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3082 transitions. [2021-11-06 15:17:11,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-11-06 15:17:11,122 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:17:11,122 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:17:11,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 15:17:11,122 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:17:11,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:17:11,123 INFO L85 PathProgramCache]: Analyzing trace with hash -990866799, now seen corresponding path program 1 times [2021-11-06 15:17:11,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:17:11,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252027557] [2021-11-06 15:17:11,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:17:11,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:17:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:17:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-06 15:17:11,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:17:11,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252027557] [2021-11-06 15:17:11,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252027557] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:17:11,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:17:11,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 15:17:11,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303880457] [2021-11-06 15:17:11,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 15:17:11,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:17:11,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 15:17:11,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:17:11,232 INFO L87 Difference]: Start difference. First operand 2322 states and 3082 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:13,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:17:13,518 INFO L93 Difference]: Finished difference Result 6234 states and 8220 transitions. [2021-11-06 15:17:13,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 15:17:13,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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 125 [2021-11-06 15:17:13,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:17:13,526 INFO L225 Difference]: With dead ends: 6234 [2021-11-06 15:17:13,527 INFO L226 Difference]: Without dead ends: 3940 [2021-11-06 15:17:13,531 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 15:17:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states. [2021-11-06 15:17:13,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 2326. [2021-11-06 15:17:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 2315 states have (on average 1.3330453563714904) internal successors, (3086), 2325 states have internal predecessors, (3086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3086 transitions. [2021-11-06 15:17:13,622 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3086 transitions. Word has length 125 [2021-11-06 15:17:13,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:17:13,622 INFO L470 AbstractCegarLoop]: Abstraction has 2326 states and 3086 transitions. [2021-11-06 15:17:13,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3086 transitions. [2021-11-06 15:17:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-06 15:17:13,625 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:17:13,626 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:17:13,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 15:17:13,626 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:17:13,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:17:13,627 INFO L85 PathProgramCache]: Analyzing trace with hash 860207890, now seen corresponding path program 1 times [2021-11-06 15:17:13,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:17:13,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292217508] [2021-11-06 15:17:13,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:17:13,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:17:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:17:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-06 15:17:13,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:17:13,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292217508] [2021-11-06 15:17:13,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292217508] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:17:13,773 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:17:13,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:17:13,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887643542] [2021-11-06 15:17:13,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:17:13,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:17:13,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:17:13,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:17:13,774 INFO L87 Difference]: Start difference. First operand 2326 states and 3086 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:17:13,836 INFO L93 Difference]: Finished difference Result 4626 states and 6144 transitions. [2021-11-06 15:17:13,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:17:13,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 153 [2021-11-06 15:17:13,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:17:13,841 INFO L225 Difference]: With dead ends: 4626 [2021-11-06 15:17:13,841 INFO L226 Difference]: Without dead ends: 2328 [2021-11-06 15:17:13,844 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:17:13,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2021-11-06 15:17:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2328. [2021-11-06 15:17:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 2317 states have (on average 1.3327578765645232) internal successors, (3088), 2327 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 3088 transitions. [2021-11-06 15:17:13,928 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 3088 transitions. Word has length 153 [2021-11-06 15:17:13,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:17:13,928 INFO L470 AbstractCegarLoop]: Abstraction has 2328 states and 3088 transitions. [2021-11-06 15:17:13,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:13,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 3088 transitions. [2021-11-06 15:17:13,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-06 15:17:13,931 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:17:13,932 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:17:13,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 15:17:13,932 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:17:13,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:17:13,932 INFO L85 PathProgramCache]: Analyzing trace with hash 350734800, now seen corresponding path program 1 times [2021-11-06 15:17:13,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:17:13,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816270263] [2021-11-06 15:17:13,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:17:13,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:17:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:17:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-06 15:17:14,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:17:14,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816270263] [2021-11-06 15:17:14,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816270263] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:17:14,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:17:14,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:17:14,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303491596] [2021-11-06 15:17:14,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:17:14,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:17:14,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:17:14,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:17:14,082 INFO L87 Difference]: Start difference. First operand 2328 states and 3088 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:14,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:17:14,143 INFO L93 Difference]: Finished difference Result 4630 states and 6148 transitions. [2021-11-06 15:17:14,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:17:14,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 153 [2021-11-06 15:17:14,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:17:14,148 INFO L225 Difference]: With dead ends: 4630 [2021-11-06 15:17:14,148 INFO L226 Difference]: Without dead ends: 2330 [2021-11-06 15:17:14,151 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:17:14,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2021-11-06 15:17:14,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2330. [2021-11-06 15:17:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 2319 states have (on average 1.332470892626132) internal successors, (3090), 2329 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 3090 transitions. [2021-11-06 15:17:14,216 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 3090 transitions. Word has length 153 [2021-11-06 15:17:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:17:14,216 INFO L470 AbstractCegarLoop]: Abstraction has 2330 states and 3090 transitions. [2021-11-06 15:17:14,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 3090 transitions. [2021-11-06 15:17:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-06 15:17:14,218 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:17:14,218 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:17:14,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 15:17:14,219 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:17:14,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:17:14,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1454703534, now seen corresponding path program 1 times [2021-11-06 15:17:14,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:17:14,219 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152170455] [2021-11-06 15:17:14,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:17:14,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:17:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:17:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-06 15:17:14,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:17:14,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152170455] [2021-11-06 15:17:14,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152170455] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:17:14,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:17:14,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 15:17:14,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098120716] [2021-11-06 15:17:14,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 15:17:14,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:17:14,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 15:17:14,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:17:14,370 INFO L87 Difference]: Start difference. First operand 2330 states and 3090 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:17:14,444 INFO L93 Difference]: Finished difference Result 4638 states and 6156 transitions. [2021-11-06 15:17:14,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 15:17:14,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 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 153 [2021-11-06 15:17:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:17:14,449 INFO L225 Difference]: With dead ends: 4638 [2021-11-06 15:17:14,449 INFO L226 Difference]: Without dead ends: 2336 [2021-11-06 15:17:14,453 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 15:17:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2021-11-06 15:17:14,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2334. [2021-11-06 15:17:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2334 states, 2323 states have (on average 1.3318984072320275) internal successors, (3094), 2333 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 3094 transitions. [2021-11-06 15:17:14,576 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 3094 transitions. Word has length 153 [2021-11-06 15:17:14,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:17:14,576 INFO L470 AbstractCegarLoop]: Abstraction has 2334 states and 3094 transitions. [2021-11-06 15:17:14,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 3094 transitions. [2021-11-06 15:17:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-06 15:17:14,578 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:17:14,578 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:17:14,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 15:17:14,579 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:17:14,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:17:14,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1314154924, now seen corresponding path program 1 times [2021-11-06 15:17:14,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:17:14,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525549591] [2021-11-06 15:17:14,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:17:14,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:17:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:17:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-06 15:17:14,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:17:14,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525549591] [2021-11-06 15:17:14,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525549591] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:17:14,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:17:14,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 15:17:14,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699175846] [2021-11-06 15:17:14,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 15:17:14,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:17:14,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 15:17:14,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 15:17:14,786 INFO L87 Difference]: Start difference. First operand 2334 states and 3094 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:15,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:17:15,961 INFO L93 Difference]: Finished difference Result 12922 states and 17110 transitions. [2021-11-06 15:17:15,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 15:17:15,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 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 153 [2021-11-06 15:17:15,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:17:15,979 INFO L225 Difference]: With dead ends: 12922 [2021-11-06 15:17:15,980 INFO L226 Difference]: Without dead ends: 10616 [2021-11-06 15:17:15,986 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-06 15:17:15,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10616 states. [2021-11-06 15:17:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10616 to 2342. [2021-11-06 15:17:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2342 states, 2331 states have (on average 1.3307593307593308) internal successors, (3102), 2341 states have internal predecessors, (3102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 2342 states and 3102 transitions. [2021-11-06 15:17:16,112 INFO L78 Accepts]: Start accepts. Automaton has 2342 states and 3102 transitions. Word has length 153 [2021-11-06 15:17:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:17:16,113 INFO L470 AbstractCegarLoop]: Abstraction has 2342 states and 3102 transitions. [2021-11-06 15:17:16,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 3102 transitions. [2021-11-06 15:17:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-06 15:17:16,115 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:17:16,115 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:17:16,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 15:17:16,116 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:17:16,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:17:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash 707316216, now seen corresponding path program 1 times [2021-11-06 15:17:16,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:17:16,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028358038] [2021-11-06 15:17:16,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:17:16,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:17:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:17:16,332 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-06 15:17:16,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:17:16,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028358038] [2021-11-06 15:17:16,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028358038] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:17:16,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:17:16,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 15:17:16,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365478253] [2021-11-06 15:17:16,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 15:17:16,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:17:16,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 15:17:16,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 15:17:16,334 INFO L87 Difference]: Start difference. First operand 2342 states and 3102 transitions. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:17:18,554 INFO L93 Difference]: Finished difference Result 24750 states and 32850 transitions. [2021-11-06 15:17:18,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-06 15:17:18,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 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 155 [2021-11-06 15:17:18,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:17:18,586 INFO L225 Difference]: With dead ends: 24750 [2021-11-06 15:17:18,586 INFO L226 Difference]: Without dead ends: 22436 [2021-11-06 15:17:18,594 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2021-11-06 15:17:18,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22436 states. [2021-11-06 15:17:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22436 to 2352. [2021-11-06 15:17:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2341 states have (on average 1.3293464331482272) internal successors, (3112), 2351 states have internal predecessors, (3112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3112 transitions. [2021-11-06 15:17:18,827 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3112 transitions. Word has length 155 [2021-11-06 15:17:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:17:18,828 INFO L470 AbstractCegarLoop]: Abstraction has 2352 states and 3112 transitions. [2021-11-06 15:17:18,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:17:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3112 transitions. [2021-11-06 15:17:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-06 15:17:18,830 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:17:18,830 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:17:18,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 15:17:18,830 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:17:18,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:17:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash -218431236, now seen corresponding path program 1 times [2021-11-06 15:17:18,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:17:18,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284500678] [2021-11-06 15:17:18,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:17:18,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:17:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-06 15:17:20,256 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-06 15:17:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-06 15:17:21,760 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-06 15:17:21,760 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-06 15:17:21,761 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 15:17:21,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 15:17:21,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 15:17:21,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 15:17:21,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 15:17:21,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 15:17:21,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 15:17:21,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 15:17:21,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 15:17:21,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 15:17:21,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 15:17:21,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 15:17:21,766 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:17:21,768 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 15:17:22,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 03:17:22 BoogieIcfgContainer [2021-11-06 15:17:22,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 15:17:22,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 15:17:22,417 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 15:17:22,417 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 15:17:22,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 03:15:59" (3/4) ... [2021-11-06 15:17:22,420 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-06 15:17:22,420 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 15:17:22,421 INFO L168 Benchmark]: Toolchain (without parser) took 99210.03 ms. Allocated memory was 88.1 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 49.8 MB in the beginning and 619.6 MB in the end (delta: -569.8 MB). Peak memory consumption was 440.5 MB. Max. memory is 16.1 GB. [2021-11-06 15:17:22,421 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 88.1 MB. Free memory is still 47.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 15:17:22,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1300.47 ms. Allocated memory was 88.1 MB in the beginning and 140.5 MB in the end (delta: 52.4 MB). Free memory was 49.6 MB in the beginning and 74.9 MB in the end (delta: -25.3 MB). Peak memory consumption was 33.1 MB. Max. memory is 16.1 GB. [2021-11-06 15:17:22,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 236.96 ms. Allocated memory is still 140.5 MB. Free memory was 74.2 MB in the beginning and 61.3 MB in the end (delta: 12.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 16.1 GB. [2021-11-06 15:17:22,422 INFO L168 Benchmark]: Boogie Preprocessor took 346.60 ms. Allocated memory is still 140.5 MB. Free memory was 61.3 MB in the beginning and 59.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 37.9 MB. Max. memory is 16.1 GB. [2021-11-06 15:17:22,423 INFO L168 Benchmark]: RCFGBuilder took 14278.01 ms. Allocated memory was 140.5 MB in the beginning and 539.0 MB in the end (delta: 398.5 MB). Free memory was 59.0 MB in the beginning and 414.9 MB in the end (delta: -355.8 MB). Peak memory consumption was 272.5 MB. Max. memory is 16.1 GB. [2021-11-06 15:17:22,423 INFO L168 Benchmark]: TraceAbstraction took 83039.24 ms. Allocated memory was 539.0 MB in the beginning and 1.1 GB in the end (delta: 559.9 MB). Free memory was 414.9 MB in the beginning and 619.6 MB in the end (delta: -204.7 MB). Peak memory consumption was 403.5 MB. Max. memory is 16.1 GB. [2021-11-06 15:17:22,423 INFO L168 Benchmark]: Witness Printer took 3.12 ms. Allocated memory is still 1.1 GB. Free memory is still 619.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 15:17:22,424 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.14 ms. Allocated memory is still 88.1 MB. Free memory is still 47.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1300.47 ms. Allocated memory was 88.1 MB in the beginning and 140.5 MB in the end (delta: 52.4 MB). Free memory was 49.6 MB in the beginning and 74.9 MB in the end (delta: -25.3 MB). Peak memory consumption was 33.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 236.96 ms. Allocated memory is still 140.5 MB. Free memory was 74.2 MB in the beginning and 61.3 MB in the end (delta: 12.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 346.60 ms. Allocated memory is still 140.5 MB. Free memory was 61.3 MB in the beginning and 59.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 37.9 MB. Max. memory is 16.1 GB. * RCFGBuilder took 14278.01 ms. Allocated memory was 140.5 MB in the beginning and 539.0 MB in the end (delta: 398.5 MB). Free memory was 59.0 MB in the beginning and 414.9 MB in the end (delta: -355.8 MB). Peak memory consumption was 272.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 83039.24 ms. Allocated memory was 539.0 MB in the beginning and 1.1 GB in the end (delta: 559.9 MB). Free memory was 414.9 MB in the beginning and 619.6 MB in the end (delta: -204.7 MB). Peak memory consumption was 403.5 MB. Max. memory is 16.1 GB. * Witness Printer took 3.12 ms. Allocated memory is still 1.1 GB. Free memory is still 619.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 4403]: 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 4507, overapproximation of bitwiseOr at line 4818. Possible FailurePath: [L4426] int LDV_IN_INTERRUPT = 1; [L4427] int ldv_state_variable_2 ; [L4428] struct usb_serial *kobil_device_group2 ; [L4429] int ref_cnt ; [L4430] struct usb_interface *kobil_driver_group1 ; [L4431] struct file *kobil_device_group0 ; [L4432] struct tty_struct *kobil_device_group1 ; [L4433] int ldv_state_variable_1 ; [L4434] int usb_counter ; [L4435] struct usb_serial_port *kobil_device_group3 ; [L4436] int ldv_state_variable_0 ; [L4590] static int debug ; [L4608-L4618] static struct usb_device_id const id_table[5U] = { {3U, 3398U, 8209U, (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}, {3U, 3398U, 8210U, (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}, {3U, 3398U, 120U, (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}, {3U, 3398U, 129U, (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}}; [L4619] struct usb_device_id const __mod_usb_device_table ; [L4620-L4625] static struct usb_driver kobil_driver = {"kobil", & usb_serial_probe, & usb_serial_disconnect, 0, 0, 0, 0, 0, 0, (struct usb_device_id const *)(& id_table), {{{{{0U}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, 1U, (unsigned char)0, (unsigned char)0}; [L4626-L4633] static struct usb_serial_driver kobil_device = {"KOBIL USB smart card terminal", (struct usb_device_id const *)(& id_table), 1, {0, 0}, {"kobil", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, & kobil_driver, {{{{{0U}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, 0UL, 0UL, 0, & kobil_startup, 0, 0, & kobil_release, 0, 0, 0, 0, & kobil_open, & kobil_close, & kobil_write, & kobil_write_room, & kobil_ioctl, & kobil_set_termios, 0, 0, 0, 0, & kobil_tiocmget, & kobil_tiocmset, 0, 0, 0, & kobil_init_termios, & kobil_read_int_callback, 0, 0, 0, 0, 0}; [L5289] int ldv_retval_2 ; [L5291] int ldv_retval_0 ; [L5293] int ldv_retval_1 ; [L5295] int ldv_retval_3 ; [L5750] struct tty_struct___0 *ldv_latest_tty ; VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L5325] unsigned char *ldvarg7 ; [L5326] void *tmp ; [L5327] unsigned int ldvarg3 ; [L5328] unsigned int tmp___0 ; [L5329] unsigned int ldvarg0 ; [L5330] unsigned int tmp___1 ; [L5331] struct urb *ldvarg5 ; [L5332] void *tmp___2 ; [L5333] int ldvarg6 ; [L5334] int tmp___3 ; [L5335] unsigned int ldvarg1 ; [L5336] unsigned int tmp___4 ; [L5337] struct ktermios *ldvarg4 ; [L5338] void *tmp___5 ; [L5339] unsigned long ldvarg2 ; [L5340] unsigned long tmp___6 ; [L5341] struct usb_device_id *ldvarg8 ; [L5342] void *tmp___7 ; [L5343] int tmp___8 ; [L5344] int tmp___9 ; [L5345] int tmp___10 ; [L5346] int tmp___11 ; [L4368] void *p ; [L4369] void *tmp ; [L4370] int tmp___0 ; [L4372] tmp___0 = __VERIFIER_nondet_int() [L4373] COND TRUE tmp___0 != 0 [L4374] return ((void *)0); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L5348] tmp = ldv_zalloc(1UL) [L5349] ldvarg7 = (unsigned char *)tmp [L5350] tmp___0 = __VERIFIER_nondet_uint() [L5351] ldvarg3 = tmp___0 [L5352] tmp___1 = __VERIFIER_nondet_uint() [L5353] ldvarg0 = tmp___1 [L4368] void *p ; [L4369] void *tmp ; [L4370] int tmp___0 ; [L4372] tmp___0 = __VERIFIER_nondet_int() [L4373] COND TRUE tmp___0 != 0 [L4374] return ((void *)0); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L5354] tmp___2 = ldv_zalloc(192UL) [L5355] ldvarg5 = (struct urb *)tmp___2 [L5356] tmp___3 = __VERIFIER_nondet_int() [L5357] ldvarg6 = tmp___3 [L5358] tmp___4 = __VERIFIER_nondet_uint() [L5359] ldvarg1 = tmp___4 [L4368] void *p ; [L4369] void *tmp ; [L4370] int tmp___0 ; [L4372] tmp___0 = __VERIFIER_nondet_int() [L4373] COND TRUE tmp___0 != 0 [L4374] return ((void *)0); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L5360] tmp___5 = ldv_zalloc(44UL) [L5361] ldvarg4 = (struct ktermios *)tmp___5 [L5362] tmp___6 = __VERIFIER_nondet_ulong() [L5363] ldvarg2 = tmp___6 [L4368] void *p ; [L4369] void *tmp ; [L4370] int tmp___0 ; [L4372] tmp___0 = __VERIFIER_nondet_int() [L4373] COND TRUE tmp___0 != 0 [L4374] return ((void *)0); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L5364] tmp___7 = ldv_zalloc(24UL) [L5365] ldvarg8 = (struct usb_device_id *)tmp___7 [L4351] void *p ; [L4352] void *tmp ; [L4353] int tmp___0 ; [L4355] tmp___0 = __VERIFIER_nondet_int() [L4356] COND FALSE !(tmp___0 != 0) [L4359] tmp = malloc(size) [L4360] p = tmp [L4347] COND FALSE !(!cond) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L4362] return (p); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L5754] ldv_latest_tty = ldv_malloc(sizeof(struct tty_struct___0)) [L5755] COND TRUE (unsigned long )ldv_latest_tty != (unsigned long )((void *)0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L5367] ldv_state_variable_1 = 0 [L5368] ref_cnt = 0 [L5369] ldv_state_variable_0 = 1 [L5370] ldv_state_variable_2 = 0 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L5372] tmp___8 = __VERIFIER_nondet_int() [L5374] case 0: [L5587] case 1: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L5588] COND TRUE ldv_state_variable_0 != 0 [L5589] tmp___10 = __VERIFIER_nondet_int() [L5591] case 0: [L5599] case 1: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L5600] COND TRUE ldv_state_variable_0 == 1 [L5260] int retval ; [L5884] return __VERIFIER_nondet_int(); [L5262] retval = usb_serial_register(& kobil_device) [L5263] COND FALSE !(retval != 0) [L4505] int tmp ; [L4507] CALL, EXPR ldv_usb_register_driver_5(driver, & __this_module, "kobil_sct") [L5687] ldv_func_ret_type___0 ldv_func_res ; [L5688] int tmp ; [L5870] return __VERIFIER_nondet_int(); [L5690] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L5691] ldv_func_res = tmp [L5692] ldv_state_variable_2 = 1 [L5693] usb_counter = 0 [L5316] void *tmp ; [L4368] void *p ; [L4369] void *tmp ; [L4370] int tmp___0 ; [L4372] tmp___0 = __VERIFIER_nondet_int() [L4373] COND TRUE tmp___0 != 0 [L4374] return ((void *)0); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L5318] tmp = ldv_zalloc(1248UL) [L5319] kobil_driver_group1 = (struct usb_interface *)tmp VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L5695] return (ldv_func_res); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L4507] tmp = ldv_usb_register_driver_5(driver, & __this_module, "kobil_sct") [L4508] return (tmp); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L5267] retval = usb_register(& kobil_driver) [L5268] COND FALSE !(retval != 0) [L5273] return (0); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L5601] ldv_retval_2 = kobil_init() [L5602] COND FALSE !(ldv_retval_2 != 0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L5607] COND TRUE ldv_retval_2 == 0 [L5608] ldv_state_variable_0 = 2 [L5609] ldv_state_variable_1 = 1 [L5298] void *tmp ; [L5299] void *tmp___0 ; [L5300] void *tmp___1 ; [L5301] void *tmp___2 ; [L4368] void *p ; [L4369] void *tmp ; [L4370] int tmp___0 ; [L4372] tmp___0 = __VERIFIER_nondet_int() [L4373] COND TRUE tmp___0 != 0 [L4374] return ((void *)0); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L5303] tmp = ldv_zalloc(336UL) [L5304] kobil_device_group0 = (struct file *)tmp [L4368] void *p ; [L4369] void *tmp ; [L4370] int tmp___0 ; [L4372] tmp___0 = __VERIFIER_nondet_int() [L4373] COND TRUE tmp___0 != 0 [L4374] return ((void *)0); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L5305] tmp___0 = ldv_zalloc(2704UL) [L5306] kobil_device_group1 = (struct tty_struct *)tmp___0 [L4368] void *p ; [L4369] void *tmp ; [L4370] int tmp___0 ; [L4372] tmp___0 = __VERIFIER_nondet_int() [L4373] COND TRUE tmp___0 != 0 [L4374] return ((void *)0); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L5307] tmp___1 = ldv_zalloc(280UL) [L5308] kobil_device_group2 = (struct usb_serial *)tmp___1 [L4368] void *p ; [L4369] void *tmp ; [L4370] int tmp___0 ; [L4372] tmp___0 = __VERIFIER_nondet_int() [L4373] COND TRUE tmp___0 != 0 [L4374] return ((void *)0); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L5309] tmp___2 = ldv_zalloc(2320UL) [L5310] kobil_device_group3 = (struct usb_serial_port *)tmp___2 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L5372] tmp___8 = __VERIFIER_nondet_int() [L5374] case 0: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L5375] COND TRUE ldv_state_variable_1 != 0 [L5376] tmp___9 = __VERIFIER_nondet_int() [L5378] case 0: [L5386] case 1: [L5396] case 2: [L5403] case 3: [L5410] case 4: [L5432] case 5: [L5442] case 6: [L5464] case 7: [L5486] case 8: [L5494] case 9: [L5516] case 10: [L5538] case 11: [L5560] case 12: [L5572] case 13: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L5573] COND TRUE ldv_state_variable_1 == 1 [L5817] return __VERIFIER_nondet_int(); [L5575] ldv_state_variable_1 = 2 [L5576] ref_cnt = ref_cnt + 1 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L5372] tmp___8 = __VERIFIER_nondet_int() [L5374] case 0: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L5375] COND TRUE ldv_state_variable_1 != 0 [L5376] tmp___9 = __VERIFIER_nondet_int() [L5378] case 0: [L5386] case 1: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L5387] COND TRUE ldv_state_variable_1 == 2 [L4636] int i ; [L4637] struct kobil_private *priv ; [L4638] struct usb_device *pdev ; [L4639] struct usb_host_config *actconfig ; [L4640] struct usb_interface *interface ; [L4641] struct usb_host_interface *altsetting ; [L4642] struct usb_host_endpoint *endpoint ; [L4643] void *tmp ; [L4644] int tmp___0 ; [L4645] int tmp___1 ; [L4300] void *ret ; [L4301] void *tmp ; [L4302] struct kmem_cache *s ; [L4303] struct kmem_cache *tmp___0 ; [L4304] void *tmp___1 ; VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4306] COND FALSE !(0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4351] void *p ; [L4352] void *tmp ; [L4353] int tmp___0 ; [L4355] tmp___0 = __VERIFIER_nondet_int() [L4356] COND FALSE !(tmp___0 != 0) [L4359] tmp = malloc(size) [L4360] p = tmp [L4347] COND FALSE !(!cond) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4362] return (p); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4277] return ldv_malloc(size); [L4327] tmp___1 = __kmalloc(size, flags) [L4328] return (tmp___1); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4647] tmp = kmalloc(320UL, 208U) [L4648] priv = (struct kobil_private *)tmp VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4649] COND FALSE !((unsigned long )priv == (unsigned long )((struct kobil_private *)0)) [L4653] priv->filled = 0 [L4654] priv->cur_pos = 0 [L4655] EXPR serial->dev [L4655] EXPR (serial->dev)->descriptor.idProduct [L4655] priv->device_type = (serial->dev)->descriptor.idProduct [L4656] priv->device_type [L4657] case 8209: [L4671] serial->port[0] [L4672] EXPR serial->dev [L4672] pdev = serial->dev [L4673] EXPR pdev->actconfig [L4673] actconfig = pdev->actconfig [L4674] EXPR actconfig->interface[0] [L4674] interface = actconfig->interface[0] [L4675] EXPR interface->cur_altsetting [L4675] altsetting = interface->cur_altsetting [L4676] EXPR altsetting->endpoint [L4676] endpoint = altsetting->endpoint [L4677] i = 0 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4703] EXPR altsetting->desc.bNumEndpoints VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4703] COND FALSE !((int )altsetting->desc.bNumEndpoints > i) [L4707] return (0); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L5388] ldv_retval_1 = kobil_startup(kobil_device_group2) [L5389] COND TRUE ldv_retval_1 == 0 [L5390] ldv_state_variable_1 = 3 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L5372] tmp___8 = __VERIFIER_nondet_int() [L5374] case 0: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L5375] COND TRUE ldv_state_variable_1 != 0 [L5376] tmp___9 = __VERIFIER_nondet_int() [L5378] case 0: [L5386] case 1: [L5396] case 2: [L5403] case 3: [L5410] case 4: [L5432] case 5: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L5433] COND TRUE ldv_state_variable_1 == 3 [L4746] int result ; [L4747] struct kobil_private *priv ; [L4748] unsigned char *transfer_buffer ; [L4749] int transfer_buffer_length ; [L4750] int write_urb_transfer_buffer_length ; [L4751] void *tmp ; [L4752] void *tmp___0 ; [L4753] unsigned int tmp___1 ; [L4754] unsigned int tmp___2 ; [L4755] unsigned int tmp___3 ; [L4756] unsigned int tmp___4 ; [L4758] result = 0 [L4759] transfer_buffer_length = 8 [L4760] write_urb_transfer_buffer_length = 8 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4761] COND FALSE !(debug != 0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4549] void *tmp ; [L4351] void *p ; [L4352] void *tmp ; [L4353] int tmp___0 ; [L4355] tmp___0 = __VERIFIER_nondet_int() [L4356] COND TRUE tmp___0 != 0 [L4357] return ((void *)0); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L5799] return ldv_malloc(0UL); [L4551] tmp = dev_get_drvdata((struct device const *)(& port->dev)) [L4552] return (tmp); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4766] tmp = usb_get_serial_port_data(port) [L4767] priv = (struct kobil_private *)tmp [L4768] EXPR port->interrupt_in_urb [L4768] EXPR port->serial [L4768] EXPR (port->serial)->dev [L4768] (port->interrupt_in_urb)->dev = (port->serial)->dev [L4334] void *tmp ; [L4300] void *ret ; [L4301] void *tmp ; [L4302] struct kmem_cache *s ; [L4303] struct kmem_cache *tmp___0 ; [L4304] void *tmp___1 ; VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4306] COND FALSE !(0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4351] void *p ; [L4352] void *tmp ; [L4353] int tmp___0 ; [L4355] tmp___0 = __VERIFIER_nondet_int() [L4356] COND FALSE !(tmp___0 != 0) [L4359] tmp = malloc(size) [L4360] p = tmp [L4347] COND FALSE !(!cond) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4362] return (p); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4277] return ldv_malloc(size); [L4327] tmp___1 = __kmalloc(size, flags) [L4328] return (tmp___1); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4336] tmp = kmalloc(size, flags | 32768U) [L4337] return (tmp); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4769] tmp___0 = kzalloc((size_t )transfer_buffer_length, 208U) [L4770] transfer_buffer = (unsigned char *)tmp___0 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4771] COND FALSE !((unsigned long )transfer_buffer == (unsigned long )((unsigned char *)0U)) [L4775] EXPR port->write_urb VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4775] COND FALSE !((unsigned long )port->write_urb == (unsigned long )((struct urb *)0)) [L4794] EXPR port->write_urb [L4300] void *ret ; [L4301] void *tmp ; [L4302] struct kmem_cache *s ; [L4303] struct kmem_cache *tmp___0 ; [L4304] void *tmp___1 ; VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4306] COND FALSE !(0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4351] void *p ; [L4352] void *tmp ; [L4353] int tmp___0 ; [L4355] tmp___0 = __VERIFIER_nondet_int() [L4356] COND TRUE tmp___0 != 0 [L4357] return ((void *)0); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4277] return ldv_malloc(size); [L4327] tmp___1 = __kmalloc(size, flags) [L4328] return (tmp___1); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4794-L4795] (port->write_urb)->transfer_buffer = kmalloc((size_t )write_urb_transfer_buffer_length, 208U) [L4796] EXPR port->write_urb [L4796] EXPR (port->write_urb)->transfer_buffer VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4796] COND FALSE !((unsigned long )(port->write_urb)->transfer_buffer == (unsigned long )((void *)0)) [L4803] EXPR port->serial [L4803] EXPR (port->serial)->dev [L4544] EXPR dev->devnum [L4544] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L4803] tmp___1 = __create_pipe((port->serial)->dev, 0U) [L4804] EXPR port->serial [L4804] EXPR (port->serial)->dev [L5854] return __VERIFIER_nondet_int(); [L4804-L4806] result = usb_control_msg((port->serial)->dev, tmp___1 | 2147483776U, 16, 194, 2, 0, (void *)transfer_buffer, (int )((__u16 )transfer_buffer_length), 500) [L4807] COND FALSE !(debug != 0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4812] COND FALSE !(debug != 0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4817] EXPR port->serial [L4817] EXPR (port->serial)->dev [L4544] EXPR dev->devnum [L4544] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L4817] tmp___2 = __create_pipe((port->serial)->dev, 0U) [L4818] EXPR port->serial [L4818] EXPR (port->serial)->dev [L5854] return __VERIFIER_nondet_int(); [L4818-L4820] result = usb_control_msg((port->serial)->dev, tmp___2 | 2147483776U, 16, 194, 1, 0, (void *)transfer_buffer, (int )((__u16 )transfer_buffer_length), 500) [L4821] COND FALSE !(debug != 0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4826] COND FALSE !(debug != 0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4831] EXPR priv->device_type [L4831] (unsigned int )priv->device_type == 8209U || (unsigned int )priv->device_type == 8210U [L4831] EXPR priv->device_type [L4831] (unsigned int )priv->device_type == 8209U || (unsigned int )priv->device_type == 8210U VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4831] COND FALSE !((unsigned int )priv->device_type == 8209U || (unsigned int )priv->device_type == 8210U) [L4850] EXPR priv->device_type [L4850] EXPR (unsigned int )priv->device_type == 120U || (unsigned int )priv->device_type == 8209U [L4850] EXPR priv->device_type [L4850] EXPR (unsigned int )priv->device_type == 120U || (unsigned int )priv->device_type == 8209U VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4850] ((unsigned int )priv->device_type == 120U || (unsigned int )priv->device_type == 8209U) || (unsigned int )priv->device_type == 129U [L4850] EXPR priv->device_type [L4850] ((unsigned int )priv->device_type == 120U || (unsigned int )priv->device_type == 8209U) || (unsigned int )priv->device_type == 129U VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4850] COND FALSE !(((unsigned int )priv->device_type == 120U || (unsigned int )priv->device_type == 8209U) || (unsigned int )priv->device_type == 129U) [L4860] return (0); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L5434] ldv_retval_0 = kobil_open(kobil_device_group1, kobil_device_group3) [L5435] COND TRUE ldv_retval_0 == 0 [L5436] ldv_state_variable_1 = 4 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L5372] tmp___8 = __VERIFIER_nondet_int() [L5374] case 0: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L5375] COND TRUE ldv_state_variable_1 != 0 [L5376] tmp___9 = __VERIFIER_nondet_int() [L5378] case 0: [L5386] case 1: [L5396] case 2: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L5397] COND TRUE ldv_state_variable_1 == 4 [L4884] int result ; [L4885] struct usb_serial_port *port ; [L4886] struct tty_struct *tty ; [L4887] unsigned char *data ; [L4888] int status ; [L4890] EXPR urb->context [L4890] port = (struct usb_serial_port *)urb->context [L4891] EXPR urb->transfer_buffer [L4891] data = (unsigned char *)urb->transfer_buffer [L4892] EXPR urb->status [L4892] status = urb->status [L4893] COND FALSE !(debug != 0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4898] COND FALSE !(status != 0) [L5700] ldv_func_ret_type___1 ldv_func_res ; [L5701] struct tty_struct *tmp ; [L4351] void *p ; [L4352] void *tmp ; [L4353] int tmp___0 ; [L4355] tmp___0 = __VERIFIER_nondet_int() [L4356] COND TRUE tmp___0 != 0 [L4357] return ((void *)0); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L5847] return ldv_malloc(sizeof(struct tty_struct)); [L5703] tmp = tty_port_tty_get(ldv_func_arg1) [L5704] ldv_func_res = tmp [L5776] ldv_latest_tty = tty VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L5706] return (ldv_func_res); VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4907] tty = ldv_tty_port_tty_get_6(& port->port) [L4908] EXPR urb->actual_length VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4908] COND TRUE urb->actual_length != 0U [L4909] urb->actual_length [L5666] int tmp ; [L5783] COND FALSE !((unsigned long )tty != (unsigned long )ldv_latest_tty || tty) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4403] reach_error() VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={55340232221128654858:55340232221128654873}, debug=0, id_table={18446744073709551821:0}, kobil_device={18446744073709551797:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={18446744073709551729:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] - UnprovableResult [Line: 4403]: 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: 4403]: 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: 4403]: 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: 4403]: 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: 4403]: 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: 4403]: 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: 4403]: 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: 4403]: 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: 4403]: 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: 4403]: 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, 1817 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 82.3s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 67.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 27705 SDtfs, 45936 SDslu, 57506 SDs, 0 SdLazy, 3124 SolverSat, 507 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 60.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2352occurred in iteration=17, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 47867 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 7.9s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2025 NumberOfCodeBlocks, 2025 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1849 ConstructedInterpolants, 0 QuantifiedInterpolants, 5481 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3710 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 450/462 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-06 15:17:22,478 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-validator-v0.6/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point.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 d0954289a294fb2be404f98afcefa652a2fbf60d586d07e7d68c419183f4ff07 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 15:17:24,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 15:17:24,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 15:17:24,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 15:17:24,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 15:17:24,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 15:17:24,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 15:17:24,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 15:17:24,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 15:17:24,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 15:17:24,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 15:17:24,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 15:17:24,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 15:17:24,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 15:17:24,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 15:17:24,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 15:17:24,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 15:17:24,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 15:17:24,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 15:17:24,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 15:17:24,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 15:17:24,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 15:17:24,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 15:17:24,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 15:17:24,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 15:17:24,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 15:17:24,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 15:17:24,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 15:17:24,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 15:17:24,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 15:17:24,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 15:17:24,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 15:17:24,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 15:17:24,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 15:17:24,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 15:17:24,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 15:17:24,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 15:17:24,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 15:17:24,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 15:17:24,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 15:17:24,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 15:17:24,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-06 15:17:24,243 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 15:17:24,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 15:17:24,244 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 15:17:24,244 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 15:17:24,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 15:17:24,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 15:17:24,246 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 15:17:24,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 15:17:24,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 15:17:24,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 15:17:24,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 15:17:24,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 15:17:24,247 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-06 15:17:24,247 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-06 15:17:24,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 15:17:24,248 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 15:17:24,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 15:17:24,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 15:17:24,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 15:17:24,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 15:17:24,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 15:17:24,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 15:17:24,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 15:17:24,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 15:17:24,255 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-06 15:17:24,256 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-06 15:17:24,256 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 15:17:24,256 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 15:17:24,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 15:17:24,256 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 15:17:24,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-06 15:17:24,256 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 -> d0954289a294fb2be404f98afcefa652a2fbf60d586d07e7d68c419183f4ff07 [2021-11-06 15:17:24,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 15:17:24,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 15:17:24,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 15:17:24,545 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 15:17:24,545 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 15:17:24,546 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point.cil.out.i [2021-11-06 15:17:24,598 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bcd990e9/3321435f6a694877a707c682733f7940/FLAGbf054f36c [2021-11-06 15:17:25,220 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 15:17:25,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point.cil.out.i [2021-11-06 15:17:25,253 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bcd990e9/3321435f6a694877a707c682733f7940/FLAGbf054f36c [2021-11-06 15:17:25,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bcd990e9/3321435f6a694877a707c682733f7940 [2021-11-06 15:17:25,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 15:17:25,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 15:17:25,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 15:17:25,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 15:17:25,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 15:17:25,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 03:17:25" (1/1) ... [2021-11-06 15:17:25,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52582b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:17:25, skipping insertion in model container [2021-11-06 15:17:25,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 03:17:25" (1/1) ... [2021-11-06 15:17:25,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 15:17:25,483 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 15:17:25,799 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name writepages at C: (*writepages)(struct address_space___0 * , struct writeback_control * ) [3507] [2021-11-06 15:17:25,803 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name readpages at C: (*readpages)(struct file___0 *filp , struct address_space___0 *mapping , struct list_head *pages , unsigned int nr_pages ) [3509-3510] [2021-11-06 15:17:25,804 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name write_begin at C: (*write_begin)(struct file___0 * , struct address_space___0 *mapping , loff_t pos , unsigned int len , unsigned int flags , struct page **pagep , void **fsdata ) [3511-3513] [2021-11-06 15:17:25,804 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name write_end at C: (*write_end)(struct file___0 * , struct address_space___0 *mapping , loff_t pos , unsigned int len , unsigned int copied , struct page *page , void *fsdata ) [3514-3515] [2021-11-06 15:17:25,804 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name bmap at C: (*bmap)(struct address_space___0 * , sector_t ) [3516] [2021-11-06 15:17:25,805 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name get_xip_mem at C: (*get_xip_mem)(struct address_space___0 * , unsigned long , int , void ** , unsigned long * ) [3522-3523] [2021-11-06 15:17:25,806 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name migratepage at C: (*migratepage)(struct address_space___0 * , struct page * , struct page * ) [3524] [2021-11-06 15:17:25,807 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name error_remove_page at C: (*error_remove_page)(struct address_space___0 * , struct page * ) [3527] [2021-11-06 15:17:25,822 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name carrier_raised at C: (*carrier_raised)(struct tty_port___0 *port ) [3940] [2021-11-06 15:17:25,823 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name dtr_rts at C: (*dtr_rts)(struct tty_port___0 *port , int raise ) [3941] [2021-11-06 15:17:25,823 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name shutdown at C: (*shutdown)(struct tty_port___0 *port ) [3942] [2021-11-06 15:17:25,824 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name drop at C: (*drop)(struct tty_port___0 *port ) [3943] [2021-11-06 15:17:25,824 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name activate at C: (*activate)(struct tty_port___0 *port , struct tty_struct___0 *tty ) [3944] [2021-11-06 15:17:25,824 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name destruct at C: (*destruct)(struct tty_port___0 *port ) [3945] [2021-11-06 15:17:26,055 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-validator-v0.6/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point.cil.out.i[130795,130808] [2021-11-06 15:17:26,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 15:17:26,353 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 15:17:26,458 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name writepages at C: (*writepages)(struct address_space___0 * , struct writeback_control * ) [3507] [2021-11-06 15:17:26,458 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name readpages at C: (*readpages)(struct file___0 *filp , struct address_space___0 *mapping , struct list_head *pages , unsigned int nr_pages ) [3509-3510] [2021-11-06 15:17:26,458 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name write_begin at C: (*write_begin)(struct file___0 * , struct address_space___0 *mapping , loff_t pos , unsigned int len , unsigned int flags , struct page **pagep , void **fsdata ) [3511-3513] [2021-11-06 15:17:26,458 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name write_end at C: (*write_end)(struct file___0 * , struct address_space___0 *mapping , loff_t pos , unsigned int len , unsigned int copied , struct page *page , void *fsdata ) [3514-3515] [2021-11-06 15:17:26,458 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name bmap at C: (*bmap)(struct address_space___0 * , sector_t ) [3516] [2021-11-06 15:17:26,459 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name get_xip_mem at C: (*get_xip_mem)(struct address_space___0 * , unsigned long , int , void ** , unsigned long * ) [3522-3523] [2021-11-06 15:17:26,459 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name migratepage at C: (*migratepage)(struct address_space___0 * , struct page * , struct page * ) [3524] [2021-11-06 15:17:26,459 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name error_remove_page at C: (*error_remove_page)(struct address_space___0 * , struct page * ) [3527] [2021-11-06 15:17:26,465 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name carrier_raised at C: (*carrier_raised)(struct tty_port___0 *port ) [3940] [2021-11-06 15:17:26,465 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name dtr_rts at C: (*dtr_rts)(struct tty_port___0 *port , int raise ) [3941] [2021-11-06 15:17:26,465 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name shutdown at C: (*shutdown)(struct tty_port___0 *port ) [3942] [2021-11-06 15:17:26,466 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name drop at C: (*drop)(struct tty_port___0 *port ) [3943] [2021-11-06 15:17:26,466 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name activate at C: (*activate)(struct tty_port___0 *port , struct tty_struct___0 *tty ) [3944] [2021-11-06 15:17:26,467 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name destruct at C: (*destruct)(struct tty_port___0 *port ) [3945] [2021-11-06 15:17:26,511 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-validator-v0.6/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point.cil.out.i[130795,130808] [2021-11-06 15:17:26,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 15:17:26,731 INFO L208 MainTranslator]: Completed translation [2021-11-06 15:17:26,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:17:26 WrapperNode [2021-11-06 15:17:26,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 15:17:26,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 15:17:26,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 15:17:26,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 15:17:26,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:17:26" (1/1) ... [2021-11-06 15:17:26,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:17:26" (1/1) ... [2021-11-06 15:17:26,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 15:17:26,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 15:17:26,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 15:17:26,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 15:17:26,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:17:26" (1/1) ... [2021-11-06 15:17:26,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:17:26" (1/1) ... [2021-11-06 15:17:27,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:17:26" (1/1) ... [2021-11-06 15:17:27,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:17:26" (1/1) ... [2021-11-06 15:17:27,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:17:26" (1/1) ... [2021-11-06 15:17:27,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:17:26" (1/1) ... [2021-11-06 15:17:27,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:17:26" (1/1) ... [2021-11-06 15:17:27,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 15:17:27,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 15:17:27,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 15:17:27,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 15:17:27,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:17:26" (1/1) ... [2021-11-06 15:17:27,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 15:17:27,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 15:17:27,444 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-06 15:17:27,461 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-06 15:17:27,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-06 15:17:27,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-06 15:17:27,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 15:17:27,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-06 15:17:27,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 15:17:27,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-06 15:17:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-06 15:17:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-06 15:17:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-06 15:17:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 15:17:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_alloc_notrace [2021-11-06 15:17:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 15:17:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 15:17:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-06 15:17:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-06 15:17:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-06 15:17:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 15:17:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-06 15:17:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-06 15:17:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 15:17:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-06 15:17:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 15:17:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-06 15:17:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-06 15:17:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-06 15:17:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-06 15:17:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-06 15:17:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 15:17:27,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 15:18:05,582 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 15:18:05,583 INFO L299 CfgBuilder]: Removed 1401 assume(true) statements. [2021-11-06 15:18:05,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 03:18:05 BoogieIcfgContainer [2021-11-06 15:18:05,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 15:18:05,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 15:18:05,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 15:18:05,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 15:18:05,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 03:17:25" (1/3) ... [2021-11-06 15:18:05,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d31c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 03:18:05, skipping insertion in model container [2021-11-06 15:18:05,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:17:26" (2/3) ... [2021-11-06 15:18:05,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d31c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 03:18:05, skipping insertion in model container [2021-11-06 15:18:05,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 03:18:05" (3/3) ... [2021-11-06 15:18:05,597 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point.cil.out.i [2021-11-06 15:18:05,601 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 15:18:05,601 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-06 15:18:05,648 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 15:18:05,655 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-06 15:18:05,656 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-06 15:18:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 1817 states, 1805 states have (on average 1.5501385041551246) internal successors, (2798), 1816 states have internal predecessors, (2798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:18:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-06 15:18:05,721 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:18:05,721 INFO L513 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] [2021-11-06 15:18:05,722 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:18:05,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:18:05,726 INFO L85 PathProgramCache]: Analyzing trace with hash 666057958, now seen corresponding path program 1 times [2021-11-06 15:18:05,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 15:18:05,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206468108] [2021-11-06 15:18:05,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:18:05,739 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 15:18:05,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 15:18:05,741 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-06 15:18:05,747 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-06 15:18:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:18:06,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 15:18:06,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:18:07,442 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-06 15:18:07,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 15:18:08,000 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-06 15:18:08,001 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 15:18:08,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206468108] [2021-11-06 15:18:08,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206468108] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 15:18:08,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:18:08,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 15:18:08,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142791130] [2021-11-06 15:18:08,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 15:18:08,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 15:18:08,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 15:18:08,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 15:18:08,018 INFO L87 Difference]: Start difference. First operand has 1817 states, 1805 states have (on average 1.5501385041551246) internal successors, (2798), 1816 states have internal predecessors, (2798), 0 states have call successors, (0), 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 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:18:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:18:13,048 INFO L93 Difference]: Finished difference Result 3482 states and 5201 transitions. [2021-11-06 15:18:13,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 15:18:13,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 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 31 [2021-11-06 15:18:13,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:18:13,067 INFO L225 Difference]: With dead ends: 3482 [2021-11-06 15:18:13,067 INFO L226 Difference]: Without dead ends: 1644 [2021-11-06 15:18:13,074 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-06 15:18:13,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2021-11-06 15:18:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 890. [2021-11-06 15:18:13,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 879 states have (on average 1.3902161547212741) internal successors, (1222), 889 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:18:13,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1222 transitions. [2021-11-06 15:18:13,134 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1222 transitions. Word has length 31 [2021-11-06 15:18:13,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:18:13,134 INFO L470 AbstractCegarLoop]: Abstraction has 890 states and 1222 transitions. [2021-11-06 15:18:13,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:18:13,135 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1222 transitions. [2021-11-06 15:18:13,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-06 15:18:13,136 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:18:13,136 INFO L513 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] [2021-11-06 15:18:13,157 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-06 15:18:13,353 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-06 15:18:13,353 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:18:13,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:18:13,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1572646806, now seen corresponding path program 1 times [2021-11-06 15:18:13,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 15:18:13,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105132254] [2021-11-06 15:18:13,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:18:13,355 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 15:18:13,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 15:18:13,356 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-06 15:18:13,358 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-06 15:18:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:18:14,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 15:18:14,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:18:14,515 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-06 15:18:14,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 15:18:14,823 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-06 15:18:14,824 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 15:18:14,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105132254] [2021-11-06 15:18:14,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105132254] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 15:18:14,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:18:14,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 15:18:14,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515912044] [2021-11-06 15:18:14,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:18:14,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 15:18:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:18:14,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:18:14,826 INFO L87 Difference]: Start difference. First operand 890 states and 1222 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:18:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:18:16,965 INFO L93 Difference]: Finished difference Result 1793 states and 2471 transitions. [2021-11-06 15:18:16,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:18:16,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-11-06 15:18:16,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:18:16,968 INFO L225 Difference]: With dead ends: 1793 [2021-11-06 15:18:16,969 INFO L226 Difference]: Without dead ends: 931 [2021-11-06 15:18:16,970 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:18:16,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-11-06 15:18:16,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 931. [2021-11-06 15:18:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 920 states have (on average 1.391304347826087) internal successors, (1280), 930 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:18:16,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1280 transitions. [2021-11-06 15:18:16,990 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1280 transitions. Word has length 33 [2021-11-06 15:18:16,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:18:16,990 INFO L470 AbstractCegarLoop]: Abstraction has 931 states and 1280 transitions. [2021-11-06 15:18:16,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:18:16,991 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1280 transitions. [2021-11-06 15:18:16,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 15:18:16,994 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:18:16,994 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 15:18:17,017 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-06 15:18:17,203 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-06 15:18:17,203 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:18:17,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:18:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash 516484420, now seen corresponding path program 1 times [2021-11-06 15:18:17,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 15:18:17,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363945493] [2021-11-06 15:18:17,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:18:17,206 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 15:18:17,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 15:18:17,207 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-06 15:18:17,209 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-06 15:18:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:18:18,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 15:18:18,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:18:18,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:18:18,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 15:18:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:18:19,289 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 15:18:19,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363945493] [2021-11-06 15:18:19,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363945493] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 15:18:19,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:18:19,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 15:18:19,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038390740] [2021-11-06 15:18:19,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 15:18:19,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 15:18:19,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 15:18:19,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 15:18:19,291 INFO L87 Difference]: Start difference. First operand 931 states and 1280 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:18:22,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:18:22,285 INFO L93 Difference]: Finished difference Result 2719 states and 3752 transitions. [2021-11-06 15:18:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 15:18:22,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-06 15:18:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:18:22,291 INFO L225 Difference]: With dead ends: 2719 [2021-11-06 15:18:22,291 INFO L226 Difference]: Without dead ends: 1802 [2021-11-06 15:18:22,293 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 15:18:22,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2021-11-06 15:18:22,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 927. [2021-11-06 15:18:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 916 states have (on average 1.388646288209607) internal successors, (1272), 926 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:18:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1272 transitions. [2021-11-06 15:18:22,313 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1272 transitions. Word has length 54 [2021-11-06 15:18:22,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:18:22,313 INFO L470 AbstractCegarLoop]: Abstraction has 927 states and 1272 transitions. [2021-11-06 15:18:22,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:18:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1272 transitions. [2021-11-06 15:18:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-06 15:18:22,315 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:18:22,316 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 15:18:22,340 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-06 15:18:22,531 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-06 15:18:22,531 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:18:22,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:18:22,532 INFO L85 PathProgramCache]: Analyzing trace with hash 822335382, now seen corresponding path program 1 times [2021-11-06 15:18:22,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 15:18:22,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85464651] [2021-11-06 15:18:22,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:18:22,534 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 15:18:22,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 15:18:22,535 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-06 15:18:22,537 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-06 15:18:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:18:23,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 15:18:23,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:18:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:18:24,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 15:18:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:18:24,792 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 15:18:24,792 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85464651] [2021-11-06 15:18:24,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85464651] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 15:18:24,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:18:24,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 15:18:24,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126085671] [2021-11-06 15:18:24,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 15:18:24,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 15:18:24,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 15:18:24,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:18:24,794 INFO L87 Difference]: Start difference. First operand 927 states and 1272 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-06 15:18:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:18:30,586 INFO L93 Difference]: Finished difference Result 2001 states and 2812 transitions. [2021-11-06 15:18:30,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 15:18:30,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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 60 [2021-11-06 15:18:30,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:18:30,590 INFO L225 Difference]: With dead ends: 2001 [2021-11-06 15:18:30,590 INFO L226 Difference]: Without dead ends: 1102 [2021-11-06 15:18:30,592 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:18:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2021-11-06 15:18:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1102. [2021-11-06 15:18:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 1091 states have (on average 1.4005499541704858) internal successors, (1528), 1101 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:18:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1528 transitions. [2021-11-06 15:18:30,609 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1528 transitions. Word has length 60 [2021-11-06 15:18:30,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:18:30,610 INFO L470 AbstractCegarLoop]: Abstraction has 1102 states and 1528 transitions. [2021-11-06 15:18:30,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 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-06 15:18:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1528 transitions. [2021-11-06 15:18:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 15:18:30,611 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:18:30,611 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 15:18:30,634 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-06 15:18:30,827 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-06 15:18:30,827 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:18:30,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:18:30,828 INFO L85 PathProgramCache]: Analyzing trace with hash -607684, now seen corresponding path program 1 times [2021-11-06 15:18:30,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 15:18:30,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861279593] [2021-11-06 15:18:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:18:30,829 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 15:18:30,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 15:18:30,830 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-06 15:18:30,832 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-06 15:18:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:18:31,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 15:18:31,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:18:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 15:18:31,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 15:18:32,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 15:18:32,071 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 15:18:32,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861279593] [2021-11-06 15:18:32,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861279593] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 15:18:32,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:18:32,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 15:18:32,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837643607] [2021-11-06 15:18:32,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:18:32,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 15:18:32,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:18:32,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:18:32,072 INFO L87 Difference]: Start difference. First operand 1102 states and 1528 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:18:40,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:18:40,897 INFO L93 Difference]: Finished difference Result 2180 states and 3032 transitions. [2021-11-06 15:18:40,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:18:40,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-06 15:18:40,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:18:40,904 INFO L225 Difference]: With dead ends: 2180 [2021-11-06 15:18:40,905 INFO L226 Difference]: Without dead ends: 1106 [2021-11-06 15:18:40,907 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:18:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2021-11-06 15:18:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2021-11-06 15:18:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1095 states have (on average 1.3990867579908677) internal successors, (1532), 1105 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:18:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1532 transitions. [2021-11-06 15:18:40,928 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1532 transitions. Word has length 64 [2021-11-06 15:18:40,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:18:40,929 INFO L470 AbstractCegarLoop]: Abstraction has 1106 states and 1532 transitions. [2021-11-06 15:18:40,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:18:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1532 transitions. [2021-11-06 15:18:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 15:18:40,930 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:18:40,930 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 15:18:40,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-06 15:18:41,143 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-06 15:18:41,144 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:18:41,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:18:41,144 INFO L85 PathProgramCache]: Analyzing trace with hash -548102, now seen corresponding path program 1 times [2021-11-06 15:18:41,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 15:18:41,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456265133] [2021-11-06 15:18:41,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:18:41,146 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 15:18:41,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 15:18:41,147 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-06 15:18:41,148 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-06 15:18:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:18:42,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-06 15:18:42,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:18:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:18:48,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 15:18:53,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:18:53,633 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 15:18:53,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456265133] [2021-11-06 15:18:53,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456265133] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-06 15:18:53,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 15:18:53,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2021-11-06 15:18:53,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659511634] [2021-11-06 15:18:53,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 15:18:53,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 15:18:53,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 15:18:53,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-11-06 15:18:53,634 INFO L87 Difference]: Start difference. First operand 1106 states and 1532 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:20:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:20:38,652 INFO L93 Difference]: Finished difference Result 19612 states and 28029 transitions. [2021-11-06 15:20:38,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-06 15:20:38,654 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2021-11-06 15:20:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:20:38,716 INFO L225 Difference]: With dead ends: 19612 [2021-11-06 15:20:38,716 INFO L226 Difference]: Without dead ends: 19596 [2021-11-06 15:20:38,726 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=875, Invalid=2785, Unknown=0, NotChecked=0, Total=3660 [2021-11-06 15:20:38,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19596 states. [2021-11-06 15:20:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19596 to 2136. [2021-11-06 15:20:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 2125 states have (on average 1.4028235294117648) internal successors, (2981), 2135 states have internal predecessors, (2981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:20:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 2981 transitions. [2021-11-06 15:20:38,988 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 2981 transitions. Word has length 64 [2021-11-06 15:20:38,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:20:38,989 INFO L470 AbstractCegarLoop]: Abstraction has 2136 states and 2981 transitions. [2021-11-06 15:20:38,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:20:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2981 transitions. [2021-11-06 15:20:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-06 15:20:38,992 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:20:38,992 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:20:39,055 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-06 15:20:39,217 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-06 15:20:39,217 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:20:39,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:20:39,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1346059703, now seen corresponding path program 1 times [2021-11-06 15:20:39,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 15:20:39,219 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838362060] [2021-11-06 15:20:39,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:20:39,220 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 15:20:39,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 15:20:39,224 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-06 15:20:39,227 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-06 15:20:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:20:40,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-06 15:20:40,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:20:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-06 15:20:51,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 15:20:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-06 15:20:57,395 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 15:20:57,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838362060] [2021-11-06 15:20:57,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838362060] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 15:20:57,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 15:20:57,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-11-06 15:20:57,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500325669] [2021-11-06 15:20:57,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-06 15:20:57,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 15:20:57,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-06 15:20:57,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-11-06 15:20:57,397 INFO L87 Difference]: Start difference. First operand 2136 states and 2981 transitions. Second operand has 18 states, 18 states have (on average 7.611111111111111) internal successors, (137), 18 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:23:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:23:14,407 INFO L93 Difference]: Finished difference Result 36691 states and 52488 transitions. [2021-11-06 15:23:14,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-06 15:23:14,409 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.611111111111111) internal successors, (137), 18 states have internal predecessors, (137), 0 states have call successors, (0), 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-06 15:23:14,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:23:14,497 INFO L225 Difference]: With dead ends: 36691 [2021-11-06 15:23:14,497 INFO L226 Difference]: Without dead ends: 36675 [2021-11-06 15:23:14,511 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=875, Invalid=2785, Unknown=0, NotChecked=0, Total=3660 [2021-11-06 15:23:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36675 states. [2021-11-06 15:23:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36675 to 3119. [2021-11-06 15:23:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3119 states, 3108 states have (on average 1.4047619047619047) internal successors, (4366), 3118 states have internal predecessors, (4366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:23:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 4366 transitions. [2021-11-06 15:23:14,927 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 4366 transitions. Word has length 86 [2021-11-06 15:23:14,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:23:14,928 INFO L470 AbstractCegarLoop]: Abstraction has 3119 states and 4366 transitions. [2021-11-06 15:23:14,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.611111111111111) internal successors, (137), 18 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:23:14,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 4366 transitions. [2021-11-06 15:23:14,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-06 15:23:14,931 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:23:14,932 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:23:14,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-06 15:23:15,139 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-06 15:23:15,139 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:23:15,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:23:15,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1124767586, now seen corresponding path program 1 times [2021-11-06 15:23:15,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 15:23:15,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777845249] [2021-11-06 15:23:15,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:23:15,141 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 15:23:15,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 15:23:15,142 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-06 15:23:15,146 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-06 15:23:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:23:16,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-06 15:23:16,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:23:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-06 15:23:18,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 15:23:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-06 15:23:20,462 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 15:23:20,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777845249] [2021-11-06 15:23:20,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777845249] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 15:23:20,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 15:23:20,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2021-11-06 15:23:20,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758266219] [2021-11-06 15:23:20,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 15:23:20,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 15:23:20,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 15:23:20,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 15:23:20,464 INFO L87 Difference]: Start difference. First operand 3119 states and 4366 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:26:09,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:26:09,448 INFO L93 Difference]: Finished difference Result 26792 states and 37800 transitions. [2021-11-06 15:26:09,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-06 15:26:09,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 89 [2021-11-06 15:26:09,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:26:09,494 INFO L225 Difference]: With dead ends: 26792 [2021-11-06 15:26:09,495 INFO L226 Difference]: Without dead ends: 26776 [2021-11-06 15:26:09,502 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2021-11-06 15:26:09,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26776 states. [2021-11-06 15:26:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26776 to 4127. [2021-11-06 15:26:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4127 states, 4116 states have (on average 1.4047619047619047) internal successors, (5782), 4126 states have internal predecessors, (5782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:26:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4127 states to 4127 states and 5782 transitions. [2021-11-06 15:26:09,869 INFO L78 Accepts]: Start accepts. Automaton has 4127 states and 5782 transitions. Word has length 89 [2021-11-06 15:26:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:26:09,869 INFO L470 AbstractCegarLoop]: Abstraction has 4127 states and 5782 transitions. [2021-11-06 15:26:09,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:26:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4127 states and 5782 transitions. [2021-11-06 15:26:09,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-06 15:26:09,875 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:26:09,876 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:26:09,907 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-06 15:26:10,091 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-06 15:26:10,092 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:26:10,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:26:10,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1534045030, now seen corresponding path program 1 times [2021-11-06 15:26:10,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 15:26:10,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142389396] [2021-11-06 15:26:10,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:26:10,094 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 15:26:10,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 15:26:10,095 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-06 15:26:10,095 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-06 15:26:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:26:11,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 15:26:11,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:26:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 15:26:12,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 15:26:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 15:26:12,802 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 15:26:12,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142389396] [2021-11-06 15:26:12,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142389396] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 15:26:12,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:26:12,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 15:26:12,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000851803] [2021-11-06 15:26:12,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 15:26:12,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 15:26:12,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 15:26:12,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:26:12,803 INFO L87 Difference]: Start difference. First operand 4127 states and 5782 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:26:18,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:26:18,842 INFO L93 Difference]: Finished difference Result 8930 states and 12660 transitions. [2021-11-06 15:26:18,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 15:26:18,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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-06 15:26:18,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:26:18,849 INFO L225 Difference]: With dead ends: 8930 [2021-11-06 15:26:18,849 INFO L226 Difference]: Without dead ends: 4831 [2021-11-06 15:26:18,853 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:26:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4831 states. [2021-11-06 15:26:19,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4831 to 4831. [2021-11-06 15:26:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4831 states, 4820 states have (on average 1.4012448132780082) internal successors, (6754), 4830 states have internal predecessors, (6754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:26:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4831 states to 4831 states and 6754 transitions. [2021-11-06 15:26:19,137 INFO L78 Accepts]: Start accepts. Automaton has 4831 states and 6754 transitions. Word has length 92 [2021-11-06 15:26:19,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:26:19,137 INFO L470 AbstractCegarLoop]: Abstraction has 4831 states and 6754 transitions. [2021-11-06 15:26:19,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:26:19,137 INFO L276 IsEmpty]: Start isEmpty. Operand 4831 states and 6754 transitions. [2021-11-06 15:26:19,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-06 15:26:19,141 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:26:19,141 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2021-11-06 15:26:19,168 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-06 15:26:19,355 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-06 15:26:19,356 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:26:19,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:26:19,356 INFO L85 PathProgramCache]: Analyzing trace with hash 914092133, now seen corresponding path program 1 times [2021-11-06 15:26:19,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 15:26:19,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668248317] [2021-11-06 15:26:19,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:26:19,357 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 15:26:19,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 15:26:19,358 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-06 15:26:19,359 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-06 15:26:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:26:20,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 15:26:20,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:26:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-06 15:26:21,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 15:26:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-06 15:26:22,014 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 15:26:22,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668248317] [2021-11-06 15:26:22,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668248317] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 15:26:22,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:26:22,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 15:26:22,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777319058] [2021-11-06 15:26:22,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 15:26:22,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 15:26:22,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 15:26:22,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 15:26:22,016 INFO L87 Difference]: Start difference. First operand 4831 states and 6754 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:26:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:26:25,188 INFO L93 Difference]: Finished difference Result 13688 states and 18886 transitions. [2021-11-06 15:26:25,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 15:26:25,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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 107 [2021-11-06 15:26:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:26:25,201 INFO L225 Difference]: With dead ends: 13688 [2021-11-06 15:26:25,202 INFO L226 Difference]: Without dead ends: 8885 [2021-11-06 15:26:25,206 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-06 15:26:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8885 states. [2021-11-06 15:26:25,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8885 to 4839. [2021-11-06 15:26:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4839 states, 4828 states have (on average 1.4005799502899752) internal successors, (6762), 4838 states have internal predecessors, (6762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:26:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 6762 transitions. [2021-11-06 15:26:25,516 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 6762 transitions. Word has length 107 [2021-11-06 15:26:25,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:26:25,516 INFO L470 AbstractCegarLoop]: Abstraction has 4839 states and 6762 transitions. [2021-11-06 15:26:25,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:26:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 6762 transitions. [2021-11-06 15:26:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-06 15:26:25,520 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:26:25,520 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:26:25,548 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-06 15:26:25,739 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-06 15:26:25,740 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:26:25,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:26:25,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1068449267, now seen corresponding path program 1 times [2021-11-06 15:26:25,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 15:26:25,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547467122] [2021-11-06 15:26:25,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:26:25,742 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 15:26:25,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 15:26:25,743 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-06 15:26:25,744 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-06 15:26:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:26:27,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-06 15:26:27,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:26:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-11-06 15:26:38,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 15:26:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-11-06 15:26:44,639 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 15:26:44,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547467122] [2021-11-06 15:26:44,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547467122] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 15:26:44,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 15:26:44,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-11-06 15:26:44,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954830079] [2021-11-06 15:26:44,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-06 15:26:44,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 15:26:44,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-06 15:26:44,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-11-06 15:26:44,641 INFO L87 Difference]: Start difference. First operand 4839 states and 6762 transitions. Second operand has 18 states, 18 states have (on average 8.61111111111111) internal successors, (155), 18 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:28:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:28:56,187 INFO L93 Difference]: Finished difference Result 53471 states and 75989 transitions. [2021-11-06 15:28:56,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-06 15:28:56,189 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.61111111111111) internal successors, (155), 18 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-06 15:28:56,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:28:56,283 INFO L225 Difference]: With dead ends: 53471 [2021-11-06 15:28:56,283 INFO L226 Difference]: Without dead ends: 53455 [2021-11-06 15:28:56,300 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=875, Invalid=2785, Unknown=0, NotChecked=0, Total=3660 [2021-11-06 15:28:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53455 states. [2021-11-06 15:28:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53455 to 9576. [2021-11-06 15:28:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9576 states, 9565 states have (on average 1.4018818609513852) internal successors, (13409), 9575 states have internal predecessors, (13409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:28:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9576 states to 9576 states and 13409 transitions. [2021-11-06 15:28:57,261 INFO L78 Accepts]: Start accepts. Automaton has 9576 states and 13409 transitions. Word has length 107 [2021-11-06 15:28:57,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:28:57,261 INFO L470 AbstractCegarLoop]: Abstraction has 9576 states and 13409 transitions. [2021-11-06 15:28:57,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.61111111111111) internal successors, (155), 18 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:28:57,262 INFO L276 IsEmpty]: Start isEmpty. Operand 9576 states and 13409 transitions. [2021-11-06 15:28:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-06 15:28:57,267 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:28:57,267 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2021-11-06 15:28:57,293 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-06 15:28:57,485 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-06 15:28:57,486 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:28:57,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:28:57,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1761422566, now seen corresponding path program 1 times [2021-11-06 15:28:57,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 15:28:57,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750988365] [2021-11-06 15:28:57,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:28:57,488 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 15:28:57,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 15:28:57,489 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-06 15:28:57,489 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-06 15:28:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:28:58,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 1202 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-06 15:28:58,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:29:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-06 15:29:00,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 15:29:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-06 15:29:01,980 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 15:29:01,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750988365] [2021-11-06 15:29:01,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750988365] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 15:29:01,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:29:01,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-11-06 15:29:01,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167311465] [2021-11-06 15:29:01,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 15:29:01,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 15:29:01,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 15:29:01,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-06 15:29:01,981 INFO L87 Difference]: Start difference. First operand 9576 states and 13409 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:29:25,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:29:25,980 INFO L93 Difference]: Finished difference Result 65316 states and 89637 transitions. [2021-11-06 15:29:25,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 15:29:25,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2021-11-06 15:29:25,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:29:26,083 INFO L225 Difference]: With dead ends: 65316 [2021-11-06 15:29:26,084 INFO L226 Difference]: Without dead ends: 55768 [2021-11-06 15:29:26,107 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2021-11-06 15:29:26,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55768 states. [2021-11-06 15:29:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55768 to 9608. [2021-11-06 15:29:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9608 states, 9597 states have (on average 1.4005418359904136) internal successors, (13441), 9607 states have internal predecessors, (13441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:29:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13441 transitions. [2021-11-06 15:29:27,194 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13441 transitions. Word has length 112 [2021-11-06 15:29:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:29:27,195 INFO L470 AbstractCegarLoop]: Abstraction has 9608 states and 13441 transitions. [2021-11-06 15:29:27,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:29:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13441 transitions. [2021-11-06 15:29:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-06 15:29:27,200 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:29:27,201 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2021-11-06 15:29:27,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-06 15:29:27,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 15:29:27,419 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 15:29:27,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:29:27,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1444370698, now seen corresponding path program 1 times [2021-11-06 15:29:27,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 15:29:27,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141253140] [2021-11-06 15:29:27,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:29:27,421 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 15:29:27,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 15:29:27,422 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 15:29:27,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-06 15:29:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:29:28,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 15:29:28,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 15:29:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-06 15:29:29,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 15:29:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-06 15:29:29,500 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 15:29:29,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141253140] [2021-11-06 15:29:29,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141253140] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 15:29:29,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:29:29,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 15:29:29,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990747678] [2021-11-06 15:29:29,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 15:29:29,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 15:29:29,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 15:29:29,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:29:29,501 INFO L87 Difference]: Start difference. First operand 9608 states and 13441 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 15:29:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:29:36,597 INFO L93 Difference]: Finished difference Result 19188 states and 26850 transitions. [2021-11-06 15:29:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 15:29:36,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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 114 [2021-11-06 15:29:36,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:29:36,613 INFO L225 Difference]: With dead ends: 19188 [2021-11-06 15:29:36,613 INFO L226 Difference]: Without dead ends: 9608 [2021-11-06 15:29:36,626 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:29:36,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9608 states. Killed by 15