./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:04:38,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:04:38,634 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:04:38,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:04:38,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:04:38,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:04:38,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:04:38,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:04:38,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:04:38,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:04:38,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:04:38,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:04:38,686 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:04:38,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:04:38,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:04:38,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:04:38,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:04:38,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:04:38,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:04:38,686 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:04:38,687 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:04:38,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:04:38,687 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:04:38,687 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:04:38,687 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:04:38,687 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:04:38,687 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:04:38,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:04:38,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:04:38,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:04:38,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:04:38,688 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:04:38,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:04:38,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 [2024-11-13 21:04:39,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:04:39,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:04:39,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:04:39,047 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:04:39,048 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:04:39,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c Unable to find full path for "g++" [2024-11-13 21:04:40,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:04:41,249 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:04:41,250 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2024-11-13 21:04:41,260 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm/data/80d5bc623/3828a8f4e6c14783922ccd584f3a4221/FLAGde9891bd0 [2024-11-13 21:04:41,571 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm/data/80d5bc623/3828a8f4e6c14783922ccd584f3a4221 [2024-11-13 21:04:41,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:04:41,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:04:41,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:04:41,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:04:41,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:04:41,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:04:41" (1/1) ... [2024-11-13 21:04:41,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d84824a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:41, skipping insertion in model container [2024-11-13 21:04:41,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:04:41" (1/1) ... [2024-11-13 21:04:41,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:04:41,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2024-11-13 21:04:41,815 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2024-11-13 21:04:41,819 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2024-11-13 21:04:41,822 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2024-11-13 21:04:41,823 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2024-11-13 21:04:41,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2024-11-13 21:04:41,828 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2024-11-13 21:04:41,830 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2024-11-13 21:04:41,831 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2024-11-13 21:04:41,833 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2024-11-13 21:04:41,835 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2024-11-13 21:04:41,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2024-11-13 21:04:41,838 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2024-11-13 21:04:41,840 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2024-11-13 21:04:41,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2024-11-13 21:04:41,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2024-11-13 21:04:41,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:04:41,856 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:04:41,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2024-11-13 21:04:41,870 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2024-11-13 21:04:41,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2024-11-13 21:04:41,872 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2024-11-13 21:04:41,874 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2024-11-13 21:04:41,875 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2024-11-13 21:04:41,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2024-11-13 21:04:41,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2024-11-13 21:04:41,880 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2024-11-13 21:04:41,881 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2024-11-13 21:04:41,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2024-11-13 21:04:41,884 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2024-11-13 21:04:41,885 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2024-11-13 21:04:41,886 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2024-11-13 21:04:41,888 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2024-11-13 21:04:41,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2024-11-13 21:04:41,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:04:41,906 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:04:41,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:41 WrapperNode [2024-11-13 21:04:41,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:04:41,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:04:41,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:04:41,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:04:41,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:41" (1/1) ... [2024-11-13 21:04:41,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:41" (1/1) ... [2024-11-13 21:04:41,957 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2024-11-13 21:04:41,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:04:41,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:04:41,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:04:41,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:04:41,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:41" (1/1) ... [2024-11-13 21:04:41,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:41" (1/1) ... [2024-11-13 21:04:41,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:41" (1/1) ... [2024-11-13 21:04:41,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:41" (1/1) ... [2024-11-13 21:04:41,983 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:41" (1/1) ... [2024-11-13 21:04:41,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:41" (1/1) ... [2024-11-13 21:04:41,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:41" (1/1) ... [2024-11-13 21:04:41,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:41" (1/1) ... [2024-11-13 21:04:41,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:04:41,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:04:41,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:04:41,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:04:42,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:04:41" (1/1) ... [2024-11-13 21:04:42,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:04:42,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:04:42,048 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:04:42,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:04:42,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:04:42,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:04:42,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:04:42,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:04:42,170 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:04:42,173 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:04:42,506 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2024-11-13 21:04:42,506 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:04:42,527 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:04:42,531 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 21:04:42,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:04:42 BoogieIcfgContainer [2024-11-13 21:04:42,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:04:42,532 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:04:42,532 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:04:42,544 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:04:42,544 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:04:42" (1/1) ... [2024-11-13 21:04:42,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:04:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 58 states and 79 transitions. [2024-11-13 21:04:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2024-11-13 21:04:42,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:04:42,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:42,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:42,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 56 states and 76 transitions. [2024-11-13 21:04:42,951 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-11-13 21:04:42,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:04:42,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:42,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:43,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 62 states and 86 transitions. [2024-11-13 21:04:43,335 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2024-11-13 21:04:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:04:43,335 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:43,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 65 states and 90 transitions. [2024-11-13 21:04:43,758 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2024-11-13 21:04:43,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 21:04:43,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:43,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 68 states and 92 transitions. [2024-11-13 21:04:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2024-11-13 21:04:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:04:44,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:44,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:44,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 66 states and 88 transitions. [2024-11-13 21:04:44,611 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2024-11-13 21:04:44,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:04:44,612 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:44,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 74 states and 103 transitions. [2024-11-13 21:04:45,858 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2024-11-13 21:04:45,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:04:45,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:45,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:46,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 72 states and 99 transitions. [2024-11-13 21:04:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2024-11-13 21:04:46,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:04:46,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:46,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 80 states and 112 transitions. [2024-11-13 21:04:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 112 transitions. [2024-11-13 21:04:48,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:04:48,073 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:48,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 86 states and 117 transitions. [2024-11-13 21:04:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-11-13 21:04:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:04:49,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:49,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 93 states and 123 transitions. [2024-11-13 21:04:51,156 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2024-11-13 21:04:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:04:51,158 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:51,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 96 states and 125 transitions. [2024-11-13 21:04:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2024-11-13 21:04:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 21:04:54,102 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:54,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:04:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:04:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 109 states and 148 transitions. [2024-11-13 21:04:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 148 transitions. [2024-11-13 21:04:59,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 21:04:59,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:04:59,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:04:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:04:59,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:01,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 114 states and 154 transitions. [2024-11-13 21:05:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 154 transitions. [2024-11-13 21:05:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 21:05:01,396 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:01,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 119 states and 163 transitions. [2024-11-13 21:05:03,165 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 163 transitions. [2024-11-13 21:05:03,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 21:05:03,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:03,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 133 states and 186 transitions. [2024-11-13 21:05:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 186 transitions. [2024-11-13 21:05:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 21:05:10,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:10,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:11,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 136 states and 189 transitions. [2024-11-13 21:05:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2024-11-13 21:05:11,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 21:05:11,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:11,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:05:15,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 142 states and 200 transitions. [2024-11-13 21:05:15,278 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2024-11-13 21:05:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:05:15,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:15,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:17,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 145 states and 203 transitions. [2024-11-13 21:05:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2024-11-13 21:05:17,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:05:17,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:17,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 150 states and 210 transitions. [2024-11-13 21:05:20,593 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 210 transitions. [2024-11-13 21:05:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:05:20,595 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:20,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:05:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 151 states and 210 transitions. [2024-11-13 21:05:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 210 transitions. [2024-11-13 21:05:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:05:20,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:20,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:05:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 154 states and 213 transitions. [2024-11-13 21:05:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 213 transitions. [2024-11-13 21:05:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 21:05:22,966 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 159 states and 218 transitions. [2024-11-13 21:05:26,031 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 218 transitions. [2024-11-13 21:05:26,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:05:26,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:26,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 164 states and 228 transitions. [2024-11-13 21:05:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 228 transitions. [2024-11-13 21:05:29,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:05:29,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:29,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:05:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 165 states and 228 transitions. [2024-11-13 21:05:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 228 transitions. [2024-11-13 21:05:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 21:05:30,377 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:30,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 167 states and 230 transitions. [2024-11-13 21:05:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 230 transitions. [2024-11-13 21:05:32,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 21:05:32,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:32,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:37,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 175 states and 254 transitions. [2024-11-13 21:05:37,127 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 254 transitions. [2024-11-13 21:05:37,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:05:37,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:37,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:37,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:05:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 177 states and 255 transitions. [2024-11-13 21:05:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 255 transitions. [2024-11-13 21:05:38,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:05:38,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:38,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 179 states and 262 transitions. [2024-11-13 21:05:41,625 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 262 transitions. [2024-11-13 21:05:41,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:05:41,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:41,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 186 states and 283 transitions. [2024-11-13 21:05:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 283 transitions. [2024-11-13 21:05:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 21:05:46,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 196 states and 302 transitions. [2024-11-13 21:05:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 302 transitions. [2024-11-13 21:05:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 21:05:53,403 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:53,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:05:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:05:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 201 states and 311 transitions. [2024-11-13 21:05:56,603 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 311 transitions. [2024-11-13 21:05:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 21:05:56,604 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:05:56,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:05:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:05:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 21:06:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 207 states and 324 transitions. [2024-11-13 21:06:02,043 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 324 transitions. [2024-11-13 21:06:02,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 21:06:02,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:02,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 21:06:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 208 states and 327 transitions. [2024-11-13 21:06:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 327 transitions. [2024-11-13 21:06:04,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 21:06:04,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:04,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:06:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 213 states and 335 transitions. [2024-11-13 21:06:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 335 transitions. [2024-11-13 21:06:08,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 21:06:08,393 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:08,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:06:13,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:13,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 218 states and 342 transitions. [2024-11-13 21:06:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 342 transitions. [2024-11-13 21:06:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 21:06:13,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:13,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:06:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 220 states and 350 transitions. [2024-11-13 21:06:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 350 transitions. [2024-11-13 21:06:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 21:06:14,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:14,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:06:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 224 states and 355 transitions. [2024-11-13 21:06:17,079 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 355 transitions. [2024-11-13 21:06:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 21:06:17,079 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:17,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:06:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 224 states and 354 transitions. [2024-11-13 21:06:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 354 transitions. [2024-11-13 21:06:21,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 21:06:21,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:21,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:06:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 224 states and 353 transitions. [2024-11-13 21:06:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 353 transitions. [2024-11-13 21:06:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 21:06:22,925 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:22,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:06:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 232 states and 365 transitions. [2024-11-13 21:06:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 365 transitions. [2024-11-13 21:06:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 21:06:30,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:30,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 21:06:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 233 states and 366 transitions. [2024-11-13 21:06:31,499 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 366 transitions. [2024-11-13 21:06:31,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 21:06:31,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:31,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:06:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:33,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 235 states and 371 transitions. [2024-11-13 21:06:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 371 transitions. [2024-11-13 21:06:33,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 21:06:33,509 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:33,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:34,296 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:06:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 243 states and 390 transitions. [2024-11-13 21:06:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 390 transitions. [2024-11-13 21:06:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 21:06:50,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:50,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:06:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:06:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 248 states and 394 transitions. [2024-11-13 21:06:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 394 transitions. [2024-11-13 21:06:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 21:06:54,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:06:54,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:06:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:06:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:07:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:05,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 258 states and 407 transitions. [2024-11-13 21:07:05,517 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 407 transitions. [2024-11-13 21:07:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:07:05,518 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:05,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 263 states and 414 transitions. [2024-11-13 21:07:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 414 transitions. [2024-11-13 21:07:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:07:11,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:11,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:15,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 268 states and 420 transitions. [2024-11-13 21:07:15,846 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 420 transitions. [2024-11-13 21:07:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:07:15,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:15,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 21:07:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 274 states and 437 transitions. [2024-11-13 21:07:20,696 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 437 transitions. [2024-11-13 21:07:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:07:20,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:20,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:07:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 274 states and 435 transitions. [2024-11-13 21:07:21,978 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 435 transitions. [2024-11-13 21:07:21,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:07:21,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:21,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 21:07:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 274 states and 433 transitions. [2024-11-13 21:07:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 433 transitions. [2024-11-13 21:07:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:07:23,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:23,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 21:07:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 274 states and 432 transitions. [2024-11-13 21:07:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 432 transitions. [2024-11-13 21:07:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 21:07:29,794 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:29,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:07:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 282 states and 446 transitions. [2024-11-13 21:07:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 446 transitions. [2024-11-13 21:07:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:07:39,144 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:39,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 21:07:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 285 states and 449 transitions. [2024-11-13 21:07:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 449 transitions. [2024-11-13 21:07:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:07:42,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:42,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 21:07:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:45,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 288 states and 452 transitions. [2024-11-13 21:07:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 452 transitions. [2024-11-13 21:07:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 21:07:45,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:45,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 21:07:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 292 states and 455 transitions. [2024-11-13 21:07:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 455 transitions. [2024-11-13 21:07:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 21:07:50,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:07:50,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:07:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:07:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 21:07:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:07:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 78 states and 96 transitions. [2024-11-13 21:07:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2024-11-13 21:07:55,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 21:07:55,815 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 57 iterations. [2024-11-13 21:07:55,822 INFO L729 CodeCheckObserver]: All specifications hold 16 specifications checked. All of them hold [2024-11-13 21:08:10,826 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2024-11-13 21:08:10,827 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2024-11-13 21:08:10,827 INFO L75 FloydHoareUtils]: For program point L217(line 217) no Hoare annotation was computed. [2024-11-13 21:08:10,827 INFO L77 FloydHoareUtils]: At program point L151(lines 151 281) the Hoare annotation is: (let ((.cse0 (<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0)))) (or (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= 1 |ULTIMATE.start_main_~main__i~0#1|) .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2 (<= 1 |ULTIMATE.start_main_~main__limit~0#1|)))) [2024-11-13 21:08:10,828 INFO L77 FloydHoareUtils]: At program point L110(lines 110 123) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse1 (= |ULTIMATE.start_main_~main__j~0#1| 0)) (.cse5 (< |ULTIMATE.start_main_~main__len~0#1| (+ 2 |ULTIMATE.start_main_~main__i~0#1|))) (.cse0 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))) (.cse3 (<= 1 |ULTIMATE.start_main_~main__i~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 1 |ULTIMATE.start_main_~main__j~0#1|) .cse0 .cse2 .cse3) (and (<= 5 |ULTIMATE.start_main_~main__bufsize~0#1|) .cse0 .cse4 .cse1 .cse2) (and .cse5 .cse0 .cse4 .cse1 .cse2) (and .cse5 .cse0 .cse2 .cse3))) [2024-11-13 21:08:10,828 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 13 313) the Hoare annotation is: true [2024-11-13 21:08:10,828 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2024-11-13 21:08:10,828 INFO L77 FloydHoareUtils]: At program point L36(lines 36 300) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~main__i~0#1| |ULTIMATE.start_main_~main__len~0#1|)) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0))) (or (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1)) (not .cse2)) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~main__j~0#1| 0)))) [2024-11-13 21:08:10,828 INFO L75 FloydHoareUtils]: For program point L193(line 193) no Hoare annotation was computed. [2024-11-13 21:08:10,828 INFO L77 FloydHoareUtils]: At program point $Ultimate##6(lines 34 305) the Hoare annotation is: (let ((.cse0 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1))) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0))) (or (and (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|) .cse0) (and (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 .cse0 (not .cse2)) (and .cse1 .cse2 (= |ULTIMATE.start_main_~main__j~0#1| 0)))) [2024-11-13 21:08:10,828 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2024-11-13 21:08:10,829 INFO L77 FloydHoareUtils]: At program point L86(lines 86 127) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 0))) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|))) (or (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 .cse2 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (and .cse0 .cse1 (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2))) [2024-11-13 21:08:10,829 INFO L77 FloydHoareUtils]: At program point L20(lines 20 312) the Hoare annotation is: true [2024-11-13 21:08:10,829 INFO L77 FloydHoareUtils]: At program point L243(lines 243 267) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_main_~main__j~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~14#1| 0)) (<= (+ 3 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= 2 |ULTIMATE.start_main_~main__i~0#1|) (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) [2024-11-13 21:08:10,829 INFO L75 FloydHoareUtils]: For program point L177(line 177) no Hoare annotation was computed. [2024-11-13 21:08:10,829 INFO L77 FloydHoareUtils]: At program point L45(lines 45 288) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse1 (<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse3 (= |ULTIMATE.start_main_~main__i~0#1| 0))) (or (and .cse0 .cse1 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse2 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1)) (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (not .cse3)) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= 1 |ULTIMATE.start_main_~main__limit~0#1|)))) [2024-11-13 21:08:10,829 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2024-11-13 21:08:10,829 INFO L77 FloydHoareUtils]: At program point L227(lines 227 269) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__j~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)) (<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) [2024-11-13 21:08:10,829 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2024-11-13 21:08:10,829 INFO L75 FloydHoareUtils]: For program point L153(line 153) no Hoare annotation was computed. [2024-11-13 21:08:10,829 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) no Hoare annotation was computed. [2024-11-13 21:08:10,829 INFO L75 FloydHoareUtils]: For program point L112(line 112) no Hoare annotation was computed. [2024-11-13 21:08:10,829 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 245) no Hoare annotation was computed. [2024-11-13 21:08:10,830 INFO L77 FloydHoareUtils]: At program point L203(lines 203 273) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__j~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0)) (<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) [2024-11-13 21:08:10,830 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 21:08:10,830 INFO L77 FloydHoareUtils]: At program point L38(lines 38 294) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~main__i~0#1| |ULTIMATE.start_main_~main__len~0#1|)) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= 1 |ULTIMATE.start_main_~main__limit~0#1|)) (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1)) (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (not .cse2)))) [2024-11-13 21:08:10,830 INFO L77 FloydHoareUtils]: At program point $Ultimate##4(lines 30 311) the Hoare annotation is: (let ((.cse0 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1)))) (or (and (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|) .cse0) (and (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) .cse0))) [2024-11-13 21:08:10,830 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 141) no Hoare annotation was computed. [2024-11-13 21:08:10,830 INFO L75 FloydHoareUtils]: For program point L88(line 88) no Hoare annotation was computed. [2024-11-13 21:08:10,830 INFO L75 FloydHoareUtils]: For program point L245(line 245) no Hoare annotation was computed. [2024-11-13 21:08:10,830 INFO L75 FloydHoareUtils]: For program point L47(line 47) no Hoare annotation was computed. [2024-11-13 21:08:10,830 INFO L75 FloydHoareUtils]: For program point L229(line 229) no Hoare annotation was computed. [2024-11-13 21:08:10,830 INFO L77 FloydHoareUtils]: At program point L163(lines 163 279) the Hoare annotation is: (let ((.cse0 (<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)) (.cse1 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))) (.cse2 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= 1 |ULTIMATE.start_main_~main__limit~0#1|)) (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 .cse2 (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= 1 |ULTIMATE.start_main_~main__i~0#1|)))) [2024-11-13 21:08:10,830 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2024-11-13 21:08:10,830 INFO L75 FloydHoareUtils]: For program point L205(line 205) no Hoare annotation was computed. [2024-11-13 21:08:10,831 INFO L77 FloydHoareUtils]: At program point L139(lines 139 283) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))) (.cse1 (<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse3 (= |ULTIMATE.start_main_~main__i~0#1| 0))) (or (and .cse0 .cse1 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse2 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1)) (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (not .cse3)) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= 1 |ULTIMATE.start_main_~main__limit~0#1|)))) [2024-11-13 21:08:10,834 INFO L77 FloydHoareUtils]: At program point L98(lines 98 125) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~main__j~0#1| 0)) (.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1| 0))) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|))) (or (and (< |ULTIMATE.start_main_~main__len~0#1| (+ 2 |ULTIMATE.start_main_~main__i~0#1|)) .cse0 .cse1 .cse2 .cse3) (and (<= 5 |ULTIMATE.start_main_~main__bufsize~0#1|) .cse0 .cse1 .cse2 .cse3) (and (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse0 .cse1 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)))) [2024-11-13 21:08:10,834 INFO L77 FloydHoareUtils]: At program point L255(lines 255 265) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_main_~main__j~0#1|) (<= (+ 3 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= 2 |ULTIMATE.start_main_~main__i~0#1|) (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~15#1| 0))) [2024-11-13 21:08:10,834 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 165) no Hoare annotation was computed. [2024-11-13 21:08:10,835 INFO L77 FloydHoareUtils]: At program point L57(lines 57 286) the Hoare annotation is: (let ((.cse0 (<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 1))) (or (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (not .cse2) (<= 0 |ULTIMATE.start_main_~main__i~0#1|) .cse3) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= 1 |ULTIMATE.start_main_~main__limit~0#1|) .cse3))) [2024-11-13 21:08:10,835 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2024-11-13 21:08:10,835 INFO L77 FloydHoareUtils]: At program point L74(lines 74 129) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse3 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse2 (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|))) (or (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1)) .cse2 (not .cse3)) (and .cse0 .cse1 .cse3 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2))) [2024-11-13 21:08:10,835 INFO L75 FloydHoareUtils]: For program point L165(line 165) no Hoare annotation was computed. [2024-11-13 21:08:10,835 INFO L77 FloydHoareUtils]: At program point L66(lines 66 285) the Hoare annotation is: (let ((.cse0 (<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0))) (or (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1)) (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (not .cse2)) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= 1 |ULTIMATE.start_main_~main__limit~0#1|)))) [2024-11-13 21:08:10,836 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 21:08:10,836 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 153) no Hoare annotation was computed. [2024-11-13 21:08:10,836 INFO L77 FloydHoareUtils]: At program point L215(lines 215 271) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__j~0#1|) (<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0)) (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) [2024-11-13 21:08:10,836 INFO L75 FloydHoareUtils]: For program point L141(line 141) no Hoare annotation was computed. [2024-11-13 21:08:10,836 INFO L75 FloydHoareUtils]: For program point L100(line 100) no Hoare annotation was computed. [2024-11-13 21:08:10,836 INFO L75 FloydHoareUtils]: For program point L257(line 257) no Hoare annotation was computed. [2024-11-13 21:08:10,836 INFO L77 FloydHoareUtils]: At program point L191(lines 191 275) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__j~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0)) (<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) [2024-11-13 21:08:10,836 INFO L75 FloydHoareUtils]: For program point L59(line 59) no Hoare annotation was computed. [2024-11-13 21:08:10,837 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 193) no Hoare annotation was computed. [2024-11-13 21:08:10,837 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2024-11-13 21:08:10,837 INFO L77 FloydHoareUtils]: At program point L175(lines 175 277) the Hoare annotation is: (let ((.cse0 (<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)) (.cse1 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 0))) (.cse2 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse3 (= |ULTIMATE.start_main_~main__j~0#1| 0)) (.cse4 (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse5 (<= 1 |ULTIMATE.start_main_~main__i~0#1|))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0) .cse3 (<= 1 |ULTIMATE.start_main_~main__limit~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__j~0#1|) .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2024-11-13 21:08:10,837 INFO L75 FloydHoareUtils]: For program point L76(line 76) no Hoare annotation was computed. [2024-11-13 21:08:10,837 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 229) no Hoare annotation was computed. [2024-11-13 21:08:10,837 INFO L77 FloydHoareUtils]: At program point L68(lines 38 294) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~main__i~0#1| |ULTIMATE.start_main_~main__len~0#1|)) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse3 (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse3) (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1)) .cse3 (not .cse2)))) [2024-11-13 21:08:10,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:08:10 ImpRootNode [2024-11-13 21:08:10,852 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:08:10,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:08:10,852 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:08:10,853 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:08:10,853 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:04:42" (3/4) ... [2024-11-13 21:08:10,856 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 21:08:10,865 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-13 21:08:10,866 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 21:08:10,866 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 21:08:10,866 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 21:08:10,966 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:08:10,966 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 21:08:10,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:08:10,967 INFO L158 Benchmark]: Toolchain (without parser) took 209393.35ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 117.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 248.1MB. Max. memory is 16.1GB. [2024-11-13 21:08:10,968 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 75.2MB in the end (delta: 196.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:08:10,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.23ms. Allocated memory is still 142.6MB. Free memory was 117.3MB in the beginning and 104.3MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:08:10,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.17ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 102.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:08:10,969 INFO L158 Benchmark]: Boogie Preprocessor took 36.05ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.7MB in the end (delta: 779.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:08:10,969 INFO L158 Benchmark]: RCFGBuilder took 532.89ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 85.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:08:10,970 INFO L158 Benchmark]: CodeCheck took 208319.57ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 85.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 206.2MB. Max. memory is 16.1GB. [2024-11-13 21:08:10,970 INFO L158 Benchmark]: Witness Printer took 114.15ms. Allocated memory is still 1.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:08:10,972 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 58 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 193.3s, OverallIterations: 57, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13335 SdHoareTripleChecker+Valid, 74.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9102 mSDsluCounter, 5234 SdHoareTripleChecker+Invalid, 65.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3680 mSDsCounter, 12985 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46475 IncrementalHoareTripleChecker+Invalid, 59460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12985 mSolverCounterUnsat, 1554 mSDtfsCounter, 46475 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13054 GetRequests, 11461 SyntacticMatches, 591 SemanticMatches, 1002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426484 ImplicationChecksByTransitivity, 185.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 1452 NumberOfCodeBlocks, 1452 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 1396 ConstructedInterpolants, 0 QuantifiedInterpolants, 4729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 56 InterpolantComputations, 26 PerfectInterpolantSequences, 328/620 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 47]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 59]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 76]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 88]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 100]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 112]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 141]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 153]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 165]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 177]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 193]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 205]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 217]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 229]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 245]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 257]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 30]: Location Invariant Derived location invariant: (((main__len <= main__i) && (0 < ((long long) main__i + 1))) || ((((long long) main__limit + 4) <= main__bufsize) && (0 < ((long long) main__i + 1)))) - InvariantResult [Line: 34]: Location Invariant Derived location invariant: ((((main__len <= main__i) && (0 < ((long long) main__i + 1))) || ((((0 < ((long long) main__j + 1)) && (((long long) main__limit + 4) <= main__bufsize)) && (0 < ((long long) main__i + 1))) && (main__i != 0))) || (((((long long) main__limit + 4) <= main__bufsize) && (main__i == 0)) && (main__j == 0))) - InvariantResult [Line: 38]: Location Invariant Derived location invariant: ((((((main__i < main__len) && (((long long) main__limit + 4) <= main__bufsize)) && (main__i == 0)) && (main__j == 0)) && (((long long) 5 + main__j) <= main__bufsize)) || ((((((main__i < main__len) && (0 < ((long long) main__j + 1))) && (((long long) main__limit + 4) <= main__bufsize)) && (0 < ((long long) main__i + 1))) && (((long long) 5 + main__j) <= main__bufsize)) && (main__i != 0))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 75.2MB in the end (delta: 196.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.23ms. Allocated memory is still 142.6MB. Free memory was 117.3MB in the beginning and 104.3MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.17ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 102.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.05ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.7MB in the end (delta: 779.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 532.89ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 85.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 208319.57ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 85.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 206.2MB. Max. memory is 16.1GB. * Witness Printer took 114.15ms. Allocated memory is still 1.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-13 21:08:11,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a868e8f3-0f1b-42ff-9270-429b8ae10e8c/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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