./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-4ed3cba-1-100_1a-drivers--usb--serial--qcserial.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-4ed3cba-1-100_1a-drivers--usb--serial--qcserial.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 46b0ad08a581b5bde0454ec418cbe0193c7ec6a3f6e007f87f30934488ee8554 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:34:19,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:34:20,018 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-11-29 05:34:20,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:34:20,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:34:20,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:34:20,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:34:20,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:34:20,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:34:20,053 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:34:20,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:34:20,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:34:20,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:34:20,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:34:20,055 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:34:20,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:34:20,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:34:20,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:34:20,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:34:20,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:34:20,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:34:20,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:34:20,061 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-29 05:34:20,061 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:34:20,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:34:20,062 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:34:20,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:34:20,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:34:20,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:34:20,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:34:20,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:34:20,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:34:20,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:34:20,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:34:20,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:34:20,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:34:20,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:34:20,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:34:20,077 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:34:20,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:34:20,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:34:20,078 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 ! overflow) ) 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 -> 46b0ad08a581b5bde0454ec418cbe0193c7ec6a3f6e007f87f30934488ee8554 [2023-11-29 05:34:20,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:34:20,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:34:20,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:34:20,329 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:34:20,330 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:34:20,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-4ed3cba-1-100_1a-drivers--usb--serial--qcserial.ko-entry_point.cil.out.i [2023-11-29 05:34:23,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:34:23,440 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:34:23,440 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-4ed3cba-1-100_1a-drivers--usb--serial--qcserial.ko-entry_point.cil.out.i [2023-11-29 05:34:23,468 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/data/2f0ba76a3/c82b485a0e564761834738c32a213327/FLAG2fc9bb490 [2023-11-29 05:34:23,482 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/data/2f0ba76a3/c82b485a0e564761834738c32a213327 [2023-11-29 05:34:23,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:34:23,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:34:23,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:34:23,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:34:23,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:34:23,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:34:23" (1/1) ... [2023-11-29 05:34:23,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58b88ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:34:23, skipping insertion in model container [2023-11-29 05:34:23,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:34:23" (1/1) ... [2023-11-29 05:34:23,588 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:34:23,943 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name writepages at C: (*writepages)(struct address_space___0 * , struct writeback_control * ) [3504] [2023-11-29 05:34:23,944 WARN L1274 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 ) [3506-3507] [2023-11-29 05:34:23,944 WARN L1274 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 ) [3508-3510] [2023-11-29 05:34:23,945 WARN L1274 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 ) [3511-3512] [2023-11-29 05:34:23,945 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name bmap at C: (*bmap)(struct address_space___0 * , sector_t ) [3513] [2023-11-29 05:34:23,946 WARN L1274 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 * ) [3519-3520] [2023-11-29 05:34:23,946 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name migratepage at C: (*migratepage)(struct address_space___0 * , struct page * , struct page * ) [3521] [2023-11-29 05:34:23,946 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name error_remove_page at C: (*error_remove_page)(struct address_space___0 * , struct page * ) [3524] [2023-11-29 05:34:23,955 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name lookup at C: *(*lookup)(struct tty_driver___0 *driver , struct inode___0 *inode , int idx ) [3838-3839] [2023-11-29 05:34:23,955 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name install at C: (*install)(struct tty_driver___0 *driver , struct tty_struct___0 *tty ) [3840] [2023-11-29 05:34:23,955 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name remove at C: (*remove)(struct tty_driver___0 *driver , struct tty_struct___0 *tty ) [3841] [2023-11-29 05:34:23,956 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name poll_init at C: (*poll_init)(struct tty_driver___0 *driver , int line , char *options ) [3872] [2023-11-29 05:34:23,957 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name poll_get_char at C: (*poll_get_char)(struct tty_driver___0 *driver , int line ) [3873] [2023-11-29 05:34:23,957 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name poll_put_char at C: (*poll_put_char)(struct tty_driver___0 *driver , int line , char ch ) [3874] [2023-11-29 05:34:23,958 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name carrier_raised at C: (*carrier_raised)(struct tty_port___0 *port ) [3934] [2023-11-29 05:34:23,959 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name dtr_rts at C: (*dtr_rts)(struct tty_port___0 *port , int raise ) [3935] [2023-11-29 05:34:23,959 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name shutdown at C: (*shutdown)(struct tty_port___0 *port ) [3936] [2023-11-29 05:34:23,959 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name drop at C: (*drop)(struct tty_port___0 *port ) [3937] [2023-11-29 05:34:23,960 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name activate at C: (*activate)(struct tty_port___0 *port , struct tty_struct___0 *tty ) [3938] [2023-11-29 05:34:23,960 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name destruct at C: (*destruct)(struct tty_port___0 *port ) [3939] [2023-11-29 05:34:24,408 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:34:24,453 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:34:24,544 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name writepages at C: (*writepages)(struct address_space___0 * , struct writeback_control * ) [3504] [2023-11-29 05:34:24,544 WARN L1274 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 ) [3506-3507] [2023-11-29 05:34:24,545 WARN L1274 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 ) [3508-3510] [2023-11-29 05:34:24,545 WARN L1274 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 ) [3511-3512] [2023-11-29 05:34:24,545 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name bmap at C: (*bmap)(struct address_space___0 * , sector_t ) [3513] [2023-11-29 05:34:24,546 WARN L1274 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 * ) [3519-3520] [2023-11-29 05:34:24,546 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name migratepage at C: (*migratepage)(struct address_space___0 * , struct page * , struct page * ) [3521] [2023-11-29 05:34:24,547 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name error_remove_page at C: (*error_remove_page)(struct address_space___0 * , struct page * ) [3524] [2023-11-29 05:34:24,554 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name lookup at C: *(*lookup)(struct tty_driver___0 *driver , struct inode___0 *inode , int idx ) [3838-3839] [2023-11-29 05:34:24,554 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name install at C: (*install)(struct tty_driver___0 *driver , struct tty_struct___0 *tty ) [3840] [2023-11-29 05:34:24,554 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name remove at C: (*remove)(struct tty_driver___0 *driver , struct tty_struct___0 *tty ) [3841] [2023-11-29 05:34:24,555 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name poll_init at C: (*poll_init)(struct tty_driver___0 *driver , int line , char *options ) [3872] [2023-11-29 05:34:24,555 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name poll_get_char at C: (*poll_get_char)(struct tty_driver___0 *driver , int line ) [3873] [2023-11-29 05:34:24,556 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name poll_put_char at C: (*poll_put_char)(struct tty_driver___0 *driver , int line , char ch ) [3874] [2023-11-29 05:34:24,557 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name carrier_raised at C: (*carrier_raised)(struct tty_port___0 *port ) [3934] [2023-11-29 05:34:24,557 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name dtr_rts at C: (*dtr_rts)(struct tty_port___0 *port , int raise ) [3935] [2023-11-29 05:34:24,557 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name shutdown at C: (*shutdown)(struct tty_port___0 *port ) [3936] [2023-11-29 05:34:24,557 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name drop at C: (*drop)(struct tty_port___0 *port ) [3937] [2023-11-29 05:34:24,558 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name activate at C: (*activate)(struct tty_port___0 *port , struct tty_struct___0 *tty ) [3938] [2023-11-29 05:34:24,558 WARN L1274 CHandler]: Detected problem Invalid redeclaration of the name destruct at C: (*destruct)(struct tty_port___0 *port ) [3939] [2023-11-29 05:34:24,658 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:34:24,703 WARN L675 CHandler]: The function kmem_cache_alloc_notrace is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:34:24,712 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:34:24,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:34:24 WrapperNode [2023-11-29 05:34:24,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:34:24,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:34:24,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:34:24,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:34:24,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:34:24" (1/1) ... [2023-11-29 05:34:24,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:34:24" (1/1) ... [2023-11-29 05:34:24,838 INFO L138 Inliner]: procedures = 98, calls = 1035, calls flagged for inlining = 46, calls inlined = 44, statements flattened = 1999 [2023-11-29 05:34:24,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:34:24,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:34:24,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:34:24,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:34:24,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:34:24" (1/1) ... [2023-11-29 05:34:24,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:34:24" (1/1) ... [2023-11-29 05:34:24,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:34:24" (1/1) ... [2023-11-29 05:34:24,930 INFO L175 MemorySlicer]: Split 865 memory accesses to 14 slices as follows [2, 18, 8, 6, 5, 3, 64, 2, 1, 1, 3, 2, 3, 747]. 86 percent of accesses are in the largest equivalence class. The 821 initializations are split as follows [2, 0, 8, 0, 0, 0, 64, 0, 0, 0, 0, 0, 0, 747]. The 4 writes are split as follows [0, 2, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0]. [2023-11-29 05:34:24,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:34:24" (1/1) ... [2023-11-29 05:34:24,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:34:24" (1/1) ... [2023-11-29 05:34:24,978 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:34:24" (1/1) ... [2023-11-29 05:34:24,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:34:24" (1/1) ... [2023-11-29 05:34:25,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:34:24" (1/1) ... [2023-11-29 05:34:25,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:34:24" (1/1) ... [2023-11-29 05:34:25,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:34:25,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:34:25,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:34:25,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:34:25,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:34:24" (1/1) ... [2023-11-29 05:34:25,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:34:25,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:34:25,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:34:25,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:34:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wwan_open [2023-11-29 05:34:25,085 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wwan_open [2023-11-29 05:34:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-29 05:34:25,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-29 05:34:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:34:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:34:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 05:34:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 05:34:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 05:34:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 05:34:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-29 05:34:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-29 05:34:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-29 05:34:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-11-29 05:34:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-11-29 05:34:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-11-29 05:34:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-11-29 05:34:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-11-29 05:34:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2023-11-29 05:34:25,087 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2023-11-29 05:34:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2023-11-29 05:34:25,087 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2023-11-29 05:34:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-29 05:34:25,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-29 05:34:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-29 05:34:25,088 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-29 05:34:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wwan_disconnect [2023-11-29 05:34:25,089 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wwan_disconnect [2023-11-29 05:34:25,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-29 05:34:25,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-29 05:34:25,089 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_disconnect [2023-11-29 05:34:25,089 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_serial_disconnect [2023-11-29 05:34:25,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 05:34:25,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 05:34:25,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 05:34:25,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 05:34:25,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2023-11-29 05:34:25,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2023-11-29 05:34:25,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2023-11-29 05:34:25,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2023-11-29 05:34:25,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2023-11-29 05:34:25,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2023-11-29 05:34:25,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2023-11-29 05:34:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2023-11-29 05:34:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2023-11-29 05:34:25,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2023-11-29 05:34:25,092 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 05:34:25,092 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 05:34:25,092 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 05:34:25,093 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 05:34:25,093 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2023-11-29 05:34:25,093 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2023-11-29 05:34:25,093 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2023-11-29 05:34:25,093 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2023-11-29 05:34:25,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2023-11-29 05:34:25,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2023-11-29 05:34:25,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2023-11-29 05:34:25,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2023-11-29 05:34:25,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2023-11-29 05:34:25,094 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2023-11-29 05:34:25,095 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wwan_write_room [2023-11-29 05:34:25,095 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wwan_write_room [2023-11-29 05:34:25,095 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:34:25,095 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:34:25,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:34:25,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2023-11-29 05:34:25,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2023-11-29 05:34:25,096 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_alloc_notrace [2023-11-29 05:34:25,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:34:25,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:34:25,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:34:25,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:34:25,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 05:34:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 05:34:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-29 05:34:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-29 05:34:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-29 05:34:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-11-29 05:34:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-11-29 05:34:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-11-29 05:34:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-11-29 05:34:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-11-29 05:34:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-11-29 05:34:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:34:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:34:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:34:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:34:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 05:34:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 05:34:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-29 05:34:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-29 05:34:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-11-29 05:34:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-11-29 05:34:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-11-29 05:34:25,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-11-29 05:34:25,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-11-29 05:34:25,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-11-29 05:34:25,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-11-29 05:34:25,100 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_sched_notrace [2023-11-29 05:34:25,100 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_sched_notrace [2023-11-29 05:34:25,100 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wwan_resume [2023-11-29 05:34:25,101 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wwan_resume [2023-11-29 05:34:25,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:34:25,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 05:34:25,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 05:34:25,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 05:34:25,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 05:34:25,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-29 05:34:25,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-29 05:34:25,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-29 05:34:25,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-11-29 05:34:25,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-11-29 05:34:25,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-11-29 05:34:25,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-11-29 05:34:25,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-11-29 05:34:25,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-11-29 05:34:25,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-11-29 05:34:25,103 INFO L130 BoogieDeclarations]: Found specification of procedure trace_kmalloc [2023-11-29 05:34:25,104 INFO L138 BoogieDeclarations]: Found implementation of procedure trace_kmalloc [2023-11-29 05:34:25,104 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-29 05:34:25,104 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-29 05:34:25,104 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2023-11-29 05:34:25,104 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2023-11-29 05:34:25,105 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_deregister [2023-11-29 05:34:25,105 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_serial_deregister [2023-11-29 05:34:25,105 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wwan_write [2023-11-29 05:34:25,105 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wwan_write [2023-11-29 05:34:25,105 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wwan_suspend [2023-11-29 05:34:25,106 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wwan_suspend [2023-11-29 05:34:25,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:34:25,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:34:25,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:34:25,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:34:25,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 05:34:25,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 05:34:25,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-29 05:34:25,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-29 05:34:25,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-29 05:34:25,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-11-29 05:34:25,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-11-29 05:34:25,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-11-29 05:34:25,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-11-29 05:34:25,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-11-29 05:34:25,107 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wwan_close [2023-11-29 05:34:25,108 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wwan_close [2023-11-29 05:34:25,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2023-11-29 05:34:25,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2023-11-29 05:34:25,108 INFO L130 BoogieDeclarations]: Found specification of procedure usb_wwan_chars_in_buffer [2023-11-29 05:34:25,108 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_wwan_chars_in_buffer [2023-11-29 05:34:25,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:34:25,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:34:25,492 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:34:25,494 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:34:25,530 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-29 05:34:25,727 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2023-11-29 05:34:27,287 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:34:27,482 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:34:27,482 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:34:27,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:34:27 BoogieIcfgContainer [2023-11-29 05:34:27,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:34:27,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:34:27,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:34:27,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:34:27,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:34:23" (1/3) ... [2023-11-29 05:34:27,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae7c241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:34:27, skipping insertion in model container [2023-11-29 05:34:27,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:34:24" (2/3) ... [2023-11-29 05:34:27,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae7c241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:34:27, skipping insertion in model container [2023-11-29 05:34:27,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:34:27" (3/3) ... [2023-11-29 05:34:27,492 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-4ed3cba-1-100_1a-drivers--usb--serial--qcserial.ko-entry_point.cil.out.i [2023-11-29 05:34:27,511 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:34:27,512 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-29 05:34:27,571 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:34:27,578 INFO L357 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=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@62975ddd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:34:27,578 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-29 05:34:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 407 states, 297 states have (on average 1.5656565656565657) internal successors, (465), 317 states have internal predecessors, (465), 74 states have call successors, (74), 25 states have call predecessors, (74), 23 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2023-11-29 05:34:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 05:34:27,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:27,598 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:27,599 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:34:27,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:27,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1939907149, now seen corresponding path program 1 times [2023-11-29 05:34:27,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:27,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657594582] [2023-11-29 05:34:27,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:27,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:28,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:28,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:34:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:28,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:34:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:28,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:34:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:28,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:34:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:28,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:34:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:34:28,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:28,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657594582] [2023-11-29 05:34:28,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657594582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:28,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:28,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:34:28,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529359510] [2023-11-29 05:34:28,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:28,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:34:28,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:28,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:34:28,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:34:28,320 INFO L87 Difference]: Start difference. First operand has 407 states, 297 states have (on average 1.5656565656565657) internal successors, (465), 317 states have internal predecessors, (465), 74 states have call successors, (74), 25 states have call predecessors, (74), 23 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 05:34:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:34:29,835 INFO L93 Difference]: Finished difference Result 1041 states and 1571 transitions. [2023-11-29 05:34:29,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:34:29,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2023-11-29 05:34:29,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:34:29,854 INFO L225 Difference]: With dead ends: 1041 [2023-11-29 05:34:29,854 INFO L226 Difference]: Without dead ends: 613 [2023-11-29 05:34:29,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:34:29,863 INFO L413 NwaCegarLoop]: 559 mSDtfsCounter, 569 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 2441 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:34:29,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 2441 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 05:34:29,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2023-11-29 05:34:29,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 597. [2023-11-29 05:34:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 435 states have (on average 1.4896551724137932) internal successors, (648), 448 states have internal predecessors, (648), 116 states have call successors, (116), 36 states have call predecessors, (116), 36 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2023-11-29 05:34:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 880 transitions. [2023-11-29 05:34:29,964 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 880 transitions. Word has length 46 [2023-11-29 05:34:29,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:34:29,965 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 880 transitions. [2023-11-29 05:34:29,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 05:34:29,965 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 880 transitions. [2023-11-29 05:34:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:34:29,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:29,969 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:29,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:34:29,969 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:34:29,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:29,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1740758010, now seen corresponding path program 1 times [2023-11-29 05:34:29,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:29,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069062686] [2023-11-29 05:34:29,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:29,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:30,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:30,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:34:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:30,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:34:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:30,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:34:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:30,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:34:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:30,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:34:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:34:30,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:30,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069062686] [2023-11-29 05:34:30,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069062686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:30,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:30,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:34:30,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841054078] [2023-11-29 05:34:30,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:30,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:34:30,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:30,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:34:30,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:34:30,306 INFO L87 Difference]: Start difference. First operand 597 states and 880 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 05:34:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:34:31,318 INFO L93 Difference]: Finished difference Result 1297 states and 1906 transitions. [2023-11-29 05:34:31,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:34:31,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 50 [2023-11-29 05:34:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:34:31,326 INFO L225 Difference]: With dead ends: 1297 [2023-11-29 05:34:31,326 INFO L226 Difference]: Without dead ends: 721 [2023-11-29 05:34:31,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:34:31,330 INFO L413 NwaCegarLoop]: 426 mSDtfsCounter, 316 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:34:31,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1594 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:34:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2023-11-29 05:34:31,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 697. [2023-11-29 05:34:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 521 states have (on average 1.493282149712092) internal successors, (778), 534 states have internal predecessors, (778), 123 states have call successors, (123), 43 states have call predecessors, (123), 43 states have return successors, (123), 123 states have call predecessors, (123), 123 states have call successors, (123) [2023-11-29 05:34:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1024 transitions. [2023-11-29 05:34:31,383 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1024 transitions. Word has length 50 [2023-11-29 05:34:31,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:34:31,383 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 1024 transitions. [2023-11-29 05:34:31,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 05:34:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1024 transitions. [2023-11-29 05:34:31,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 05:34:31,387 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:31,387 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-29 05:34:31,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:34:31,387 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:34:31,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:31,388 INFO L85 PathProgramCache]: Analyzing trace with hash -809295031, now seen corresponding path program 1 times [2023-11-29 05:34:31,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:31,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849003821] [2023-11-29 05:34:31,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:31,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:31,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:31,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:34:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:31,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:34:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:31,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:34:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:31,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:34:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:31,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:34:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:31,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:34:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:34:31,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:31,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849003821] [2023-11-29 05:34:31,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849003821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:31,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:31,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:34:31,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731179335] [2023-11-29 05:34:31,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:31,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:34:31,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:31,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:34:31,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:34:31,900 INFO L87 Difference]: Start difference. First operand 697 states and 1024 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 05:34:33,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:34:33,112 INFO L93 Difference]: Finished difference Result 1907 states and 2901 transitions. [2023-11-29 05:34:33,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:34:33,112 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2023-11-29 05:34:33,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:34:33,122 INFO L225 Difference]: With dead ends: 1907 [2023-11-29 05:34:33,122 INFO L226 Difference]: Without dead ends: 1247 [2023-11-29 05:34:33,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:34:33,125 INFO L413 NwaCegarLoop]: 706 mSDtfsCounter, 922 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:34:33,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 2725 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 05:34:33,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2023-11-29 05:34:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 685. [2023-11-29 05:34:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 511 states have (on average 1.4931506849315068) internal successors, (763), 525 states have internal predecessors, (763), 122 states have call successors, (122), 42 states have call predecessors, (122), 42 states have return successors, (122), 121 states have call predecessors, (122), 122 states have call successors, (122) [2023-11-29 05:34:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1007 transitions. [2023-11-29 05:34:33,178 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1007 transitions. Word has length 64 [2023-11-29 05:34:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:34:33,179 INFO L495 AbstractCegarLoop]: Abstraction has 685 states and 1007 transitions. [2023-11-29 05:34:33,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 05:34:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1007 transitions. [2023-11-29 05:34:33,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 05:34:33,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:33,183 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2023-11-29 05:34:33,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:34:33,183 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:34:33,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:33,183 INFO L85 PathProgramCache]: Analyzing trace with hash -841550593, now seen corresponding path program 1 times [2023-11-29 05:34:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:33,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495138417] [2023-11-29 05:34:33,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:33,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:33,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:33,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:34:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:33,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:34:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:33,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:34:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:33,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:34:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:33,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:34:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:33,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:34:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:33,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 05:34:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:33,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 05:34:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 05:34:33,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:33,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495138417] [2023-11-29 05:34:33,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495138417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:33,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:33,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:34:33,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417301902] [2023-11-29 05:34:33,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:33,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:34:33,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:33,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:34:33,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:34:33,547 INFO L87 Difference]: Start difference. First operand 685 states and 1007 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 05:34:34,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:34:34,500 INFO L93 Difference]: Finished difference Result 1535 states and 2294 transitions. [2023-11-29 05:34:34,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:34:34,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2023-11-29 05:34:34,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:34:34,506 INFO L225 Difference]: With dead ends: 1535 [2023-11-29 05:34:34,507 INFO L226 Difference]: Without dead ends: 887 [2023-11-29 05:34:34,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:34:34,510 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 395 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:34:34,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1768 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:34:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2023-11-29 05:34:34,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 836. [2023-11-29 05:34:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 655 states have (on average 1.4732824427480915) internal successors, (965), 669 states have internal predecessors, (965), 124 states have call successors, (124), 47 states have call predecessors, (124), 47 states have return successors, (124), 123 states have call predecessors, (124), 124 states have call successors, (124) [2023-11-29 05:34:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1213 transitions. [2023-11-29 05:34:34,564 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1213 transitions. Word has length 79 [2023-11-29 05:34:34,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:34:34,564 INFO L495 AbstractCegarLoop]: Abstraction has 836 states and 1213 transitions. [2023-11-29 05:34:34,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 05:34:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1213 transitions. [2023-11-29 05:34:34,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 05:34:34,567 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:34,567 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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] [2023-11-29 05:34:34,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:34:34,567 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:34:34,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:34,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1833766509, now seen corresponding path program 1 times [2023-11-29 05:34:34,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:34,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006455393] [2023-11-29 05:34:34,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:34,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:34,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:34,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:34:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:34,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:34:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:34,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:34:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:34,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:34:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:34,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:34:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:34,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:34:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:34,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:34:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:34,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:34:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:34,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:34:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-11-29 05:34:34,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:34,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006455393] [2023-11-29 05:34:34,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006455393] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:34,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:34,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:34:34,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617667599] [2023-11-29 05:34:34,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:34,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:34:34,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:34,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:34:34,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:34:34,960 INFO L87 Difference]: Start difference. First operand 836 states and 1213 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 05:34:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:34:35,987 INFO L93 Difference]: Finished difference Result 1327 states and 1890 transitions. [2023-11-29 05:34:35,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:34:35,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2023-11-29 05:34:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:34:35,996 INFO L225 Difference]: With dead ends: 1327 [2023-11-29 05:34:35,996 INFO L226 Difference]: Without dead ends: 1319 [2023-11-29 05:34:35,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:34:35,998 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 459 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:34:35,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 1927 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:34:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2023-11-29 05:34:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1291. [2023-11-29 05:34:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1022 states have (on average 1.4305283757338552) internal successors, (1462), 1041 states have internal predecessors, (1462), 188 states have call successors, (188), 71 states have call predecessors, (188), 71 states have return successors, (188), 186 states have call predecessors, (188), 188 states have call successors, (188) [2023-11-29 05:34:36,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1838 transitions. [2023-11-29 05:34:36,077 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1838 transitions. Word has length 82 [2023-11-29 05:34:36,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:34:36,078 INFO L495 AbstractCegarLoop]: Abstraction has 1291 states and 1838 transitions. [2023-11-29 05:34:36,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 05:34:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1838 transitions. [2023-11-29 05:34:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-29 05:34:36,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:36,098 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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] [2023-11-29 05:34:36,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:34:36,098 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:34:36,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:36,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2090898541, now seen corresponding path program 1 times [2023-11-29 05:34:36,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:36,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380449290] [2023-11-29 05:34:36,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:36,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:36,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:34:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:36,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:34:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:36,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:34:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:36,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:34:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:36,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:34:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:36,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:34:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:36,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:34:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:36,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:34:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:36,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:34:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:36,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 05:34:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:36,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 05:34:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-11-29 05:34:36,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:36,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380449290] [2023-11-29 05:34:36,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380449290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:36,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:36,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:34:36,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47673742] [2023-11-29 05:34:36,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:36,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:34:36,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:36,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:34:36,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:34:36,446 INFO L87 Difference]: Start difference. First operand 1291 states and 1838 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 05:34:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:34:37,702 INFO L93 Difference]: Finished difference Result 2922 states and 4198 transitions. [2023-11-29 05:34:37,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:34:37,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 93 [2023-11-29 05:34:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:34:37,714 INFO L225 Difference]: With dead ends: 2922 [2023-11-29 05:34:37,714 INFO L226 Difference]: Without dead ends: 1695 [2023-11-29 05:34:37,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:34:37,718 INFO L413 NwaCegarLoop]: 771 mSDtfsCounter, 500 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 2728 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:34:37,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 2728 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 05:34:37,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2023-11-29 05:34:37,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1659. [2023-11-29 05:34:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1322 states have (on average 1.426626323751891) internal successors, (1886), 1343 states have internal predecessors, (1886), 239 states have call successors, (239), 88 states have call predecessors, (239), 88 states have return successors, (239), 237 states have call predecessors, (239), 239 states have call successors, (239) [2023-11-29 05:34:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2364 transitions. [2023-11-29 05:34:37,840 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2364 transitions. Word has length 93 [2023-11-29 05:34:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:34:37,840 INFO L495 AbstractCegarLoop]: Abstraction has 1659 states and 2364 transitions. [2023-11-29 05:34:37,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 05:34:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2364 transitions. [2023-11-29 05:34:37,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-29 05:34:37,842 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:37,843 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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] [2023-11-29 05:34:37,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:34:37,843 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:34:37,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:37,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1355291953, now seen corresponding path program 1 times [2023-11-29 05:34:37,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:37,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592370419] [2023-11-29 05:34:37,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:37,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:38,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:38,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:34:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:34:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:38,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:34:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:38,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:34:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:38,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:34:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:38,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:34:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:38,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:34:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:38,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:34:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:38,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:34:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-11-29 05:34:38,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:38,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592370419] [2023-11-29 05:34:38,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592370419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:38,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:38,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:34:38,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11646910] [2023-11-29 05:34:38,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:38,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:34:38,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:38,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:34:38,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:34:38,189 INFO L87 Difference]: Start difference. First operand 1659 states and 2364 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-29 05:34:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:34:39,504 INFO L93 Difference]: Finished difference Result 3266 states and 4711 transitions. [2023-11-29 05:34:39,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:34:39,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 92 [2023-11-29 05:34:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:34:39,514 INFO L225 Difference]: With dead ends: 3266 [2023-11-29 05:34:39,515 INFO L226 Difference]: Without dead ends: 2086 [2023-11-29 05:34:39,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:34:39,518 INFO L413 NwaCegarLoop]: 787 mSDtfsCounter, 469 mSDsluCounter, 2562 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 3349 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:34:39,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 3349 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 05:34:39,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2023-11-29 05:34:39,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2046. [2023-11-29 05:34:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2046 states, 1635 states have (on average 1.4287461773700305) internal successors, (2336), 1658 states have internal predecessors, (2336), 292 states have call successors, (292), 109 states have call predecessors, (292), 109 states have return successors, (292), 290 states have call predecessors, (292), 292 states have call successors, (292) [2023-11-29 05:34:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2920 transitions. [2023-11-29 05:34:39,593 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 2920 transitions. Word has length 92 [2023-11-29 05:34:39,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:34:39,593 INFO L495 AbstractCegarLoop]: Abstraction has 2046 states and 2920 transitions. [2023-11-29 05:34:39,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-29 05:34:39,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2920 transitions. [2023-11-29 05:34:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-29 05:34:39,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:39,595 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:39,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:34:39,595 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:34:39,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:39,596 INFO L85 PathProgramCache]: Analyzing trace with hash 596383502, now seen corresponding path program 1 times [2023-11-29 05:34:39,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:39,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41887402] [2023-11-29 05:34:39,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:39,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:39,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:39,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:34:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:39,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:34:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:39,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:34:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:39,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:34:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:39,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:34:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:39,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:34:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:39,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:34:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:39,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:34:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:39,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:34:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:39,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:34:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-11-29 05:34:39,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:39,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41887402] [2023-11-29 05:34:39,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41887402] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:34:39,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392015592] [2023-11-29 05:34:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:39,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:34:39,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:34:39,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:34:39,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:34:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:40,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 2496 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:34:40,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:34:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-29 05:34:40,625 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:34:40,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392015592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:40,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:34:40,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-29 05:34:40,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570775122] [2023-11-29 05:34:40,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:40,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:34:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:40,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:34:40,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:34:40,627 INFO L87 Difference]: Start difference. First operand 2046 states and 2920 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 05:34:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:34:41,221 INFO L93 Difference]: Finished difference Result 4645 states and 6657 transitions. [2023-11-29 05:34:41,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:34:41,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2023-11-29 05:34:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:34:41,248 INFO L225 Difference]: With dead ends: 4645 [2023-11-29 05:34:41,248 INFO L226 Difference]: Without dead ends: 4640 [2023-11-29 05:34:41,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:34:41,251 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 963 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:34:41,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 1402 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:34:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2023-11-29 05:34:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 4173. [2023-11-29 05:34:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4173 states, 3345 states have (on average 1.4325859491778774) internal successors, (4792), 3381 states have internal predecessors, (4792), 598 states have call successors, (598), 220 states have call predecessors, (598), 220 states have return successors, (598), 595 states have call predecessors, (598), 598 states have call successors, (598) [2023-11-29 05:34:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 4173 states and 5988 transitions. [2023-11-29 05:34:41,496 INFO L78 Accepts]: Start accepts. Automaton has 4173 states and 5988 transitions. Word has length 97 [2023-11-29 05:34:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:34:41,496 INFO L495 AbstractCegarLoop]: Abstraction has 4173 states and 5988 transitions. [2023-11-29 05:34:41,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 05:34:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 5988 transitions. [2023-11-29 05:34:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-29 05:34:41,499 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:41,499 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:41,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:34:41,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:34:41,700 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:34:41,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:41,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1308020615, now seen corresponding path program 1 times [2023-11-29 05:34:41,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:41,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249832430] [2023-11-29 05:34:41,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:41,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:42,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:42,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:34:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:42,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:34:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:42,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:34:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:42,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:34:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:42,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:34:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:42,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:34:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:42,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:34:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:42,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:34:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:42,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:34:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:42,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:34:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-11-29 05:34:42,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:42,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249832430] [2023-11-29 05:34:42,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249832430] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:34:42,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420222073] [2023-11-29 05:34:42,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:42,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:34:42,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:34:42,106 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:34:42,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:34:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:42,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 2497 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:34:42,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:34:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-29 05:34:42,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:34:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-11-29 05:34:42,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420222073] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:34:42,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:34:42,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 10 [2023-11-29 05:34:42,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398210479] [2023-11-29 05:34:42,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:34:42,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:34:42,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:42,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:34:42,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:34:42,956 INFO L87 Difference]: Start difference. First operand 4173 states and 5988 transitions. Second operand has 11 states, 10 states have (on average 12.6) internal successors, (126), 7 states have internal predecessors, (126), 6 states have call successors, (27), 7 states have call predecessors, (27), 3 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2023-11-29 05:34:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:34:44,932 INFO L93 Difference]: Finished difference Result 5861 states and 8367 transitions. [2023-11-29 05:34:44,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:34:44,933 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.6) internal successors, (126), 7 states have internal predecessors, (126), 6 states have call successors, (27), 7 states have call predecessors, (27), 3 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) Word has length 98 [2023-11-29 05:34:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:34:44,968 INFO L225 Difference]: With dead ends: 5861 [2023-11-29 05:34:44,968 INFO L226 Difference]: Without dead ends: 5856 [2023-11-29 05:34:44,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2023-11-29 05:34:44,971 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 2094 mSDsluCounter, 2139 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 724 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2269 SdHoareTripleChecker+Valid, 2544 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 724 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:34:44,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2269 Valid, 2544 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [724 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 05:34:44,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5856 states. [2023-11-29 05:34:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5856 to 5353. [2023-11-29 05:34:45,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5353 states, 4297 states have (on average 1.419362345822667) internal successors, (6099), 4339 states have internal predecessors, (6099), 768 states have call successors, (768), 281 states have call predecessors, (768), 281 states have return successors, (768), 764 states have call predecessors, (768), 768 states have call successors, (768) [2023-11-29 05:34:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5353 states to 5353 states and 7635 transitions. [2023-11-29 05:34:45,289 INFO L78 Accepts]: Start accepts. Automaton has 5353 states and 7635 transitions. Word has length 98 [2023-11-29 05:34:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:34:45,289 INFO L495 AbstractCegarLoop]: Abstraction has 5353 states and 7635 transitions. [2023-11-29 05:34:45,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.6) internal successors, (126), 7 states have internal predecessors, (126), 6 states have call successors, (27), 7 states have call predecessors, (27), 3 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2023-11-29 05:34:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 5353 states and 7635 transitions. [2023-11-29 05:34:45,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-29 05:34:45,296 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:45,296 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 5, 5, 3, 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] [2023-11-29 05:34:45,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-29 05:34:45,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:34:45,497 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:34:45,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:45,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1988187470, now seen corresponding path program 1 times [2023-11-29 05:34:45,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:45,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851066594] [2023-11-29 05:34:45,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:45,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:45,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:45,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:34:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:45,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:34:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:45,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:34:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:45,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:34:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:45,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:34:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:45,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:34:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:45,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:34:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:45,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:34:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:45,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:34:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-11-29 05:34:45,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:45,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851066594] [2023-11-29 05:34:45,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851066594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:45,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:45,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:34:45,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453899173] [2023-11-29 05:34:45,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:45,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:34:45,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:45,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:34:45,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:34:45,863 INFO L87 Difference]: Start difference. First operand 5353 states and 7635 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-29 05:34:47,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:34:47,251 INFO L93 Difference]: Finished difference Result 10037 states and 14317 transitions. [2023-11-29 05:34:47,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:34:47,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 123 [2023-11-29 05:34:47,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:34:47,276 INFO L225 Difference]: With dead ends: 10037 [2023-11-29 05:34:47,276 INFO L226 Difference]: Without dead ends: 5090 [2023-11-29 05:34:47,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:34:47,287 INFO L413 NwaCegarLoop]: 784 mSDtfsCounter, 464 mSDsluCounter, 2550 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 3334 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:34:47,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 3334 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 05:34:47,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5090 states. [2023-11-29 05:34:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5090 to 5011. [2023-11-29 05:34:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5011 states, 4026 states have (on average 1.4063586686537506) internal successors, (5662), 4066 states have internal predecessors, (5662), 715 states have call successors, (715), 263 states have call predecessors, (715), 263 states have return successors, (715), 711 states have call predecessors, (715), 715 states have call successors, (715) [2023-11-29 05:34:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5011 states to 5011 states and 7092 transitions. [2023-11-29 05:34:47,582 INFO L78 Accepts]: Start accepts. Automaton has 5011 states and 7092 transitions. Word has length 123 [2023-11-29 05:34:47,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:34:47,583 INFO L495 AbstractCegarLoop]: Abstraction has 5011 states and 7092 transitions. [2023-11-29 05:34:47,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-29 05:34:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5011 states and 7092 transitions. [2023-11-29 05:34:47,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-29 05:34:47,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:47,591 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:47,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:34:47,591 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:34:47,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash -396288762, now seen corresponding path program 1 times [2023-11-29 05:34:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:47,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088820843] [2023-11-29 05:34:47,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:47,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:34:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:34:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:34:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:34:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:34:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:34:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:34:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:34:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:34:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:34:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 05:34:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 05:34:47,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:47,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088820843] [2023-11-29 05:34:47,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088820843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:47,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:47,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:34:47,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372265725] [2023-11-29 05:34:47,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:47,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:34:47,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:47,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:34:47,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:34:47,941 INFO L87 Difference]: Start difference. First operand 5011 states and 7092 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 05:34:49,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:34:49,259 INFO L93 Difference]: Finished difference Result 13292 states and 18668 transitions. [2023-11-29 05:34:49,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:34:49,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 136 [2023-11-29 05:34:49,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:34:49,294 INFO L225 Difference]: With dead ends: 13292 [2023-11-29 05:34:49,294 INFO L226 Difference]: Without dead ends: 8345 [2023-11-29 05:34:49,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:34:49,303 INFO L413 NwaCegarLoop]: 691 mSDtfsCounter, 555 mSDsluCounter, 2361 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 3052 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:34:49,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 3052 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:34:49,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8345 states. [2023-11-29 05:34:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8345 to 5041. [2023-11-29 05:34:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5041 states, 4056 states have (on average 1.403353057199211) internal successors, (5692), 4096 states have internal predecessors, (5692), 715 states have call successors, (715), 263 states have call predecessors, (715), 263 states have return successors, (715), 711 states have call predecessors, (715), 715 states have call successors, (715) [2023-11-29 05:34:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5041 states to 5041 states and 7122 transitions. [2023-11-29 05:34:49,604 INFO L78 Accepts]: Start accepts. Automaton has 5041 states and 7122 transitions. Word has length 136 [2023-11-29 05:34:49,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:34:49,604 INFO L495 AbstractCegarLoop]: Abstraction has 5041 states and 7122 transitions. [2023-11-29 05:34:49,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 05:34:49,605 INFO L276 IsEmpty]: Start isEmpty. Operand 5041 states and 7122 transitions. [2023-11-29 05:34:49,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-29 05:34:49,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:49,615 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:49,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:34:49,615 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:34:49,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:49,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1658957559, now seen corresponding path program 1 times [2023-11-29 05:34:49,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:49,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914619164] [2023-11-29 05:34:49,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:49,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:49,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:34:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:49,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:34:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:49,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:34:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:49,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:34:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:50,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:34:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:50,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:34:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:50,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:34:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:50,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:34:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:50,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:34:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:50,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:34:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:50,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 05:34:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 05:34:50,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:50,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914619164] [2023-11-29 05:34:50,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914619164] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:34:50,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996289689] [2023-11-29 05:34:50,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:50,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:34:50,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:34:50,043 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:34:50,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:34:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:50,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 2703 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:34:50,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:34:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-29 05:34:50,787 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:34:50,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996289689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:50,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:34:50,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2023-11-29 05:34:50,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658984232] [2023-11-29 05:34:50,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:50,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:34:50,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:50,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:34:50,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:34:50,789 INFO L87 Difference]: Start difference. First operand 5041 states and 7122 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 05:34:51,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:34:51,435 INFO L93 Difference]: Finished difference Result 13396 states and 18700 transitions. [2023-11-29 05:34:51,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:34:51,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 140 [2023-11-29 05:34:51,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:34:51,452 INFO L225 Difference]: With dead ends: 13396 [2023-11-29 05:34:51,452 INFO L226 Difference]: Without dead ends: 8419 [2023-11-29 05:34:51,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:34:51,461 INFO L413 NwaCegarLoop]: 710 mSDtfsCounter, 498 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 2228 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:34:51,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 2228 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:34:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8419 states. [2023-11-29 05:34:51,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8419 to 5086. [2023-11-29 05:34:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5086 states, 4101 states have (on average 1.398927090953426) internal successors, (5737), 4111 states have internal predecessors, (5737), 715 states have call successors, (715), 263 states have call predecessors, (715), 263 states have return successors, (715), 711 states have call predecessors, (715), 715 states have call successors, (715) [2023-11-29 05:34:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5086 states to 5086 states and 7167 transitions. [2023-11-29 05:34:51,828 INFO L78 Accepts]: Start accepts. Automaton has 5086 states and 7167 transitions. Word has length 140 [2023-11-29 05:34:51,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:34:51,828 INFO L495 AbstractCegarLoop]: Abstraction has 5086 states and 7167 transitions. [2023-11-29 05:34:51,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 05:34:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 5086 states and 7167 transitions. [2023-11-29 05:34:51,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-29 05:34:51,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:51,838 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:51,848 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:34:52,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 05:34:52,040 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:34:52,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:52,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1762244349, now seen corresponding path program 1 times [2023-11-29 05:34:52,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:52,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599434418] [2023-11-29 05:34:52,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:52,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:52,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:52,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:34:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:52,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:34:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:52,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:34:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:52,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:34:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:52,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:34:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:52,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:34:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:52,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:34:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:52,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:34:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:52,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:34:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:52,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:34:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:52,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:34:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:52,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 05:34:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:52,533 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 05:34:52,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:52,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599434418] [2023-11-29 05:34:52,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599434418] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:34:52,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207710702] [2023-11-29 05:34:52,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:52,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:34:52,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:34:52,534 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:34:52,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:34:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:53,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 2728 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:34:53,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:34:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 21 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:34:53,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:34:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 05:34:53,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207710702] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:34:53,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:34:53,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12 [2023-11-29 05:34:53,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265153414] [2023-11-29 05:34:53,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:34:53,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:34:53,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:53,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:34:53,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:34:53,412 INFO L87 Difference]: Start difference. First operand 5086 states and 7167 transitions. Second operand has 13 states, 12 states have (on average 18.75) internal successors, (225), 9 states have internal predecessors, (225), 6 states have call successors, (33), 7 states have call predecessors, (33), 3 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2023-11-29 05:34:56,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:34:56,610 INFO L93 Difference]: Finished difference Result 16872 states and 23911 transitions. [2023-11-29 05:34:56,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 05:34:56,611 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 18.75) internal successors, (225), 9 states have internal predecessors, (225), 6 states have call successors, (33), 7 states have call predecessors, (33), 3 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) Word has length 149 [2023-11-29 05:34:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:34:56,643 INFO L225 Difference]: With dead ends: 16872 [2023-11-29 05:34:56,643 INFO L226 Difference]: Without dead ends: 16870 [2023-11-29 05:34:56,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=267, Invalid=545, Unknown=0, NotChecked=0, Total=812 [2023-11-29 05:34:56,647 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 4517 mSDsluCounter, 2413 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 1992 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4862 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 3350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1992 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:34:56,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4862 Valid, 2818 Invalid, 3350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1992 Valid, 1358 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 05:34:56,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16870 states. [2023-11-29 05:34:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16870 to 15650. [2023-11-29 05:34:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15650 states, 12658 states have (on average 1.4077263390741033) internal successors, (17819), 12675 states have internal predecessors, (17819), 2190 states have call successors, (2190), 795 states have call predecessors, (2190), 795 states have return successors, (2190), 2179 states have call predecessors, (2190), 2190 states have call successors, (2190) [2023-11-29 05:34:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15650 states to 15650 states and 22199 transitions. [2023-11-29 05:34:57,335 INFO L78 Accepts]: Start accepts. Automaton has 15650 states and 22199 transitions. Word has length 149 [2023-11-29 05:34:57,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:34:57,335 INFO L495 AbstractCegarLoop]: Abstraction has 15650 states and 22199 transitions. [2023-11-29 05:34:57,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 18.75) internal successors, (225), 9 states have internal predecessors, (225), 6 states have call successors, (33), 7 states have call predecessors, (33), 3 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2023-11-29 05:34:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 15650 states and 22199 transitions. [2023-11-29 05:34:57,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:34:57,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:57,344 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:57,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 05:34:57,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 05:34:57,544 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:34:57,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:57,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1670288289, now seen corresponding path program 1 times [2023-11-29 05:34:57,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:57,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085822457] [2023-11-29 05:34:57,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:57,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:57,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:57,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:34:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:57,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:34:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:57,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:34:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:57,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:34:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:57,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:34:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:57,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:34:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:57,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:34:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:57,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:34:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:34:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:57,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:34:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:57,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:34:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:57,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 05:34:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2023-11-29 05:34:57,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:57,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085822457] [2023-11-29 05:34:57,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085822457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:57,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:57,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:34:57,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349304611] [2023-11-29 05:34:57,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:57,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:34:57,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:57,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:34:57,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:34:57,867 INFO L87 Difference]: Start difference. First operand 15650 states and 22199 transitions. Second operand has 8 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 05:34:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:34:59,885 INFO L93 Difference]: Finished difference Result 20334 states and 28678 transitions. [2023-11-29 05:34:59,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:34:59,886 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 162 [2023-11-29 05:34:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:34:59,936 INFO L225 Difference]: With dead ends: 20334 [2023-11-29 05:34:59,936 INFO L226 Difference]: Without dead ends: 20329 [2023-11-29 05:34:59,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:34:59,941 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 1371 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 626 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 626 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:34:59,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1520 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [626 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:34:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20329 states. [2023-11-29 05:35:00,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20329 to 17355. [2023-11-29 05:35:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17355 states, 14035 states have (on average 1.4022087638047738) internal successors, (19680), 14050 states have internal predecessors, (19680), 2436 states have call successors, (2436), 879 states have call predecessors, (2436), 879 states have return successors, (2436), 2425 states have call predecessors, (2436), 2436 states have call successors, (2436) [2023-11-29 05:35:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17355 states to 17355 states and 24552 transitions. [2023-11-29 05:35:00,803 INFO L78 Accepts]: Start accepts. Automaton has 17355 states and 24552 transitions. Word has length 162 [2023-11-29 05:35:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:35:00,803 INFO L495 AbstractCegarLoop]: Abstraction has 17355 states and 24552 transitions. [2023-11-29 05:35:00,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 05:35:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 17355 states and 24552 transitions. [2023-11-29 05:35:00,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2023-11-29 05:35:00,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:35:00,825 INFO L195 NwaCegarLoop]: trace histogram [9, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:35:00,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:35:00,825 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:35:00,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:00,825 INFO L85 PathProgramCache]: Analyzing trace with hash -341671119, now seen corresponding path program 1 times [2023-11-29 05:35:00,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:00,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395658267] [2023-11-29 05:35:00,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:00,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:35:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:35:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:35:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:35:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:35:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:35:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:35:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:35:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:35:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:35:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:35:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:35:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 05:35:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 05:35:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2023-11-29 05:35:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-29 05:35:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:01,683 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-11-29 05:35:01,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:01,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395658267] [2023-11-29 05:35:01,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395658267] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:35:01,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685634544] [2023-11-29 05:35:01,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:01,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:35:01,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:35:01,685 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:35:01,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:35:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:02,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 3030 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 05:35:02,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:35:02,512 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 107 proven. 17 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2023-11-29 05:35:02,512 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:35:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 51 proven. 17 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2023-11-29 05:35:02,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685634544] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:35:02,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:35:02,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 12 [2023-11-29 05:35:02,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024854127] [2023-11-29 05:35:02,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:35:02,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:35:02,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:02,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:35:02,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:35:02,743 INFO L87 Difference]: Start difference. First operand 17355 states and 24552 transitions. Second operand has 13 states, 12 states have (on average 20.25) internal successors, (243), 9 states have internal predecessors, (243), 6 states have call successors, (35), 7 states have call predecessors, (35), 3 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2023-11-29 05:35:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:35:05,336 INFO L93 Difference]: Finished difference Result 20363 states and 28685 transitions. [2023-11-29 05:35:05,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:35:05,337 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 20.25) internal successors, (243), 9 states have internal predecessors, (243), 6 states have call successors, (35), 7 states have call predecessors, (35), 3 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) Word has length 232 [2023-11-29 05:35:05,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:35:05,371 INFO L225 Difference]: With dead ends: 20363 [2023-11-29 05:35:05,371 INFO L226 Difference]: Without dead ends: 20360 [2023-11-29 05:35:05,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 499 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2023-11-29 05:35:05,376 INFO L413 NwaCegarLoop]: 1047 mSDtfsCounter, 1898 mSDsluCounter, 3485 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 669 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 4532 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 669 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:35:05,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2075 Valid, 4532 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [669 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 05:35:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20360 states. [2023-11-29 05:35:06,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20360 to 7958. [2023-11-29 05:35:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7958 states, 6427 states have (on average 1.4045433328146881) internal successors, (9027), 6434 states have internal predecessors, (9027), 1122 states have call successors, (1122), 407 states have call predecessors, (1122), 407 states have return successors, (1122), 1116 states have call predecessors, (1122), 1122 states have call successors, (1122) [2023-11-29 05:35:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7958 states to 7958 states and 11271 transitions. [2023-11-29 05:35:06,189 INFO L78 Accepts]: Start accepts. Automaton has 7958 states and 11271 transitions. Word has length 232 [2023-11-29 05:35:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:35:06,190 INFO L495 AbstractCegarLoop]: Abstraction has 7958 states and 11271 transitions. [2023-11-29 05:35:06,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 20.25) internal successors, (243), 9 states have internal predecessors, (243), 6 states have call successors, (35), 7 states have call predecessors, (35), 3 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2023-11-29 05:35:06,190 INFO L276 IsEmpty]: Start isEmpty. Operand 7958 states and 11271 transitions. [2023-11-29 05:35:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2023-11-29 05:35:06,211 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:35:06,211 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2023-11-29 05:35:06,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 05:35:06,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 05:35:06,412 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:35:06,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:06,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1483945411, now seen corresponding path program 2 times [2023-11-29 05:35:06,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:06,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222753247] [2023-11-29 05:35:06,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:06,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:35:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:35:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:35:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:35:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:35:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:35:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:35:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:35:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:35:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:35:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:35:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:35:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 05:35:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 05:35:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 05:35:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-29 05:35:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-11-29 05:35:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-11-29 05:35:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-29 05:35:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-11-29 05:35:06,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:06,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222753247] [2023-11-29 05:35:06,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222753247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:06,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:06,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:35:06,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793323804] [2023-11-29 05:35:06,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:06,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:35:06,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:06,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:35:06,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:35:06,875 INFO L87 Difference]: Start difference. First operand 7958 states and 11271 transitions. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 05:35:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:35:08,170 INFO L93 Difference]: Finished difference Result 17458 states and 25068 transitions. [2023-11-29 05:35:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:35:08,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 272 [2023-11-29 05:35:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:35:08,196 INFO L225 Difference]: With dead ends: 17458 [2023-11-29 05:35:08,196 INFO L226 Difference]: Without dead ends: 9564 [2023-11-29 05:35:08,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:35:08,212 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 280 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:35:08,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1900 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:35:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9564 states. [2023-11-29 05:35:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9564 to 9284. [2023-11-29 05:35:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9284 states, 7705 states have (on average 1.391304347826087) internal successors, (10720), 7712 states have internal predecessors, (10720), 1128 states have call successors, (1128), 449 states have call predecessors, (1128), 449 states have return successors, (1128), 1122 states have call predecessors, (1128), 1128 states have call successors, (1128) [2023-11-29 05:35:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9284 states to 9284 states and 12976 transitions. [2023-11-29 05:35:08,836 INFO L78 Accepts]: Start accepts. Automaton has 9284 states and 12976 transitions. Word has length 272 [2023-11-29 05:35:08,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:35:08,837 INFO L495 AbstractCegarLoop]: Abstraction has 9284 states and 12976 transitions. [2023-11-29 05:35:08,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 05:35:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 9284 states and 12976 transitions. [2023-11-29 05:35:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2023-11-29 05:35:08,857 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:35:08,857 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 10, 8, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:35:08,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:35:08,857 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:35:08,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:08,858 INFO L85 PathProgramCache]: Analyzing trace with hash 580193573, now seen corresponding path program 3 times [2023-11-29 05:35:08,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:08,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560463240] [2023-11-29 05:35:08,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:08,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:35:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:35:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:35:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:35:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:35:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:35:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:35:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:35:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:35:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:35:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:35:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:35:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 05:35:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:35:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 05:35:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-29 05:35:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-29 05:35:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-29 05:35:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 05:35:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-11-29 05:35:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 05:35:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-11-29 05:35:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2023-11-29 05:35:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:09,227 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2023-11-29 05:35:09,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:09,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560463240] [2023-11-29 05:35:09,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560463240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:09,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:09,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:35:09,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128344718] [2023-11-29 05:35:09,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:09,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:35:09,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:09,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:35:09,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:35:09,229 INFO L87 Difference]: Start difference. First operand 9284 states and 12976 transitions. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 05:35:10,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:35:10,255 INFO L93 Difference]: Finished difference Result 18131 states and 25371 transitions. [2023-11-29 05:35:10,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:35:10,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 282 [2023-11-29 05:35:10,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:35:10,270 INFO L225 Difference]: With dead ends: 18131 [2023-11-29 05:35:10,270 INFO L226 Difference]: Without dead ends: 8440 [2023-11-29 05:35:10,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:35:10,282 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 468 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:35:10,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1403 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:35:10,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8440 states. [2023-11-29 05:35:10,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8440 to 8382. [2023-11-29 05:35:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8382 states, 6951 states have (on average 1.3749100848798734) internal successors, (9557), 6952 states have internal predecessors, (9557), 1021 states have call successors, (1021), 408 states have call predecessors, (1021), 408 states have return successors, (1021), 1021 states have call predecessors, (1021), 1021 states have call successors, (1021) [2023-11-29 05:35:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8382 states to 8382 states and 11599 transitions. [2023-11-29 05:35:10,730 INFO L78 Accepts]: Start accepts. Automaton has 8382 states and 11599 transitions. Word has length 282 [2023-11-29 05:35:10,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:35:10,730 INFO L495 AbstractCegarLoop]: Abstraction has 8382 states and 11599 transitions. [2023-11-29 05:35:10,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 05:35:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 8382 states and 11599 transitions. [2023-11-29 05:35:10,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2023-11-29 05:35:10,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:35:10,743 INFO L195 NwaCegarLoop]: trace histogram [11, 7, 7, 7, 7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 05:35:10,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:35:10,743 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:35:10,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:10,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1367795910, now seen corresponding path program 1 times [2023-11-29 05:35:10,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:10,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679722379] [2023-11-29 05:35:10,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:10,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:35:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:35:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:35:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:35:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:35:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:35:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:35:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:35:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:35:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:35:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:35:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:35:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 05:35:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 05:35:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-29 05:35:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-11-29 05:35:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-29 05:35:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-11-29 05:35:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2023-11-29 05:35:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-29 05:35:11,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:11,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679722379] [2023-11-29 05:35:11,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679722379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:11,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:11,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:35:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288479754] [2023-11-29 05:35:11,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:11,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:35:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:11,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:35:11,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:35:11,160 INFO L87 Difference]: Start difference. First operand 8382 states and 11599 transitions. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 05:35:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:35:12,556 INFO L93 Difference]: Finished difference Result 18143 states and 25353 transitions. [2023-11-29 05:35:12,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:35:12,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 296 [2023-11-29 05:35:12,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:35:12,569 INFO L225 Difference]: With dead ends: 18143 [2023-11-29 05:35:12,569 INFO L226 Difference]: Without dead ends: 9861 [2023-11-29 05:35:12,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:35:12,579 INFO L413 NwaCegarLoop]: 498 mSDtfsCounter, 242 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:35:12,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 2231 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:35:12,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9861 states. [2023-11-29 05:35:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9861 to 9802. [2023-11-29 05:35:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9802 states, 8269 states have (on average 1.360986818236788) internal successors, (11254), 8270 states have internal predecessors, (11254), 1027 states have call successors, (1027), 504 states have call predecessors, (1027), 504 states have return successors, (1027), 1027 states have call predecessors, (1027), 1027 states have call successors, (1027) [2023-11-29 05:35:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9802 states to 9802 states and 13308 transitions. [2023-11-29 05:35:13,048 INFO L78 Accepts]: Start accepts. Automaton has 9802 states and 13308 transitions. Word has length 296 [2023-11-29 05:35:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:35:13,048 INFO L495 AbstractCegarLoop]: Abstraction has 9802 states and 13308 transitions. [2023-11-29 05:35:13,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 05:35:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 9802 states and 13308 transitions. [2023-11-29 05:35:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2023-11-29 05:35:13,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:35:13,062 INFO L195 NwaCegarLoop]: trace histogram [13, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:35:13,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:35:13,063 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:35:13,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:13,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1116456726, now seen corresponding path program 1 times [2023-11-29 05:35:13,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:13,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025855098] [2023-11-29 05:35:13,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:13,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:35:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:35:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:35:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:35:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:35:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:35:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:35:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:35:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:35:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:35:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:35:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:35:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:35:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 05:35:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-29 05:35:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-11-29 05:35:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2023-11-29 05:35:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-11-29 05:35:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-11-29 05:35:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2023-11-29 05:35:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2023-11-29 05:35:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:13,490 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2023-11-29 05:35:13,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:13,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025855098] [2023-11-29 05:35:13,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025855098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:13,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:13,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:35:13,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461263692] [2023-11-29 05:35:13,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:13,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:35:13,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:13,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:35:13,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:35:13,492 INFO L87 Difference]: Start difference. First operand 9802 states and 13308 transitions. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 05:35:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:35:14,810 INFO L93 Difference]: Finished difference Result 20929 states and 28717 transitions. [2023-11-29 05:35:14,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:35:14,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 332 [2023-11-29 05:35:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:35:14,824 INFO L225 Difference]: With dead ends: 20929 [2023-11-29 05:35:14,825 INFO L226 Difference]: Without dead ends: 11227 [2023-11-29 05:35:14,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:35:14,836 INFO L413 NwaCegarLoop]: 498 mSDtfsCounter, 231 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:35:14,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 2230 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:35:14,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11227 states. [2023-11-29 05:35:15,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11227 to 11168. [2023-11-29 05:35:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11168 states, 9551 states have (on average 1.3522144278086063) internal successors, (12915), 9552 states have internal predecessors, (12915), 1033 states have call successors, (1033), 582 states have call predecessors, (1033), 582 states have return successors, (1033), 1033 states have call predecessors, (1033), 1033 states have call successors, (1033) [2023-11-29 05:35:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11168 states to 11168 states and 14981 transitions. [2023-11-29 05:35:15,373 INFO L78 Accepts]: Start accepts. Automaton has 11168 states and 14981 transitions. Word has length 332 [2023-11-29 05:35:15,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:35:15,373 INFO L495 AbstractCegarLoop]: Abstraction has 11168 states and 14981 transitions. [2023-11-29 05:35:15,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 05:35:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 11168 states and 14981 transitions. [2023-11-29 05:35:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2023-11-29 05:35:15,386 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:35:15,386 INFO L195 NwaCegarLoop]: trace histogram [13, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:35:15,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:35:15,387 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:35:15,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:15,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1175910188, now seen corresponding path program 1 times [2023-11-29 05:35:15,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:15,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786456993] [2023-11-29 05:35:15,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:15,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:35:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:35:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:35:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:35:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:35:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:35:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:35:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:35:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:35:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:35:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:35:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:35:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 05:35:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-29 05:35:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 05:35:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-11-29 05:35:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-11-29 05:35:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-11-29 05:35:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2023-11-29 05:35:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2023-11-29 05:35:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2023-11-29 05:35:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:15,738 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2023-11-29 05:35:15,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:15,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786456993] [2023-11-29 05:35:15,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786456993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:15,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:15,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:35:15,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66374492] [2023-11-29 05:35:15,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:15,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:35:15,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:15,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:35:15,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:35:15,740 INFO L87 Difference]: Start difference. First operand 11168 states and 14981 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 3 states have internal predecessors, (156), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 05:35:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:35:17,005 INFO L93 Difference]: Finished difference Result 23733 states and 32153 transitions. [2023-11-29 05:35:17,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:35:17,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 3 states have internal predecessors, (156), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 334 [2023-11-29 05:35:17,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:35:17,021 INFO L225 Difference]: With dead ends: 23733 [2023-11-29 05:35:17,021 INFO L226 Difference]: Without dead ends: 12665 [2023-11-29 05:35:17,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:35:17,035 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 240 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:35:17,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 2227 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:35:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12665 states. [2023-11-29 05:35:17,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12665 to 12606. [2023-11-29 05:35:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12606 states, 10887 states have (on average 1.343804537521815) internal successors, (14630), 10888 states have internal predecessors, (14630), 1039 states have call successors, (1039), 678 states have call predecessors, (1039), 678 states have return successors, (1039), 1039 states have call predecessors, (1039), 1039 states have call successors, (1039) [2023-11-29 05:35:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12606 states to 12606 states and 16708 transitions. [2023-11-29 05:35:17,608 INFO L78 Accepts]: Start accepts. Automaton has 12606 states and 16708 transitions. Word has length 334 [2023-11-29 05:35:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:35:17,609 INFO L495 AbstractCegarLoop]: Abstraction has 12606 states and 16708 transitions. [2023-11-29 05:35:17,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 3 states have internal predecessors, (156), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 05:35:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 12606 states and 16708 transitions. [2023-11-29 05:35:17,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2023-11-29 05:35:17,619 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:35:17,620 INFO L195 NwaCegarLoop]: trace histogram [15, 11, 11, 11, 7, 7, 7, 7, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:35:17,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:35:17,620 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-29 05:35:17,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:17,620 INFO L85 PathProgramCache]: Analyzing trace with hash 108758646, now seen corresponding path program 1 times [2023-11-29 05:35:17,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:17,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099826376] [2023-11-29 05:35:17,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:35:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:35:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:35:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:35:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:35:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:35:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:35:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:35:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:35:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:35:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:35:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 05:35:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 05:35:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 05:35:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 05:35:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2023-11-29 05:35:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-29 05:35:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-11-29 05:35:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2023-11-29 05:35:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2023-11-29 05:35:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2023-11-29 05:35:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2023-11-29 05:35:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2023-11-29 05:35:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:17,958 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2023-11-29 05:35:17,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:17,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099826376] [2023-11-29 05:35:17,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099826376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:17,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:17,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:35:17,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168174404] [2023-11-29 05:35:17,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:17,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:35:17,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:17,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:35:17,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:35:17,960 INFO L87 Difference]: Start difference. First operand 12606 states and 16708 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 3 states have internal predecessors, (167), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 05:35:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:35:18,772 INFO L93 Difference]: Finished difference Result 15242 states and 20182 transitions. [2023-11-29 05:35:18,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:35:18,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 3 states have internal predecessors, (167), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 364 [2023-11-29 05:35:18,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:35:18,773 INFO L225 Difference]: With dead ends: 15242 [2023-11-29 05:35:18,773 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 05:35:18,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:35:18,782 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 262 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:35:18,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1848 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:35:18,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 05:35:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 05:35:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:35:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 05:35:18,784 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 364 [2023-11-29 05:35:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:35:18,784 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 05:35:18,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 3 states have internal predecessors, (167), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 05:35:18,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 05:35:18,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 05:35:18,788 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2023-11-29 05:35:18,788 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2023-11-29 05:35:18,788 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2023-11-29 05:35:18,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2023-11-29 05:35:18,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2023-11-29 05:35:18,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2023-11-29 05:35:18,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2023-11-29 05:35:18,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2023-11-29 05:35:18,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2023-11-29 05:35:18,790 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2023-11-29 05:35:18,790 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2023-11-29 05:35:18,790 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2023-11-29 05:35:18,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:35:18,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 05:39:08,272 WARN L293 SmtUtils]: Spent 3.75m on a formula simplification. DAG size of input: 97 DAG size of output: 48 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:42:46,407 WARN L293 SmtUtils]: Spent 3.61m on a formula simplification. DAG size of input: 97 DAG size of output: 48 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 05:42:56,995 INFO L899 garLoopResultBuilder]: For program point usb_wwan_openEXIT(lines 5417 5419) no Hoare annotation was computed. [2023-11-29 05:42:56,995 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5417 5419) the Hoare annotation is: true [2023-11-29 05:42:56,996 INFO L902 garLoopResultBuilder]: At program point LDV_STOP(lines 4384 4390) the Hoare annotation is: true [2023-11-29 05:42:56,996 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 4384 4390) no Hoare annotation was computed. [2023-11-29 05:42:56,996 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5403 5405) the Hoare annotation is: true [2023-11-29 05:42:56,996 INFO L899 garLoopResultBuilder]: For program point usb_set_interfaceEXIT(lines 5403 5405) no Hoare annotation was computed. [2023-11-29 05:42:56,996 INFO L899 garLoopResultBuilder]: For program point usb_endpoint_xfer_bulkEXIT(lines 4428 4433) no Hoare annotation was computed. [2023-11-29 05:42:56,996 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4428 4433) the Hoare annotation is: true [2023-11-29 05:42:56,996 INFO L899 garLoopResultBuilder]: For program point L4334(lines 4334 4341) no Hoare annotation was computed. [2023-11-29 05:42:56,996 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 4327 4343) the Hoare annotation is: (let ((.cse7 (< 1 ~ref_cnt~0)) (.cse8 (< ~ref_cnt~0 1)) (.cse0 (not (= ~ldv_state_variable_0~0 2))) (.cse1 (< ~ref_cnt~0 0)) (.cse2 (not (= ~ldv_state_variable_1~0 1))) (.cse4 (< 0 ~ref_cnt~0)) (.cse3 (not (= ~ldv_retval_5~0 0))) (.cse5 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse6 (not (= ~ldv_state_variable_2~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse2 .cse3 (not (= ~ldv_state_variable_2~0 3)) .cse5 .cse7 .cse8) (or .cse0 (not (= ~ldv_state_variable_2~0 2)) .cse2 .cse3 .cse5 .cse7 .cse8) (or .cse0 .cse1 (not (= ~ldv_state_variable_2~0 1)) .cse2 .cse3 .cse4 .cse5) (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~ref_cnt~0 0)) .cse3 .cse5 .cse6))) [2023-11-29 05:42:56,996 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 4327 4343) no Hoare annotation was computed. [2023-11-29 05:42:56,997 INFO L902 garLoopResultBuilder]: At program point L4339(line 4339) the Hoare annotation is: true [2023-11-29 05:42:56,997 INFO L899 garLoopResultBuilder]: For program point L4339-1(line 4339) no Hoare annotation was computed. [2023-11-29 05:42:56,997 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 4327 4343) no Hoare annotation was computed. [2023-11-29 05:42:56,997 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 5444 5446) no Hoare annotation was computed. [2023-11-29 05:42:56,997 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 5444 5446) the Hoare annotation is: (let ((.cse3 (< 1 ~ref_cnt~0)) (.cse5 (< ~ref_cnt~0 1)) (.cse0 (not (= ~ldv_state_variable_0~0 2))) (.cse6 (< ~ref_cnt~0 0)) (.cse1 (not (= ~ldv_state_variable_1~0 1))) (.cse2 (not (= ~ldv_retval_5~0 0))) (.cse7 (< 0 ~ref_cnt~0)) (.cse4 (= |old(#valid)| |#valid|))) (and (or .cse0 .cse1 .cse2 (not (= ~ldv_state_variable_2~0 3)) .cse3 .cse4 .cse5) (or .cse0 (not (= ~ldv_state_variable_2~0 2)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 (not (= ~ldv_state_variable_2~0 1)) .cse1 .cse2 .cse7 .cse4) (or .cse0 .cse6 .cse1 .cse2 .cse7 (not (= ~ldv_state_variable_2~0 0)) .cse4))) [2023-11-29 05:42:56,997 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5413 5415) the Hoare annotation is: true [2023-11-29 05:42:56,997 INFO L899 garLoopResultBuilder]: For program point usb_wwan_disconnectEXIT(lines 5413 5415) no Hoare annotation was computed. [2023-11-29 05:42:56,997 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memset#5EXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,997 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2023-11-29 05:42:56,997 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~ref_cnt~0 0)) (and (= |old(#memory_$Pointer$#5.offset)| |#memory_$Pointer$#5.offset|) (= |#memory_int#5| |old(#memory_int#5)|) (= |#memory_$Pointer$#5.base| |old(#memory_$Pointer$#5.base)|)) (not (= ~ldv_retval_5~0 0)) (not (= ~ldv_state_variable_2~0 0))) [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memset#4EXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memset#7EXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,998 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2023-11-29 05:42:56,998 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~ref_cnt~0 0)) (not (= ~ldv_retval_5~0 0)) (not (= ~ldv_state_variable_2~0 0)) (and (= |old(#memory_$Pointer$#7.base)| |#memory_$Pointer$#7.base|) (= |#memory_$Pointer$#7.offset| |old(#memory_$Pointer$#7.offset)|) (= |#memory_int#7| |old(#memory_int#7)|))) [2023-11-29 05:42:56,998 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 4377 4383) the Hoare annotation is: true [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 4377 4383) no Hoare annotation was computed. [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memset#6EXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memset#1EXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memset#0EXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,998 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memset#3EXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memset#2EXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memset#10EXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memset#9EXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memset#8EXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5383 5385) the Hoare annotation is: true [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point usb_serial_disconnectEXIT(lines 5383 5385) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memset#13EXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memset#12EXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:42:56,999 INFO L899 garLoopResultBuilder]: For program point usb_wwan_write_roomEXIT(lines 5440 5442) no Hoare annotation was computed. [2023-11-29 05:42:57,000 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5440 5442) the Hoare annotation is: true [2023-11-29 05:42:57,000 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memset#11EXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:42:57,000 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2023-11-29 05:42:57,000 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:42:57,000 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4324 4326) the Hoare annotation is: true [2023-11-29 05:42:57,000 INFO L899 garLoopResultBuilder]: For program point L4325-2(lines 4324 4326) no Hoare annotation was computed. [2023-11-29 05:42:57,000 INFO L899 garLoopResultBuilder]: For program point L4325(line 4325) no Hoare annotation was computed. [2023-11-29 05:42:57,000 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 4324 4326) no Hoare annotation was computed. [2023-11-29 05:42:57,000 INFO L902 garLoopResultBuilder]: At program point LDV_STOP(lines 5290 5296) the Hoare annotation is: true [2023-11-29 05:42:57,000 INFO L899 garLoopResultBuilder]: For program point ldv_stop___0EXIT(lines 5290 5296) no Hoare annotation was computed. [2023-11-29 05:42:57,000 INFO L902 garLoopResultBuilder]: At program point rcu_read_lock_sched_notraceFINAL(lines 4066 4071) the Hoare annotation is: true [2023-11-29 05:42:57,000 INFO L899 garLoopResultBuilder]: For program point rcu_read_lock_sched_notraceEXIT(lines 4066 4071) no Hoare annotation was computed. [2023-11-29 05:42:57,000 INFO L899 garLoopResultBuilder]: For program point usb_wwan_resumeEXIT(lines 5424 5426) no Hoare annotation was computed. [2023-11-29 05:42:57,000 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5424 5426) the Hoare annotation is: true [2023-11-29 05:42:57,000 INFO L899 garLoopResultBuilder]: For program point L4119(lines 4119 4135) no Hoare annotation was computed. [2023-11-29 05:42:57,000 INFO L902 garLoopResultBuilder]: At program point do_trace(lines 4098 4138) the Hoare annotation is: true [2023-11-29 05:42:57,000 INFO L902 garLoopResultBuilder]: At program point L4119-2(lines 4119 4135) the Hoare annotation is: true [2023-11-29 05:42:57,000 INFO L899 garLoopResultBuilder]: For program point trace_kmallocEXIT(lines 4087 4139) no Hoare annotation was computed. [2023-11-29 05:42:57,000 INFO L899 garLoopResultBuilder]: For program point L4111(lines 4111 4115) no Hoare annotation was computed. [2023-11-29 05:42:57,000 INFO L899 garLoopResultBuilder]: For program point L4109-1(lines 4109 4117) no Hoare annotation was computed. [2023-11-29 05:42:57,000 INFO L899 garLoopResultBuilder]: For program point L4109(lines 4109 4117) no Hoare annotation was computed. [2023-11-29 05:42:57,001 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4087 4139) the Hoare annotation is: true [2023-11-29 05:42:57,001 INFO L899 garLoopResultBuilder]: For program point trace_kmallocFINAL(lines 4087 4139) no Hoare annotation was computed. [2023-11-29 05:42:57,001 INFO L899 garLoopResultBuilder]: For program point L4130(lines 4130 4133) no Hoare annotation was computed. [2023-11-29 05:42:57,001 INFO L899 garLoopResultBuilder]: For program point L4120(lines 4119 4134) no Hoare annotation was computed. [2023-11-29 05:42:57,001 INFO L899 garLoopResultBuilder]: For program point L4106(line 4106) no Hoare annotation was computed. [2023-11-29 05:42:57,001 INFO L899 garLoopResultBuilder]: For program point L4100(lines 4100 4103) no Hoare annotation was computed. [2023-11-29 05:42:57,001 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5363 5365) the Hoare annotation is: true [2023-11-29 05:42:57,001 INFO L899 garLoopResultBuilder]: For program point printkEXIT(lines 5363 5365) no Hoare annotation was computed. [2023-11-29 05:42:57,001 INFO L899 garLoopResultBuilder]: For program point dev_errEXIT(lines 5349 5351) no Hoare annotation was computed. [2023-11-29 05:42:57,001 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5349 5351) the Hoare annotation is: true [2023-11-29 05:42:57,001 INFO L899 garLoopResultBuilder]: For program point usb_serial_deregisterEXIT(lines 5380 5382) no Hoare annotation was computed. [2023-11-29 05:42:57,001 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5380 5382) the Hoare annotation is: true [2023-11-29 05:42:57,001 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5436 5438) the Hoare annotation is: true [2023-11-29 05:42:57,001 INFO L899 garLoopResultBuilder]: For program point usb_wwan_writeEXIT(lines 5436 5438) no Hoare annotation was computed. [2023-11-29 05:42:57,001 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5432 5434) the Hoare annotation is: true [2023-11-29 05:42:57,001 INFO L899 garLoopResultBuilder]: For program point usb_wwan_suspendEXIT(lines 5432 5434) no Hoare annotation was computed. [2023-11-29 05:42:57,001 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5410 5412) the Hoare annotation is: true [2023-11-29 05:42:57,001 INFO L899 garLoopResultBuilder]: For program point usb_wwan_closeEXIT(lines 5410 5412) no Hoare annotation was computed. [2023-11-29 05:42:57,001 INFO L899 garLoopResultBuilder]: For program point L4351(lines 4351 4358) no Hoare annotation was computed. [2023-11-29 05:42:57,002 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 4344 4360) the Hoare annotation is: (let ((.cse3 (not (= ~ldv_state_variable_2~0 0))) (.cse0 (and (= |old(#length)| |#length|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#valid)| |#valid|))) (.cse1 (not (= ~ref_cnt~0 0))) (.cse2 (not (= ~ldv_retval_5~0 0)))) (and (or (not (= ~ldv_state_variable_1~0 0)) .cse0 .cse1 .cse2 .cse3) (or .cse0 (not (= ~ldv_state_variable_0~0 2)) (< ~ref_cnt~0 0) (not (= ~ldv_state_variable_1~0 1)) .cse2 (< 0 ~ref_cnt~0) .cse3) (or .cse0 .cse1 (not (= ~ldv_state_variable_2~0 1)) .cse2))) [2023-11-29 05:42:57,002 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 4344 4360) no Hoare annotation was computed. [2023-11-29 05:42:57,002 INFO L899 garLoopResultBuilder]: For program point L4356-1(line 4356) no Hoare annotation was computed. [2023-11-29 05:42:57,002 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 4344 4360) no Hoare annotation was computed. [2023-11-29 05:42:57,002 INFO L902 garLoopResultBuilder]: At program point L4356(line 4356) the Hoare annotation is: true [2023-11-29 05:42:57,002 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5407 5409) the Hoare annotation is: true [2023-11-29 05:42:57,002 INFO L899 garLoopResultBuilder]: For program point usb_wwan_chars_in_bufferEXIT(lines 5407 5409) no Hoare annotation was computed. [2023-11-29 05:42:57,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 4961) no Hoare annotation was computed. [2023-11-29 05:42:57,002 INFO L899 garLoopResultBuilder]: For program point L5189(line 5189) no Hoare annotation was computed. [2023-11-29 05:42:57,002 INFO L899 garLoopResultBuilder]: For program point L5189-1(line 5189) no Hoare annotation was computed. [2023-11-29 05:42:57,003 INFO L895 garLoopResultBuilder]: At program point L4991(line 4991) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse4 (= 2 ~ref_cnt~0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_state_variable_1~0 3)) (.cse3 (= ~ldv_retval_5~0 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and .cse4 (= ~ldv_state_variable_2~0 3) .cse0 .cse2 .cse3))) [2023-11-29 05:42:57,003 INFO L899 garLoopResultBuilder]: For program point L4991-1(line 4991) no Hoare annotation was computed. [2023-11-29 05:42:57,003 INFO L899 garLoopResultBuilder]: For program point L4463(lines 4463 4467) no Hoare annotation was computed. [2023-11-29 05:42:57,003 INFO L895 garLoopResultBuilder]: At program point L4926(line 4926) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_5~0 0) (= ~ref_cnt~0 0)) [2023-11-29 05:42:57,003 INFO L899 garLoopResultBuilder]: For program point L4926-1(line 4926) no Hoare annotation was computed. [2023-11-29 05:42:57,003 INFO L899 garLoopResultBuilder]: For program point kmalloc_returnLabel#1(lines 4277 4309) no Hoare annotation was computed. [2023-11-29 05:42:57,003 INFO L899 garLoopResultBuilder]: For program point L4200(lines 4200 4203) no Hoare annotation was computed. [2023-11-29 05:42:57,003 INFO L895 garLoopResultBuilder]: At program point L4795(line 4795) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,003 INFO L899 garLoopResultBuilder]: For program point L4795-1(line 4795) no Hoare annotation was computed. [2023-11-29 05:42:57,003 INFO L895 garLoopResultBuilder]: At program point L4862(line 4862) the Hoare annotation is: (= ~ldv_state_variable_2~0 0) [2023-11-29 05:42:57,003 INFO L899 garLoopResultBuilder]: For program point L4862-1(lines 4858 4865) no Hoare annotation was computed. [2023-11-29 05:42:57,003 INFO L899 garLoopResultBuilder]: For program point L4268-2(line 4268) no Hoare annotation was computed. [2023-11-29 05:42:57,003 INFO L899 garLoopResultBuilder]: For program point L4268(line 4268) no Hoare annotation was computed. [2023-11-29 05:42:57,003 INFO L899 garLoopResultBuilder]: For program point L4268-4(line 4268) no Hoare annotation was computed. [2023-11-29 05:42:57,003 INFO L899 garLoopResultBuilder]: For program point L5061(line 5061) no Hoare annotation was computed. [2023-11-29 05:42:57,003 INFO L899 garLoopResultBuilder]: For program point L5061-1(line 5061) no Hoare annotation was computed. [2023-11-29 05:42:57,003 INFO L895 garLoopResultBuilder]: At program point L4929(line 4929) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_5~0 0) (= ~ref_cnt~0 0)) [2023-11-29 05:42:57,004 INFO L899 garLoopResultBuilder]: For program point L4929-1(line 4929) no Hoare annotation was computed. [2023-11-29 05:42:57,004 INFO L895 garLoopResultBuilder]: At program point L4930(line 4930) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_5~0 0) (= ~ref_cnt~0 0)) [2023-11-29 05:42:57,004 INFO L895 garLoopResultBuilder]: At program point L4798(line 4798) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,004 INFO L899 garLoopResultBuilder]: For program point L4930-1(line 4930) no Hoare annotation was computed. [2023-11-29 05:42:57,004 INFO L899 garLoopResultBuilder]: For program point L4798-1(line 4798) no Hoare annotation was computed. [2023-11-29 05:42:57,004 INFO L899 garLoopResultBuilder]: For program point L4732(lines 4732 4735) no Hoare annotation was computed. [2023-11-29 05:42:57,004 INFO L899 garLoopResultBuilder]: For program point qcinit_returnLabel#1(lines 4840 4857) no Hoare annotation was computed. [2023-11-29 05:42:57,004 INFO L899 garLoopResultBuilder]: For program point L4204(lines 4204 4207) no Hoare annotation was computed. [2023-11-29 05:42:57,004 INFO L895 garLoopResultBuilder]: At program point L5129(line 5129) the Hoare annotation is: (let ((.cse4 (= ~ref_cnt~0 1)) (.cse0 (= 2 ~ref_cnt~0)) (.cse1 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse3 (= ~ldv_state_variable_1~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and (= ~ldv_state_variable_2~0 0) .cse1 .cse4 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse1 .cse4 .cse2 .cse3) (and .cse0 (= ~ldv_state_variable_2~0 3) .cse1 .cse2 .cse3))) [2023-11-29 05:42:57,004 INFO L899 garLoopResultBuilder]: For program point L5129-1(line 5129) no Hoare annotation was computed. [2023-11-29 05:42:57,004 INFO L899 garLoopResultBuilder]: For program point L4271(line 4271) no Hoare annotation was computed. [2023-11-29 05:42:57,004 INFO L895 garLoopResultBuilder]: At program point L4271-2(line 4271) the Hoare annotation is: false [2023-11-29 05:42:57,004 INFO L899 garLoopResultBuilder]: For program point L4271-3(lines 4271 4272) no Hoare annotation was computed. [2023-11-29 05:42:57,004 INFO L899 garLoopResultBuilder]: For program point L4800-1(lines 4800 4801) no Hoare annotation was computed. [2023-11-29 05:42:57,004 INFO L895 garLoopResultBuilder]: At program point L4800(lines 4800 4801) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_state_variable_1~0 1)) (.cse3 (= ~ldv_retval_5~0 0)) (.cse4 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_2~0 3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 1) .cse0 .cse2 .cse3 .cse4))) [2023-11-29 05:42:57,005 INFO L895 garLoopResultBuilder]: At program point L5197(line 5197) the Hoare annotation is: (let ((.cse0 (= 2 ~ref_cnt~0)) (.cse1 (= ~ldv_state_variable_2~0 3)) (.cse2 (= ~ldv_state_variable_0~0 2)) (.cse3 (= ~ldv_retval_5~0 0))) (or (and .cse0 .cse1 (= ~ldv_state_variable_1~0 2) .cse2 .cse3) (and .cse1 .cse2 (= ~ref_cnt~0 1) (= ~ldv_state_variable_1~0 1) .cse3) (and .cse0 .cse1 (= ~ldv_state_variable_1~0 6) .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= 5 ~ldv_state_variable_1~0)) (and .cse0 .cse1 .cse2 (= ~ldv_state_variable_1~0 3) .cse3) (and (<= 2 ~ref_cnt~0) .cse1 (<= ~ref_cnt~0 2147483647) (= ~ldv_state_variable_1~0 0) .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_1~0 4)))) [2023-11-29 05:42:57,005 INFO L899 garLoopResultBuilder]: For program point L5197-1(line 5197) no Hoare annotation was computed. [2023-11-29 05:42:57,005 INFO L895 garLoopResultBuilder]: At program point L4999(line 4999) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse4 (= 2 ~ref_cnt~0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse3 (= 5 ~ldv_state_variable_1~0))) (or (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3) (and .cse4 (= ~ldv_state_variable_2~0 3) .cse0 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 (= ~ldv_state_variable_2~0 2) .cse3))) [2023-11-29 05:42:57,005 INFO L899 garLoopResultBuilder]: For program point L4999-1(line 4999) no Hoare annotation was computed. [2023-11-29 05:42:57,005 INFO L899 garLoopResultBuilder]: For program point L5199(line 5199) no Hoare annotation was computed. [2023-11-29 05:42:57,005 INFO L899 garLoopResultBuilder]: For program point L5199-1(line 5199) no Hoare annotation was computed. [2023-11-29 05:42:57,005 INFO L899 garLoopResultBuilder]: For program point L4208(lines 4208 4211) no Hoare annotation was computed. [2023-11-29 05:42:57,005 INFO L895 garLoopResultBuilder]: At program point L5067(line 5067) the Hoare annotation is: (let ((.cse0 (= 2 ~ref_cnt~0)) (.cse1 (= ~ldv_state_variable_1~0 6)) (.cse2 (= ~ldv_state_variable_0~0 2)) (.cse4 (= ~ref_cnt~0 1)) (.cse3 (= ~ldv_retval_5~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and .cse0 (= ~ldv_state_variable_2~0 3) .cse1 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse1 .cse2 .cse4 .cse3) (and .cse1 (= ~ldv_state_variable_2~0 0) .cse2 .cse4 .cse3))) [2023-11-29 05:42:57,005 INFO L899 garLoopResultBuilder]: For program point L5067-1(line 5067) no Hoare annotation was computed. [2023-11-29 05:42:57,005 INFO L899 garLoopResultBuilder]: For program point L4935(lines 4919 5255) no Hoare annotation was computed. [2023-11-29 05:42:57,005 INFO L895 garLoopResultBuilder]: At program point L4803(line 4803) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,005 INFO L899 garLoopResultBuilder]: For program point main_ldv_final#1(lines 4919 5255) no Hoare annotation was computed. [2023-11-29 05:42:57,006 INFO L899 garLoopResultBuilder]: For program point L4144(lines 4144 4147) no Hoare annotation was computed. [2023-11-29 05:42:57,006 INFO L899 garLoopResultBuilder]: For program point L4937(lines 4937 5248) no Hoare annotation was computed. [2023-11-29 05:42:57,006 INFO L899 garLoopResultBuilder]: For program point L4938(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,006 INFO L899 garLoopResultBuilder]: For program point L4938-3(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,006 INFO L899 garLoopResultBuilder]: For program point L4938-1(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,006 INFO L899 garLoopResultBuilder]: For program point L4938-2(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,006 INFO L899 garLoopResultBuilder]: For program point L4938-8(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,006 INFO L899 garLoopResultBuilder]: For program point L4938-5(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,006 INFO L899 garLoopResultBuilder]: For program point L4938-9(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,006 INFO L899 garLoopResultBuilder]: For program point L4938-10(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,006 INFO L899 garLoopResultBuilder]: For program point L4938-15(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,006 INFO L899 garLoopResultBuilder]: For program point L4938-16(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,006 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 5061) no Hoare annotation was computed. [2023-11-29 05:42:57,007 INFO L899 garLoopResultBuilder]: For program point L4938-14(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,007 INFO L899 garLoopResultBuilder]: For program point L4938-20(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,007 INFO L899 garLoopResultBuilder]: For program point L4938-23(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,007 INFO L895 garLoopResultBuilder]: At program point L5203(line 5203) the Hoare annotation is: (let ((.cse3 (= 2 ~ref_cnt~0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse1 (= ~ldv_retval_5~0 0)) (.cse2 (= ~ldv_state_variable_2~0 2))) (or (and .cse0 (= ~ref_cnt~0 1) (= ~ldv_state_variable_1~0 1) .cse1 .cse2) (and .cse3 (= ~ldv_state_variable_1~0 6) .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1 (= ~ldv_state_variable_1~0 4) .cse2) (and .cse3 (= ~ldv_state_variable_1~0 2) .cse0 .cse1 .cse2) (and .cse3 .cse0 (= ~ldv_state_variable_1~0 3) .cse1 .cse2) (and (<= 2 ~ref_cnt~0) (<= ~ref_cnt~0 2147483647) (= ~ldv_state_variable_1~0 0) .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1 .cse2 (= 5 ~ldv_state_variable_1~0)))) [2023-11-29 05:42:57,007 INFO L899 garLoopResultBuilder]: For program point L5203-1(line 5203) no Hoare annotation was computed. [2023-11-29 05:42:57,007 INFO L899 garLoopResultBuilder]: For program point L4938-21(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,007 INFO L899 garLoopResultBuilder]: For program point L4212(lines 4212 4215) no Hoare annotation was computed. [2023-11-29 05:42:57,007 INFO L899 garLoopResultBuilder]: For program point L4938-27(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,007 INFO L899 garLoopResultBuilder]: For program point L4938-28(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,007 INFO L899 garLoopResultBuilder]: For program point L4938-26(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,008 INFO L899 garLoopResultBuilder]: For program point L4938-31(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,008 INFO L899 garLoopResultBuilder]: For program point L4938-32(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,008 INFO L899 garLoopResultBuilder]: For program point qcprobe_returnLabel#1(lines 4698 4832) no Hoare annotation was computed. [2023-11-29 05:42:57,008 INFO L899 garLoopResultBuilder]: For program point L4938-36(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,008 INFO L899 garLoopResultBuilder]: For program point L4741-3(line 4741) no Hoare annotation was computed. [2023-11-29 05:42:57,008 INFO L899 garLoopResultBuilder]: For program point L4741(line 4741) no Hoare annotation was computed. [2023-11-29 05:42:57,008 INFO L899 garLoopResultBuilder]: For program point L4938-37(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,008 INFO L899 garLoopResultBuilder]: For program point L4741-1(line 4741) no Hoare annotation was computed. [2023-11-29 05:42:57,008 INFO L899 garLoopResultBuilder]: For program point L4938-38(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,008 INFO L899 garLoopResultBuilder]: For program point L4741-6(line 4741) no Hoare annotation was computed. [2023-11-29 05:42:57,008 INFO L899 garLoopResultBuilder]: For program point L4741-7(line 4741) no Hoare annotation was computed. [2023-11-29 05:42:57,008 INFO L899 garLoopResultBuilder]: For program point L4741-4(line 4741) no Hoare annotation was computed. [2023-11-29 05:42:57,008 INFO L899 garLoopResultBuilder]: For program point L4938-41(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,009 INFO L899 garLoopResultBuilder]: For program point L4741-5(line 4741) no Hoare annotation was computed. [2023-11-29 05:42:57,009 INFO L899 garLoopResultBuilder]: For program point L4938-42(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,009 INFO L899 garLoopResultBuilder]: For program point L4741-10(line 4741) no Hoare annotation was computed. [2023-11-29 05:42:57,009 INFO L899 garLoopResultBuilder]: For program point L4938-47(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,009 INFO L899 garLoopResultBuilder]: For program point L4741-11(line 4741) no Hoare annotation was computed. [2023-11-29 05:42:57,009 INFO L899 garLoopResultBuilder]: For program point L4741-8(line 4741) no Hoare annotation was computed. [2023-11-29 05:42:57,009 INFO L899 garLoopResultBuilder]: For program point L4938-46(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,009 INFO L899 garLoopResultBuilder]: For program point L4938-51(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,009 INFO L899 garLoopResultBuilder]: For program point L4741-12(line 4741) no Hoare annotation was computed. [2023-11-29 05:42:57,009 INFO L899 garLoopResultBuilder]: For program point L4938-49(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,009 INFO L899 garLoopResultBuilder]: For program point L4741-13(lines 4740 4828) no Hoare annotation was computed. [2023-11-29 05:42:57,009 INFO L899 garLoopResultBuilder]: For program point L4938-55(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,010 INFO L902 garLoopResultBuilder]: At program point L5138(line 5138) the Hoare annotation is: true [2023-11-29 05:42:57,010 INFO L899 garLoopResultBuilder]: For program point L4938-53(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,010 INFO L899 garLoopResultBuilder]: For program point L5072-1(line 5072) no Hoare annotation was computed. [2023-11-29 05:42:57,010 INFO L899 garLoopResultBuilder]: For program point L4938-60(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,010 INFO L899 garLoopResultBuilder]: For program point L4938-57(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,010 INFO L895 garLoopResultBuilder]: At program point L5072(line 5072) the Hoare annotation is: (let ((.cse4 (= ~ref_cnt~0 1)) (.cse0 (= 2 ~ref_cnt~0)) (.cse1 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse3 (= ~ldv_state_variable_1~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and (= ~ldv_state_variable_2~0 0) .cse1 .cse4 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse1 .cse4 .cse2 .cse3) (and .cse0 (= ~ldv_state_variable_2~0 3) .cse1 .cse2 .cse3))) [2023-11-29 05:42:57,010 INFO L899 garLoopResultBuilder]: For program point L4938-64(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,010 INFO L899 garLoopResultBuilder]: For program point L4938-61(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,010 INFO L899 garLoopResultBuilder]: For program point L4938-67(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,010 INFO L899 garLoopResultBuilder]: For program point L4938-65(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,010 INFO L899 garLoopResultBuilder]: For program point L4938-71(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,011 INFO L899 garLoopResultBuilder]: For program point L4938-69(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,011 INFO L899 garLoopResultBuilder]: For program point L4938-75(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,011 INFO L899 garLoopResultBuilder]: For program point L4938-74(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,011 INFO L899 garLoopResultBuilder]: For program point L4938-79(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,011 INFO L899 garLoopResultBuilder]: For program point L4938-77(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,011 INFO L899 garLoopResultBuilder]: For program point L4938-83(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,011 INFO L899 garLoopResultBuilder]: For program point L4938-81(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,011 INFO L899 garLoopResultBuilder]: For program point L4148(lines 4148 4151) no Hoare annotation was computed. [2023-11-29 05:42:57,011 INFO L899 garLoopResultBuilder]: For program point L4938-88(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,011 INFO L899 garLoopResultBuilder]: For program point L4938-85(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,011 INFO L899 garLoopResultBuilder]: For program point L5205(line 5205) no Hoare annotation was computed. [2023-11-29 05:42:57,011 INFO L899 garLoopResultBuilder]: For program point L5205-1(line 5205) no Hoare annotation was computed. [2023-11-29 05:42:57,012 INFO L899 garLoopResultBuilder]: For program point L4938-89(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,012 INFO L899 garLoopResultBuilder]: For program point kmalloc_slab_returnLabel#1(lines 4239 4252) no Hoare annotation was computed. [2023-11-29 05:42:57,012 INFO L899 garLoopResultBuilder]: For program point L4938-90(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,012 INFO L899 garLoopResultBuilder]: For program point L4938-93(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,012 INFO L899 garLoopResultBuilder]: For program point L4941(lines 4937 5248) no Hoare annotation was computed. [2023-11-29 05:42:57,012 INFO L899 garLoopResultBuilder]: For program point L4938-94(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,012 INFO L899 garLoopResultBuilder]: For program point L4938-98(line 4938) no Hoare annotation was computed. [2023-11-29 05:42:57,012 INFO L895 garLoopResultBuilder]: At program point L4810(line 4810) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,012 INFO L899 garLoopResultBuilder]: For program point L4810-1(line 4810) no Hoare annotation was computed. [2023-11-29 05:42:57,012 INFO L899 garLoopResultBuilder]: For program point L4216(lines 4216 4219) no Hoare annotation was computed. [2023-11-29 05:42:57,012 INFO L895 garLoopResultBuilder]: At program point L5009(line 5009) the Hoare annotation is: (let ((.cse4 (= ~ref_cnt~0 1)) (.cse0 (= 2 ~ref_cnt~0)) (.cse1 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse3 (= ~ldv_state_variable_1~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and (= ~ldv_state_variable_2~0 0) .cse1 .cse4 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse1 .cse4 .cse2 .cse3) (and .cse0 (= ~ldv_state_variable_2~0 3) .cse1 .cse2 .cse3))) [2023-11-29 05:42:57,013 INFO L899 garLoopResultBuilder]: For program point L5009-1(line 5009) no Hoare annotation was computed. [2023-11-29 05:42:57,013 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 5199) no Hoare annotation was computed. [2023-11-29 05:42:57,013 INFO L899 garLoopResultBuilder]: For program point L4944-1(lines 4944 4945) no Hoare annotation was computed. [2023-11-29 05:42:57,013 INFO L895 garLoopResultBuilder]: At program point L4944(lines 4944 4945) the Hoare annotation is: (let ((.cse0 (= 2 ~ref_cnt~0)) (.cse1 (= ~ldv_state_variable_1~0 6)) (.cse2 (= ~ldv_state_variable_0~0 2)) (.cse4 (= ~ref_cnt~0 1)) (.cse3 (= ~ldv_retval_5~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and .cse0 (= ~ldv_state_variable_2~0 3) .cse1 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse1 .cse2 .cse4 .cse3) (and .cse1 (= ~ldv_state_variable_2~0 0) .cse2 .cse4 .cse3))) [2023-11-29 05:42:57,013 INFO L899 garLoopResultBuilder]: For program point L4152(lines 4152 4155) no Hoare annotation was computed. [2023-11-29 05:42:57,013 INFO L895 garLoopResultBuilder]: At program point L5077(line 5077) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse4 (= 2 ~ref_cnt~0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_state_variable_1~0 3)) (.cse3 (= ~ldv_retval_5~0 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and .cse4 (= ~ldv_state_variable_2~0 3) .cse0 .cse2 .cse3))) [2023-11-29 05:42:57,013 INFO L899 garLoopResultBuilder]: For program point L5077-1(line 5077) no Hoare annotation was computed. [2023-11-29 05:42:57,013 INFO L895 garLoopResultBuilder]: At program point L4813(line 4813) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,013 INFO L899 garLoopResultBuilder]: For program point L4813-1(line 4813) no Hoare annotation was computed. [2023-11-29 05:42:57,013 INFO L899 garLoopResultBuilder]: For program point L4285-2(lines 4285 4305) no Hoare annotation was computed. [2023-11-29 05:42:57,014 INFO L899 garLoopResultBuilder]: For program point L4285(lines 4285 4305) no Hoare annotation was computed. [2023-11-29 05:42:57,014 INFO L899 garLoopResultBuilder]: For program point L5144-1(line 5144) no Hoare annotation was computed. [2023-11-29 05:42:57,014 INFO L899 garLoopResultBuilder]: For program point L5144-2(line 5144) no Hoare annotation was computed. [2023-11-29 05:42:57,014 INFO L899 garLoopResultBuilder]: For program point L5144(line 5144) no Hoare annotation was computed. [2023-11-29 05:42:57,014 INFO L899 garLoopResultBuilder]: For program point L5144-5(line 5144) no Hoare annotation was computed. [2023-11-29 05:42:57,014 INFO L899 garLoopResultBuilder]: For program point L5144-6(line 5144) no Hoare annotation was computed. [2023-11-29 05:42:57,014 INFO L899 garLoopResultBuilder]: For program point L5144-3(line 5144) no Hoare annotation was computed. [2023-11-29 05:42:57,014 INFO L899 garLoopResultBuilder]: For program point L5144-4(line 5144) no Hoare annotation was computed. [2023-11-29 05:42:57,014 INFO L899 garLoopResultBuilder]: For program point L5144-7(line 5144) no Hoare annotation was computed. [2023-11-29 05:42:57,014 INFO L899 garLoopResultBuilder]: For program point L5144-11(line 5144) no Hoare annotation was computed. [2023-11-29 05:42:57,014 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:42:57,014 INFO L899 garLoopResultBuilder]: For program point L4286(lines 4286 4290) no Hoare annotation was computed. [2023-11-29 05:42:57,014 INFO L899 garLoopResultBuilder]: For program point L4220(lines 4220 4223) no Hoare annotation was computed. [2023-11-29 05:42:57,015 INFO L895 garLoopResultBuilder]: At program point L4815(lines 4815 4816) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_state_variable_1~0 1)) (.cse3 (= ~ldv_retval_5~0 0)) (.cse4 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_2~0 3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 1) .cse0 .cse2 .cse3 .cse4))) [2023-11-29 05:42:57,015 INFO L899 garLoopResultBuilder]: For program point L4815-1(lines 4815 4816) no Hoare annotation was computed. [2023-11-29 05:42:57,015 INFO L899 garLoopResultBuilder]: For program point L4156(lines 4156 4159) no Hoare annotation was computed. [2023-11-29 05:42:57,015 INFO L899 garLoopResultBuilder]: For program point L5147(lines 4937 5248) no Hoare annotation was computed. [2023-11-29 05:42:57,015 INFO L895 garLoopResultBuilder]: At program point L5082(line 5082) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse4 (= 2 ~ref_cnt~0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse3 (= 5 ~ldv_state_variable_1~0))) (or (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3) (and .cse4 (= ~ldv_state_variable_2~0 3) .cse0 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 (= ~ldv_state_variable_2~0 2) .cse3))) [2023-11-29 05:42:57,015 INFO L895 garLoopResultBuilder]: At program point L4950(lines 4950 4951) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse4 (= 2 ~ref_cnt~0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse3 (= 5 ~ldv_state_variable_1~0))) (or (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3) (and .cse4 (= ~ldv_state_variable_2~0 3) .cse0 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 (= ~ldv_state_variable_2~0 2) .cse3))) [2023-11-29 05:42:57,015 INFO L899 garLoopResultBuilder]: For program point L5082-1(line 5082) no Hoare annotation was computed. [2023-11-29 05:42:57,015 INFO L899 garLoopResultBuilder]: For program point L4950-1(lines 4950 4951) no Hoare annotation was computed. [2023-11-29 05:42:57,015 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 4042) no Hoare annotation was computed. [2023-11-29 05:42:57,016 INFO L899 garLoopResultBuilder]: For program point L4224(lines 4224 4227) no Hoare annotation was computed. [2023-11-29 05:42:57,016 INFO L895 garLoopResultBuilder]: At program point L5017(line 5017) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse4 (= 2 ~ref_cnt~0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_state_variable_1~0 3)) (.cse3 (= ~ldv_retval_5~0 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and .cse4 (= ~ldv_state_variable_2~0 3) .cse0 .cse2 .cse3))) [2023-11-29 05:42:57,016 INFO L899 garLoopResultBuilder]: For program point L5017-1(line 5017) no Hoare annotation was computed. [2023-11-29 05:42:57,016 INFO L895 garLoopResultBuilder]: At program point L4885(line 4885) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 2)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse3 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3))) [2023-11-29 05:42:57,016 INFO L899 garLoopResultBuilder]: For program point L4885-1(line 4885) no Hoare annotation was computed. [2023-11-29 05:42:57,016 INFO L899 garLoopResultBuilder]: For program point L4291(lines 4291 4303) no Hoare annotation was computed. [2023-11-29 05:42:57,016 INFO L899 garLoopResultBuilder]: For program point L4160(lines 4160 4163) no Hoare annotation was computed. [2023-11-29 05:42:57,016 INFO L895 garLoopResultBuilder]: At program point L4887(line 4887) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 2)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse3 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3))) [2023-11-29 05:42:57,016 INFO L899 garLoopResultBuilder]: For program point L4887-1(line 4887) no Hoare annotation was computed. [2023-11-29 05:42:57,016 INFO L895 garLoopResultBuilder]: At program point L4755(line 4755) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,016 INFO L899 garLoopResultBuilder]: For program point L4755-1(line 4755) no Hoare annotation was computed. [2023-11-29 05:42:57,016 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 5205) no Hoare annotation was computed. [2023-11-29 05:42:57,017 INFO L899 garLoopResultBuilder]: For program point L4294(lines 4294 4297) no Hoare annotation was computed. [2023-11-29 05:42:57,017 INFO L899 garLoopResultBuilder]: For program point L4228(lines 4228 4231) no Hoare annotation was computed. [2023-11-29 05:42:57,017 INFO L899 garLoopResultBuilder]: For program point L4823(line 4823) no Hoare annotation was computed. [2023-11-29 05:42:57,017 INFO L895 garLoopResultBuilder]: At program point L4889(line 4889) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 2)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse3 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3))) [2023-11-29 05:42:57,017 INFO L899 garLoopResultBuilder]: For program point L4889-1(line 4889) no Hoare annotation was computed. [2023-11-29 05:42:57,017 INFO L899 garLoopResultBuilder]: For program point L4824-1(lines 4824 4825) no Hoare annotation was computed. [2023-11-29 05:42:57,017 INFO L895 garLoopResultBuilder]: At program point L4824(lines 4824 4825) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,017 INFO L899 garLoopResultBuilder]: For program point L4164(lines 4164 4167) no Hoare annotation was computed. [2023-11-29 05:42:57,017 INFO L895 garLoopResultBuilder]: At program point L5089(line 5089) the Hoare annotation is: (let ((.cse0 (= 2 ~ref_cnt~0)) (.cse1 (= ~ldv_state_variable_1~0 6)) (.cse2 (= ~ldv_state_variable_0~0 2)) (.cse4 (= ~ref_cnt~0 1)) (.cse3 (= ~ldv_retval_5~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and .cse0 (= ~ldv_state_variable_2~0 3) .cse1 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse1 .cse2 .cse4 .cse3) (and .cse1 (= ~ldv_state_variable_2~0 0) .cse2 .cse4 .cse3))) [2023-11-29 05:42:57,017 INFO L899 garLoopResultBuilder]: For program point L5089-1(line 5089) no Hoare annotation was computed. [2023-11-29 05:42:57,018 INFO L895 garLoopResultBuilder]: At program point L4826(line 4826) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,018 INFO L899 garLoopResultBuilder]: For program point L4826-1(line 4826) no Hoare annotation was computed. [2023-11-29 05:42:57,018 INFO L899 garLoopResultBuilder]: For program point L4232(lines 4232 4235) no Hoare annotation was computed. [2023-11-29 05:42:57,018 INFO L895 garLoopResultBuilder]: At program point L4299(lines 4299 4300) the Hoare annotation is: false [2023-11-29 05:42:57,018 INFO L899 garLoopResultBuilder]: For program point L4299-1(lines 4299 4300) no Hoare annotation was computed. [2023-11-29 05:42:57,018 INFO L895 garLoopResultBuilder]: At program point L4762(line 4762) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,018 INFO L899 garLoopResultBuilder]: For program point L4762-1(line 4762) no Hoare annotation was computed. [2023-11-29 05:42:57,018 INFO L899 garLoopResultBuilder]: For program point L4168(lines 4168 4171) no Hoare annotation was computed. [2023-11-29 05:42:57,018 INFO L895 garLoopResultBuilder]: At program point L5027(line 5027) the Hoare annotation is: (let ((.cse0 (= 2 ~ref_cnt~0)) (.cse1 (= ~ldv_state_variable_1~0 6)) (.cse2 (= ~ldv_state_variable_0~0 2)) (.cse4 (= ~ref_cnt~0 1)) (.cse3 (= ~ldv_retval_5~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and .cse0 (= ~ldv_state_variable_2~0 3) .cse1 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse1 .cse2 .cse4 .cse3) (and .cse1 (= ~ldv_state_variable_2~0 0) .cse2 .cse4 .cse3))) [2023-11-29 05:42:57,018 INFO L899 garLoopResultBuilder]: For program point L5027-1(line 5027) no Hoare annotation was computed. [2023-11-29 05:42:57,018 INFO L899 garLoopResultBuilder]: For program point L4961(line 4961) no Hoare annotation was computed. [2023-11-29 05:42:57,018 INFO L899 garLoopResultBuilder]: For program point L4961-1(line 4961) no Hoare annotation was computed. [2023-11-29 05:42:57,018 INFO L899 garLoopResultBuilder]: For program point L4829(lines 4709 4831) no Hoare annotation was computed. [2023-11-29 05:42:57,018 INFO L895 garLoopResultBuilder]: At program point L5094(line 5094) the Hoare annotation is: (let ((.cse4 (= ~ref_cnt~0 1)) (.cse0 (= 2 ~ref_cnt~0)) (.cse1 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse3 (= ~ldv_state_variable_1~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and (= ~ldv_state_variable_2~0 0) .cse1 .cse4 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse1 .cse4 .cse2 .cse3) (and .cse0 (= ~ldv_state_variable_2~0 3) .cse1 .cse2 .cse3))) [2023-11-29 05:42:57,019 INFO L899 garLoopResultBuilder]: For program point L5094-1(line 5094) no Hoare annotation was computed. [2023-11-29 05:42:57,019 INFO L899 garLoopResultBuilder]: For program point L4764-1(lines 4764 4765) no Hoare annotation was computed. [2023-11-29 05:42:57,019 INFO L895 garLoopResultBuilder]: At program point L4764(lines 4764 4765) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_state_variable_1~0 1)) (.cse3 (= ~ldv_retval_5~0 0)) (.cse4 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_2~0 3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 1) .cse0 .cse2 .cse3 .cse4))) [2023-11-29 05:42:57,019 INFO L895 garLoopResultBuilder]: At program point L4898(line 4898) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~ldv_retval_5~0 0) (= ~ref_cnt~0 0)) [2023-11-29 05:42:57,019 INFO L899 garLoopResultBuilder]: For program point L4898-1(line 4898) no Hoare annotation was computed. [2023-11-29 05:42:57,019 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 4961) no Hoare annotation was computed. [2023-11-29 05:42:57,019 INFO L899 garLoopResultBuilder]: For program point L4172(lines 4172 4175) no Hoare annotation was computed. [2023-11-29 05:42:57,019 INFO L899 garLoopResultBuilder]: For program point L4040(lines 4037 4048) no Hoare annotation was computed. [2023-11-29 05:42:57,019 INFO L895 garLoopResultBuilder]: At program point L4767(line 4767) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,019 INFO L899 garLoopResultBuilder]: For program point L5032-1(line 5032) no Hoare annotation was computed. [2023-11-29 05:42:57,019 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 5189) no Hoare annotation was computed. [2023-11-29 05:42:57,019 INFO L895 garLoopResultBuilder]: At program point L5032(line 5032) the Hoare annotation is: (let ((.cse4 (= ~ref_cnt~0 1)) (.cse0 (= 2 ~ref_cnt~0)) (.cse1 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse3 (= ~ldv_state_variable_1~0 4))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and (= ~ldv_state_variable_2~0 0) .cse1 .cse4 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse1 .cse4 .cse2 .cse3) (and .cse0 (= ~ldv_state_variable_2~0 3) .cse1 .cse2 .cse3))) [2023-11-29 05:42:57,019 INFO L895 garLoopResultBuilder]: At program point L5099(line 5099) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_state_variable_1~0 1)) (.cse3 (= ~ldv_retval_5~0 0)) (.cse4 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_2~0 3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 1) .cse0 .cse2 .cse3 .cse4))) [2023-11-29 05:42:57,019 INFO L899 garLoopResultBuilder]: For program point kmalloc_index_returnLabel#1(lines 4141 4238) no Hoare annotation was computed. [2023-11-29 05:42:57,020 INFO L899 garLoopResultBuilder]: For program point L5099-1(line 5099) no Hoare annotation was computed. [2023-11-29 05:42:57,020 INFO L899 garLoopResultBuilder]: For program point L4042(line 4042) no Hoare annotation was computed. [2023-11-29 05:42:57,020 INFO L899 garLoopResultBuilder]: For program point L4042-1(line 4042) no Hoare annotation was computed. [2023-11-29 05:42:57,020 INFO L899 garLoopResultBuilder]: For program point L4043(lines 4043 4046) no Hoare annotation was computed. [2023-11-29 05:42:57,020 INFO L899 garLoopResultBuilder]: For program point L4440-1(line 4440) no Hoare annotation was computed. [2023-11-29 05:42:57,020 INFO L895 garLoopResultBuilder]: At program point L4440(line 4440) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,020 INFO L899 garLoopResultBuilder]: For program point L4176(lines 4176 4179) no Hoare annotation was computed. [2023-11-29 05:42:57,020 INFO L899 garLoopResultBuilder]: For program point L4441(lines 4441 4450) no Hoare annotation was computed. [2023-11-29 05:42:57,020 INFO L899 garLoopResultBuilder]: For program point L4441-1(lines 4441 4450) no Hoare annotation was computed. [2023-11-29 05:42:57,020 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 5061) no Hoare annotation was computed. [2023-11-29 05:42:57,020 INFO L895 garLoopResultBuilder]: At program point L5301(line 5301) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_5~0 0) (= ~ref_cnt~0 0)) [2023-11-29 05:42:57,020 INFO L899 garLoopResultBuilder]: For program point L5301-1(line 5301) no Hoare annotation was computed. [2023-11-29 05:42:57,020 INFO L895 garLoopResultBuilder]: At program point L5037(line 5037) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_state_variable_1~0 1)) (.cse3 (= ~ldv_retval_5~0 0)) (.cse4 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_2~0 3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 1) .cse0 .cse2 .cse3 .cse4))) [2023-11-29 05:42:57,020 INFO L899 garLoopResultBuilder]: For program point L5037-1(line 5037) no Hoare annotation was computed. [2023-11-29 05:42:57,021 INFO L899 garLoopResultBuilder]: For program point L4443(lines 4443 4447) no Hoare annotation was computed. [2023-11-29 05:42:57,021 INFO L899 garLoopResultBuilder]: For program point L5302(lines 5302 5305) no Hoare annotation was computed. [2023-11-29 05:42:57,021 INFO L899 garLoopResultBuilder]: For program point L5104-1(line 5104) no Hoare annotation was computed. [2023-11-29 05:42:57,021 INFO L895 garLoopResultBuilder]: At program point L5104(line 5104) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse4 (= 2 ~ref_cnt~0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_state_variable_1~0 3)) (.cse3 (= ~ldv_retval_5~0 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and .cse4 (= ~ldv_state_variable_2~0 3) .cse0 .cse2 .cse3))) [2023-11-29 05:42:57,021 INFO L899 garLoopResultBuilder]: For program point L4246(lines 4246 4249) no Hoare annotation was computed. [2023-11-29 05:42:57,021 INFO L899 garLoopResultBuilder]: For program point L4180(lines 4180 4183) no Hoare annotation was computed. [2023-11-29 05:42:57,021 INFO L899 garLoopResultBuilder]: For program point L5304-1(lines 5298 5308) no Hoare annotation was computed. [2023-11-29 05:42:57,021 INFO L895 garLoopResultBuilder]: At program point L5304(line 5304) the Hoare annotation is: (= ~ldv_state_variable_2~0 0) [2023-11-29 05:42:57,021 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 5199) no Hoare annotation was computed. [2023-11-29 05:42:57,021 INFO L899 garLoopResultBuilder]: For program point L4315(line 4315) no Hoare annotation was computed. [2023-11-29 05:42:57,021 INFO L899 garLoopResultBuilder]: For program point L4315-4(line 4315) no Hoare annotation was computed. [2023-11-29 05:42:57,021 INFO L902 garLoopResultBuilder]: At program point L5174(line 5174) the Hoare annotation is: true [2023-11-29 05:42:57,021 INFO L899 garLoopResultBuilder]: For program point L4315-2(line 4315) no Hoare annotation was computed. [2023-11-29 05:42:57,021 INFO L902 garLoopResultBuilder]: At program point L5240(line 5240) the Hoare annotation is: true [2023-11-29 05:42:57,021 INFO L895 garLoopResultBuilder]: At program point L5042(line 5042) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse4 (= 2 ~ref_cnt~0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_state_variable_1~0 3)) (.cse3 (= ~ldv_retval_5~0 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and .cse4 (= ~ldv_state_variable_2~0 3) .cse0 .cse2 .cse3))) [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L5042-1(line 5042) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4778(line 4778) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4712-2(lines 4712 4716) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4712(lines 4712 4716) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4778-2(line 4778) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4184(lines 4184 4187) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L895 garLoopResultBuilder]: At program point L5109(line 5109) the Hoare annotation is: (let ((.cse0 (= 2 ~ref_cnt~0)) (.cse1 (= ~ldv_state_variable_1~0 2)) (.cse2 (= ~ldv_state_variable_0~0 2)) (.cse4 (= ~ref_cnt~0 1)) (.cse3 (= ~ldv_retval_5~0 0))) (or (and .cse0 (= ~ldv_state_variable_2~0 3) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and (= ~ldv_state_variable_2~0 0) .cse1 .cse2 .cse4 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse1 .cse2 .cse4 .cse3))) [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L5109-1(line 5109) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4779(line 4779) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4779-1(line 4779) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4845(lines 4845 4848) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4779-4(line 4779) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4779-5(line 4779) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L895 garLoopResultBuilder]: At program point L4713(lines 4713 4714) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4779-2(line 4779) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4713-1(lines 4713 4714) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4779-8(line 4779) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4779-9(line 4779) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4779-12(line 4779) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4779-13(lines 4740 4828) no Hoare annotation was computed. [2023-11-29 05:42:57,022 INFO L899 garLoopResultBuilder]: For program point L4779-11(line 4779) no Hoare annotation was computed. [2023-11-29 05:42:57,023 INFO L899 garLoopResultBuilder]: For program point L4779-17(line 4779) no Hoare annotation was computed. [2023-11-29 05:42:57,023 INFO L899 garLoopResultBuilder]: For program point L4779-14(line 4779) no Hoare annotation was computed. [2023-11-29 05:42:57,023 INFO L899 garLoopResultBuilder]: For program point L4779-15(line 4779) no Hoare annotation was computed. [2023-11-29 05:42:57,023 INFO L899 garLoopResultBuilder]: For program point L4779-18(line 4779) no Hoare annotation was computed. [2023-11-29 05:42:57,023 INFO L895 garLoopResultBuilder]: At program point L4979(line 4979) the Hoare annotation is: (let ((.cse0 (= 2 ~ref_cnt~0)) (.cse1 (= ~ldv_state_variable_1~0 6)) (.cse2 (= ~ldv_state_variable_0~0 2)) (.cse4 (= ~ref_cnt~0 1)) (.cse3 (= ~ldv_retval_5~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and .cse0 (= ~ldv_state_variable_2~0 3) .cse1 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse1 .cse2 .cse4 .cse3) (and .cse1 (= ~ldv_state_variable_2~0 0) .cse2 .cse4 .cse3))) [2023-11-29 05:42:57,023 INFO L899 garLoopResultBuilder]: For program point L4979-1(line 4979) no Hoare annotation was computed. [2023-11-29 05:42:57,023 INFO L895 garLoopResultBuilder]: At program point L4782(line 4782) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,023 INFO L899 garLoopResultBuilder]: For program point L4782-1(line 4782) no Hoare annotation was computed. [2023-11-29 05:42:57,023 INFO L899 garLoopResultBuilder]: For program point L4188(lines 4188 4191) no Hoare annotation was computed. [2023-11-29 05:42:57,023 INFO L895 garLoopResultBuilder]: At program point L5047(line 5047) the Hoare annotation is: (let ((.cse0 (= 2 ~ref_cnt~0)) (.cse1 (= ~ldv_state_variable_1~0 2)) (.cse2 (= ~ldv_state_variable_0~0 2)) (.cse4 (= ~ref_cnt~0 1)) (.cse3 (= ~ldv_retval_5~0 0))) (or (and .cse0 (= ~ldv_state_variable_2~0 3) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and (= ~ldv_state_variable_2~0 0) .cse1 .cse2 .cse4 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse1 .cse2 .cse4 .cse3))) [2023-11-29 05:42:57,023 INFO L899 garLoopResultBuilder]: For program point L5047-1(line 5047) no Hoare annotation was computed. [2023-11-29 05:42:57,023 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 5189) no Hoare annotation was computed. [2023-11-29 05:42:57,023 INFO L899 garLoopResultBuilder]: For program point L5246(line 5246) no Hoare annotation was computed. [2023-11-29 05:42:57,023 INFO L899 garLoopResultBuilder]: For program point L5180-1(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,023 INFO L895 garLoopResultBuilder]: At program point L5114(line 5114) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse4 (= 2 ~ref_cnt~0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse3 (= 5 ~ldv_state_variable_1~0))) (or (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3) (and .cse4 (= ~ldv_state_variable_2~0 3) .cse0 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 (= ~ldv_state_variable_2~0 2) .cse3))) [2023-11-29 05:42:57,023 INFO L899 garLoopResultBuilder]: For program point L5180-2(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,023 INFO L899 garLoopResultBuilder]: For program point L5180(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,023 INFO L899 garLoopResultBuilder]: For program point L5114-1(line 5114) no Hoare annotation was computed. [2023-11-29 05:42:57,023 INFO L899 garLoopResultBuilder]: For program point L5180-3(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L5180-4(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L5180-9(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L4850(lines 4850 4854) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L5180-8(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L4718(lines 4718 4722) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L5180-14(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L5180-11(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L5180-15(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L4718-2(lines 4718 4722) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L5180-16(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L5180-21(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L5180-22(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L5180-20(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L5180-26(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L4256-1(line 4256) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L902 garLoopResultBuilder]: At program point L5247(line 5247) the Hoare annotation is: true [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 4042) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L5180-27(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L895 garLoopResultBuilder]: At program point L4256(line 4256) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L5180-28(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,024 INFO L899 garLoopResultBuilder]: For program point L5180-32(line 5180) no Hoare annotation was computed. [2023-11-29 05:42:57,025 INFO L895 garLoopResultBuilder]: At program point L4851(line 4851) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 1) (= ~ldv_retval_5~0 0) (= ~ref_cnt~0 0)) [2023-11-29 05:42:57,025 INFO L899 garLoopResultBuilder]: For program point L4851-1(line 4851) no Hoare annotation was computed. [2023-11-29 05:42:57,025 INFO L895 garLoopResultBuilder]: At program point L4719(lines 4719 4720) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,025 INFO L899 garLoopResultBuilder]: For program point L4719-1(lines 4719 4720) no Hoare annotation was computed. [2023-11-29 05:42:57,025 INFO L895 garLoopResultBuilder]: At program point L4785(line 4785) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,025 INFO L899 garLoopResultBuilder]: For program point L4785-1(line 4785) no Hoare annotation was computed. [2023-11-29 05:42:57,025 INFO L899 garLoopResultBuilder]: For program point L4984-1(line 4984) no Hoare annotation was computed. [2023-11-29 05:42:57,025 INFO L895 garLoopResultBuilder]: At program point L4984(line 4984) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse4 (= 2 ~ref_cnt~0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse3 (= 5 ~ldv_state_variable_1~0))) (or (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3) (and .cse4 (= ~ldv_state_variable_2~0 3) .cse0 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 (= ~ldv_state_variable_2~0 2) .cse3))) [2023-11-29 05:42:57,025 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:42:57,025 INFO L899 garLoopResultBuilder]: For program point L4192(lines 4192 4195) no Hoare annotation was computed. [2023-11-29 05:42:57,025 INFO L899 garLoopResultBuilder]: For program point L5183(lines 4937 5248) no Hoare annotation was computed. [2023-11-29 05:42:57,025 INFO L895 garLoopResultBuilder]: At program point L4787(lines 4787 4788) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_state_variable_1~0 1)) (.cse3 (= ~ldv_retval_5~0 0)) (.cse4 (= ~ref_cnt~0 0))) (or (and (= ~ldv_state_variable_2~0 3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 1) .cse0 .cse2 .cse3 .cse4))) [2023-11-29 05:42:57,025 INFO L899 garLoopResultBuilder]: For program point L4787-1(lines 4787 4788) no Hoare annotation was computed. [2023-11-29 05:42:57,025 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 5205) no Hoare annotation was computed. [2023-11-29 05:42:57,025 INFO L899 garLoopResultBuilder]: For program point L5052-1(line 5052) no Hoare annotation was computed. [2023-11-29 05:42:57,025 INFO L895 garLoopResultBuilder]: At program point L5052(line 5052) the Hoare annotation is: (let ((.cse1 (= ~ref_cnt~0 1)) (.cse4 (= 2 ~ref_cnt~0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse3 (= 5 ~ldv_state_variable_1~0))) (or (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3) (and .cse4 (= ~ldv_state_variable_2~0 3) .cse0 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 (= ~ldv_state_variable_2~0 2) .cse3))) [2023-11-29 05:42:57,025 INFO L899 garLoopResultBuilder]: For program point L4920-1(line 4920) no Hoare annotation was computed. [2023-11-29 05:42:57,026 INFO L895 garLoopResultBuilder]: At program point L4920(line 4920) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_5~0 0) (= ~ref_cnt~0 0)) [2023-11-29 05:42:57,026 INFO L895 garLoopResultBuilder]: At program point L4922(line 4922) the Hoare annotation is: (and (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_5~0 0) (= ~ref_cnt~0 0)) [2023-11-29 05:42:57,026 INFO L899 garLoopResultBuilder]: For program point L4922-1(line 4922) no Hoare annotation was computed. [2023-11-29 05:42:57,026 INFO L899 garLoopResultBuilder]: For program point L4724-2(lines 4724 4728) no Hoare annotation was computed. [2023-11-29 05:42:57,026 INFO L899 garLoopResultBuilder]: For program point L4724(lines 4724 4728) no Hoare annotation was computed. [2023-11-29 05:42:57,026 INFO L899 garLoopResultBuilder]: For program point L4460-1(line 4460) no Hoare annotation was computed. [2023-11-29 05:42:57,026 INFO L895 garLoopResultBuilder]: At program point L4460(line 4460) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,026 INFO L899 garLoopResultBuilder]: For program point L4196(lines 4196 4199) no Hoare annotation was computed. [2023-11-29 05:42:57,026 INFO L902 garLoopResultBuilder]: At program point L5253(line 5253) the Hoare annotation is: true [2023-11-29 05:42:57,026 INFO L899 garLoopResultBuilder]: For program point L5253-1(line 5253) no Hoare annotation was computed. [2023-11-29 05:42:57,026 INFO L895 garLoopResultBuilder]: At program point L5121(line 5121) the Hoare annotation is: (let ((.cse0 (= 2 ~ref_cnt~0)) (.cse1 (= ~ldv_state_variable_1~0 6)) (.cse2 (= ~ldv_state_variable_0~0 2)) (.cse4 (= ~ref_cnt~0 1)) (.cse3 (= ~ldv_retval_5~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_state_variable_2~0 2)) (and .cse0 (= ~ldv_state_variable_2~0 3) .cse1 .cse2 .cse3) (and (= ~ldv_state_variable_2~0 1) .cse1 .cse2 .cse4 .cse3) (and .cse1 (= ~ldv_state_variable_2~0 0) .cse2 .cse4 .cse3))) [2023-11-29 05:42:57,026 INFO L899 garLoopResultBuilder]: For program point L5121-1(line 5121) no Hoare annotation was computed. [2023-11-29 05:42:57,026 INFO L895 garLoopResultBuilder]: At program point L4725(lines 4725 4726) the Hoare annotation is: (let ((.cse3 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 2)) (.cse5 (= ~ref_cnt~0 1)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_retval_5~0 0)) (.cse4 (<= (+ |ULTIMATE.start_qcprobe_~retval~0#1| 19) 0))) (or (and (= ~ldv_state_variable_2~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~ldv_state_variable_2~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 (= ~ldv_state_variable_2~0 2) .cse4) (and (= ~ldv_state_variable_2~0 3) .cse0 .cse5 .cse1 .cse2 .cse4))) [2023-11-29 05:42:57,026 INFO L899 garLoopResultBuilder]: For program point L4725-1(lines 4725 4726) no Hoare annotation was computed. [2023-11-29 05:42:57,026 INFO L899 garLoopResultBuilder]: For program point L4461(lines 4461 4470) no Hoare annotation was computed. [2023-11-29 05:42:57,026 INFO L899 garLoopResultBuilder]: For program point L4461-1(lines 4461 4470) no Hoare annotation was computed. [2023-11-29 05:42:57,029 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:57,030 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:42:57,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:42:57 BoogieIcfgContainer [2023-11-29 05:42:57,039 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:42:57,039 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:42:57,039 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:42:57,039 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:42:57,040 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:34:27" (3/4) ... [2023-11-29 05:42:57,041 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 05:42:57,044 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2023-11-29 05:42:57,044 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure trace_kmalloc [2023-11-29 05:42:57,044 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printk [2023-11-29 05:42:57,044 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_wwan_disconnect [2023-11-29 05:42:57,044 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2023-11-29 05:42:57,044 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#5 [2023-11-29 05:42:57,044 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#4 [2023-11-29 05:42:57,044 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#7 [2023-11-29 05:42:57,044 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2023-11-29 05:42:57,044 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#6 [2023-11-29 05:42:57,044 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#1 [2023-11-29 05:42:57,044 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#0 [2023-11-29 05:42:57,044 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_serial_deregister [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#3 [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#2 [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#10 [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_wwan_open [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#9 [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#8 [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_interface [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_endpoint_xfer_bulk [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_serial_disconnect [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_wwan_write [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rcu_read_lock_sched_notrace [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#13 [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#12 [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_wwan_write_room [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset#11 [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_wwan_suspend [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_wwan_close [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop___0 [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_wwan_chars_in_buffer [2023-11-29 05:42:57,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_wwan_resume [2023-11-29 05:42:57,077 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 158 nodes and edges [2023-11-29 05:42:57,081 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2023-11-29 05:42:57,084 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-29 05:42:57,088 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 05:42:57,091 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 05:42:57,095 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 05:42:57,991 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:42:57,992 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 05:42:57,992 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:42:57,992 INFO L158 Benchmark]: Toolchain (without parser) took 514506.54ms. Allocated memory was 136.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 85.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 627.3MB. Max. memory is 16.1GB. [2023-11-29 05:42:57,993 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 136.3MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:42:57,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1225.76ms. Allocated memory was 136.3MB in the beginning and 203.4MB in the end (delta: 67.1MB). Free memory was 85.3MB in the beginning and 146.8MB in the end (delta: -61.5MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. [2023-11-29 05:42:57,993 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.13ms. Allocated memory is still 203.4MB. Free memory was 146.8MB in the beginning and 134.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 05:42:57,994 INFO L158 Benchmark]: Boogie Preprocessor took 187.34ms. Allocated memory is still 203.4MB. Free memory was 134.2MB in the beginning and 113.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 05:42:57,994 INFO L158 Benchmark]: RCFGBuilder took 2455.48ms. Allocated memory was 203.4MB in the beginning and 274.7MB in the end (delta: 71.3MB). Free memory was 113.3MB in the beginning and 195.5MB in the end (delta: -82.3MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2023-11-29 05:42:57,994 INFO L158 Benchmark]: TraceAbstraction took 509553.26ms. Allocated memory was 274.7MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 194.5MB in the beginning and 1.0GB in the end (delta: -813.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-29 05:42:57,994 INFO L158 Benchmark]: Witness Printer took 952.79ms. Allocated memory is still 1.5GB. Free memory was 1.0GB in the beginning and 1.3GB in the end (delta: -246.9MB). Peak memory consumption was 213.9MB. Max. memory is 16.1GB. [2023-11-29 05:42:57,996 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 136.3MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1225.76ms. Allocated memory was 136.3MB in the beginning and 203.4MB in the end (delta: 67.1MB). Free memory was 85.3MB in the beginning and 146.8MB in the end (delta: -61.5MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.13ms. Allocated memory is still 203.4MB. Free memory was 146.8MB in the beginning and 134.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 187.34ms. Allocated memory is still 203.4MB. Free memory was 134.2MB in the beginning and 113.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * RCFGBuilder took 2455.48ms. Allocated memory was 203.4MB in the beginning and 274.7MB in the end (delta: 71.3MB). Free memory was 113.3MB in the beginning and 195.5MB in the end (delta: -82.3MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. * TraceAbstraction took 509553.26ms. Allocated memory was 274.7MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 194.5MB in the beginning and 1.0GB in the end (delta: -813.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 952.79ms. Allocated memory is still 1.5GB. Free memory was 1.0GB in the beginning and 1.3GB in the end (delta: -246.9MB). Peak memory consumption was 213.9MB. Max. memory is 16.1GB. * 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 - PositiveResult [Line: 4042]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 4042]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 4961]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 4961]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 5061]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 5061]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 5189]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 5189]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 5199]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 5199]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 5205]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 5205]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 38 procedures, 445 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 509.5s, OverallIterations: 21, TraceHistogramMax: 15, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.2s, AutomataDifference: 29.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 458.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19055 SdHoareTripleChecker+Valid, 19.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17713 mSDsluCounter, 49801 SdHoareTripleChecker+Invalid, 16.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37623 mSDsCounter, 7985 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16072 IncrementalHoareTripleChecker+Invalid, 24057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7985 mSolverCounterUnsat, 12178 mSDtfsCounter, 16072 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2090 GetRequests, 1823 SyntacticMatches, 4 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17355occurred in iteration=14, InterpolantAutomatonStates: 211, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 25554 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 101 LocationsWithAnnotation, 10042 PreInvPairs, 10278 NumberOfFragments, 4336 HoareAnnotationTreeSize, 10042 FomulaSimplifications, 56770382 FormulaSimplificationTreeSizeReduction, 450.4s HoareSimplificationTime, 101 FomulaSimplificationsInter, 81420 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 4239 NumberOfCodeBlocks, 4239 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 4689 ConstructedInterpolants, 0 QuantifiedInterpolants, 9750 SizeOfPredicates, 2 NumberOfNonLiveVariables, 13454 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 29 InterpolantComputations, 18 PerfectInterpolantSequences, 6140/6382 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 - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 4087]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4098]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4384]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5290]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-29 05:42:58,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5660297-6c9b-428c-8a79-4bf9f3892751/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE