./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 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.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_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:21:25,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:21:25,862 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 22:21:25,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:21:25,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:21:25,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:21:25,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:21:25,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:21:25,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:21:25,897 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:21:25,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:21:25,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:21:25,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:21:25,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:21:25,901 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:21:25,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:21:25,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:21:25,902 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:21:25,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:21:25,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:21:25,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:21:25,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:21:25,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:21:25,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:21:25,906 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:21:25,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:21:25,907 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:21:25,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:21:25,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:21:25,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:21:25,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:21:25,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:21:25,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:21:25,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:21:25,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:21:25,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:21:25,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:21:25,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:21:25,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:21:25,912 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:21:25,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:21:25,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:21:25,913 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx 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 -> Automizer 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 [2023-11-21 22:21:26,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:21:26,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:21:26,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:21:26,313 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:21:26,314 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:21:26,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2023-11-21 22:21:29,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:21:29,670 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:21:29,671 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2023-11-21 22:21:29,681 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx/data/6386abd03/32ad0327cd024ba79baad8b03d52ed9d/FLAG12bb4e87a [2023-11-21 22:21:29,697 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx/data/6386abd03/32ad0327cd024ba79baad8b03d52ed9d [2023-11-21 22:21:29,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:21:29,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:21:29,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:21:29,704 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:21:29,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:21:29,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:21:29" (1/1) ... [2023-11-21 22:21:29,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3134b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:29, skipping insertion in model container [2023-11-21 22:21:29,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:21:29" (1/1) ... [2023-11-21 22:21:29,750 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:21:29,940 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2023-11-21 22:21:29,947 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2023-11-21 22:21:29,950 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2023-11-21 22:21:29,953 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2023-11-21 22:21:29,955 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2023-11-21 22:21:29,957 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2023-11-21 22:21:29,962 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2023-11-21 22:21:29,965 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2023-11-21 22:21:29,968 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2023-11-21 22:21:29,970 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2023-11-21 22:21:29,975 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2023-11-21 22:21:29,977 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2023-11-21 22:21:29,980 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2023-11-21 22:21:29,984 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2023-11-21 22:21:29,989 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2023-11-21 22:21:29,992 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2023-11-21 22:21:29,996 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:21:30,016 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:21:30,034 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2023-11-21 22:21:30,036 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2023-11-21 22:21:30,038 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2023-11-21 22:21:30,040 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2023-11-21 22:21:30,042 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2023-11-21 22:21:30,044 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2023-11-21 22:21:30,047 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2023-11-21 22:21:30,049 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2023-11-21 22:21:30,051 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2023-11-21 22:21:30,052 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2023-11-21 22:21:30,055 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2023-11-21 22:21:30,057 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2023-11-21 22:21:30,059 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2023-11-21 22:21:30,061 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2023-11-21 22:21:30,064 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2023-11-21 22:21:30,067 WARN L240 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_3bbf8a23-c435-4376-b405-5a4855084e93/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2023-11-21 22:21:30,071 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:21:30,088 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:21:30,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:30 WrapperNode [2023-11-21 22:21:30,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:21:30,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:21:30,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:21:30,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:21:30,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:30" (1/1) ... [2023-11-21 22:21:30,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:30" (1/1) ... [2023-11-21 22:21:30,136 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2023-11-21 22:21:30,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:21:30,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:21:30,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:21:30,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:21:30,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:30" (1/1) ... [2023-11-21 22:21:30,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:30" (1/1) ... [2023-11-21 22:21:30,153 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:30" (1/1) ... [2023-11-21 22:21:30,166 INFO L187 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-21 22:21:30,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:30" (1/1) ... [2023-11-21 22:21:30,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:30" (1/1) ... [2023-11-21 22:21:30,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:30" (1/1) ... [2023-11-21 22:21:30,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:30" (1/1) ... [2023-11-21 22:21:30,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:30" (1/1) ... [2023-11-21 22:21:30,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:30" (1/1) ... [2023-11-21 22:21:30,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:21:30,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:21:30,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:21:30,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:21:30,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:30" (1/1) ... [2023-11-21 22:21:30,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:21:30,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:21:30,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:21:30,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:21:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:21:30,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:21:30,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:21:30,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:21:30,391 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:21:30,394 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:21:30,687 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:21:30,725 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:21:30,725 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 22:21:30,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:21:30 BoogieIcfgContainer [2023-11-21 22:21:30,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:21:30,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:21:30,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:21:30,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:21:30,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:21:29" (1/3) ... [2023-11-21 22:21:30,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e404a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:21:30, skipping insertion in model container [2023-11-21 22:21:30,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:21:30" (2/3) ... [2023-11-21 22:21:30,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e404a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:21:30, skipping insertion in model container [2023-11-21 22:21:30,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:21:30" (3/3) ... [2023-11-21 22:21:30,741 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2023-11-21 22:21:30,766 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:21:30,767 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-11-21 22:21:30,871 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:21:30,880 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@394db060, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:21:30,880 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-21 22:21:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 57 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 22:21:30,894 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:21:30,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:30,896 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-11-21 22:21:30,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash -7903051, now seen corresponding path program 1 times [2023-11-21 22:21:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:30,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386535269] [2023-11-21 22:21:30,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:30,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:31,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:31,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:31,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386535269] [2023-11-21 22:21:31,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386535269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:31,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:31,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:21:31,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32181373] [2023-11-21 22:21:31,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:31,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:21:31,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:31,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:21:31,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:21:31,284 INFO L87 Difference]: Start difference. First operand has 58 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 57 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:31,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:21:31,365 INFO L93 Difference]: Finished difference Result 78 states and 106 transitions. [2023-11-21 22:21:31,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:21:31,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-21 22:21:31,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:21:31,380 INFO L225 Difference]: With dead ends: 78 [2023-11-21 22:21:31,380 INFO L226 Difference]: Without dead ends: 71 [2023-11-21 22:21:31,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:21:31,389 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 56 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:21:31,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 101 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:21:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-21 22:21:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2023-11-21 22:21:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-11-21 22:21:31,440 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 8 [2023-11-21 22:21:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:21:31,441 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-11-21 22:21:31,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-11-21 22:21:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-21 22:21:31,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:21:31,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:31,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:21:31,444 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-11-21 22:21:31,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:31,446 INFO L85 PathProgramCache]: Analyzing trace with hash -244990519, now seen corresponding path program 1 times [2023-11-21 22:21:31,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:31,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771447857] [2023-11-21 22:21:31,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:31,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:31,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:31,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771447857] [2023-11-21 22:21:31,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771447857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:31,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:31,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:21:31,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613687922] [2023-11-21 22:21:31,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:31,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:21:31,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:31,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:21:31,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:21:31,723 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:31,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:21:31,824 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2023-11-21 22:21:31,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:21:31,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-21 22:21:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:21:31,826 INFO L225 Difference]: With dead ends: 72 [2023-11-21 22:21:31,827 INFO L226 Difference]: Without dead ends: 70 [2023-11-21 22:21:31,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:21:31,829 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 100 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:21:31,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 65 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:21:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-21 22:21:31,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2023-11-21 22:21:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2023-11-21 22:21:31,840 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 9 [2023-11-21 22:21:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:21:31,841 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2023-11-21 22:21:31,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2023-11-21 22:21:31,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-21 22:21:31,842 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:21:31,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:31,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:21:31,843 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-11-21 22:21:31,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:31,844 INFO L85 PathProgramCache]: Analyzing trace with hash -241344101, now seen corresponding path program 1 times [2023-11-21 22:21:31,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:31,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114213861] [2023-11-21 22:21:31,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:31,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:31,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:31,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114213861] [2023-11-21 22:21:31,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114213861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:31,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:31,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:21:31,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884857244] [2023-11-21 22:21:31,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:31,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:21:31,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:31,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:21:31,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:21:31,942 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:21:32,041 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2023-11-21 22:21:32,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:21:32,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-21 22:21:32,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:21:32,043 INFO L225 Difference]: With dead ends: 142 [2023-11-21 22:21:32,044 INFO L226 Difference]: Without dead ends: 92 [2023-11-21 22:21:32,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:21:32,046 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 78 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:21:32,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 144 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:21:32,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-21 22:21:32,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 51. [2023-11-21 22:21:32,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2023-11-21 22:21:32,058 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 9 [2023-11-21 22:21:32,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:21:32,059 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2023-11-21 22:21:32,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,059 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2023-11-21 22:21:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-21 22:21:32,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:21:32,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:32,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:21:32,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-11-21 22:21:32,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:32,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1108271542, now seen corresponding path program 1 times [2023-11-21 22:21:32,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:32,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16273696] [2023-11-21 22:21:32,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:32,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:32,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:32,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16273696] [2023-11-21 22:21:32,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16273696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:32,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:32,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:21:32,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688098877] [2023-11-21 22:21:32,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:32,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:21:32,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:32,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:21:32,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:21:32,180 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:21:32,257 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2023-11-21 22:21:32,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:21:32,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-21 22:21:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:21:32,259 INFO L225 Difference]: With dead ends: 91 [2023-11-21 22:21:32,259 INFO L226 Difference]: Without dead ends: 89 [2023-11-21 22:21:32,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:21:32,261 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 92 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:21:32,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 97 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:21:32,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-21 22:21:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 49. [2023-11-21 22:21:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-11-21 22:21:32,269 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 10 [2023-11-21 22:21:32,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:21:32,270 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-11-21 22:21:32,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-11-21 22:21:32,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-21 22:21:32,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:21:32,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:32,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:21:32,272 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-11-21 22:21:32,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:32,273 INFO L85 PathProgramCache]: Analyzing trace with hash 787471533, now seen corresponding path program 1 times [2023-11-21 22:21:32,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:32,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362861979] [2023-11-21 22:21:32,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:32,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:32,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:32,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362861979] [2023-11-21 22:21:32,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362861979] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:32,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:32,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:21:32,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128746155] [2023-11-21 22:21:32,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:32,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:21:32,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:32,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:21:32,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:21:32,352 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:21:32,416 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2023-11-21 22:21:32,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:21:32,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-21 22:21:32,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:21:32,418 INFO L225 Difference]: With dead ends: 68 [2023-11-21 22:21:32,418 INFO L226 Difference]: Without dead ends: 66 [2023-11-21 22:21:32,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:21:32,420 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 68 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:21:32,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 81 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:21:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-21 22:21:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2023-11-21 22:21:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2023-11-21 22:21:32,427 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2023-11-21 22:21:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:21:32,427 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2023-11-21 22:21:32,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2023-11-21 22:21:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-21 22:21:32,429 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:21:32,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:32,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:21:32,429 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-11-21 22:21:32,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:32,430 INFO L85 PathProgramCache]: Analyzing trace with hash -3316478, now seen corresponding path program 1 times [2023-11-21 22:21:32,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:32,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244131141] [2023-11-21 22:21:32,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:32,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:32,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:32,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244131141] [2023-11-21 22:21:32,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244131141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:32,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:32,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:21:32,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445124831] [2023-11-21 22:21:32,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:32,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:21:32,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:32,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:21:32,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:21:32,546 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:21:32,641 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2023-11-21 22:21:32,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:21:32,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-21 22:21:32,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:21:32,643 INFO L225 Difference]: With dead ends: 86 [2023-11-21 22:21:32,643 INFO L226 Difference]: Without dead ends: 84 [2023-11-21 22:21:32,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:21:32,645 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 108 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:21:32,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 134 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:21:32,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-21 22:21:32,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 45. [2023-11-21 22:21:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.4) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2023-11-21 22:21:32,652 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 11 [2023-11-21 22:21:32,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:21:32,653 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2023-11-21 22:21:32,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2023-11-21 22:21:32,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-21 22:21:32,654 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:21:32,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:32,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:21:32,655 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-11-21 22:21:32,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:32,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1358182141, now seen corresponding path program 1 times [2023-11-21 22:21:32,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:32,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413162085] [2023-11-21 22:21:32,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:32,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:32,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:32,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413162085] [2023-11-21 22:21:32,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413162085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:32,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:32,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:21:32,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690500122] [2023-11-21 22:21:32,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:32,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:21:32,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:32,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:21:32,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:21:32,789 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:21:32,897 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2023-11-21 22:21:32,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:21:32,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-21 22:21:32,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:21:32,899 INFO L225 Difference]: With dead ends: 74 [2023-11-21 22:21:32,899 INFO L226 Difference]: Without dead ends: 72 [2023-11-21 22:21:32,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:21:32,900 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 122 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:21:32,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 62 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:21:32,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-21 22:21:32,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 43. [2023-11-21 22:21:32,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2023-11-21 22:21:32,906 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 12 [2023-11-21 22:21:32,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:21:32,906 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-11-21 22:21:32,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2023-11-21 22:21:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-21 22:21:32,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:21:32,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:32,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:21:32,908 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-11-21 22:21:32,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:32,909 INFO L85 PathProgramCache]: Analyzing trace with hash -102806723, now seen corresponding path program 1 times [2023-11-21 22:21:32,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:32,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672058268] [2023-11-21 22:21:32,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:32,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:32,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:32,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672058268] [2023-11-21 22:21:32,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672058268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:32,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:32,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:21:32,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713218349] [2023-11-21 22:21:32,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:32,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:21:32,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:32,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:21:32,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:21:32,985 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:21:33,046 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2023-11-21 22:21:33,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:21:33,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-21 22:21:33,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:21:33,047 INFO L225 Difference]: With dead ends: 82 [2023-11-21 22:21:33,048 INFO L226 Difference]: Without dead ends: 80 [2023-11-21 22:21:33,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:21:33,049 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 73 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:21:33,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 91 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:21:33,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-21 22:21:33,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 41. [2023-11-21 22:21:33,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2023-11-21 22:21:33,055 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 12 [2023-11-21 22:21:33,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:21:33,055 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2023-11-21 22:21:33,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,056 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2023-11-21 22:21:33,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-21 22:21:33,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:21:33,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:33,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:21:33,057 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-11-21 22:21:33,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:33,058 INFO L85 PathProgramCache]: Analyzing trace with hash 846030708, now seen corresponding path program 1 times [2023-11-21 22:21:33,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:33,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382675575] [2023-11-21 22:21:33,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:33,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:33,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:33,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382675575] [2023-11-21 22:21:33,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382675575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:33,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:33,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:21:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855148067] [2023-11-21 22:21:33,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:33,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:21:33,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:33,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:21:33,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:21:33,163 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:21:33,241 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2023-11-21 22:21:33,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:21:33,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-21 22:21:33,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:21:33,243 INFO L225 Difference]: With dead ends: 56 [2023-11-21 22:21:33,243 INFO L226 Difference]: Without dead ends: 54 [2023-11-21 22:21:33,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-21 22:21:33,244 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 87 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-21 22:21:33,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 73 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-21 22:21:33,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-21 22:21:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2023-11-21 22:21:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.34375) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-11-21 22:21:33,249 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 13 [2023-11-21 22:21:33,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:21:33,250 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-11-21 22:21:33,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-11-21 22:21:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-21 22:21:33,251 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:21:33,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:33,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 22:21:33,251 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-11-21 22:21:33,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:33,252 INFO L85 PathProgramCache]: Analyzing trace with hash 457152298, now seen corresponding path program 1 times [2023-11-21 22:21:33,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:33,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388205713] [2023-11-21 22:21:33,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:33,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:33,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:33,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388205713] [2023-11-21 22:21:33,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388205713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:33,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:33,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:21:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265521635] [2023-11-21 22:21:33,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:33,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:21:33,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:33,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:21:33,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:21:33,329 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:21:33,396 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2023-11-21 22:21:33,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:21:33,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-21 22:21:33,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:21:33,397 INFO L225 Difference]: With dead ends: 56 [2023-11-21 22:21:33,398 INFO L226 Difference]: Without dead ends: 54 [2023-11-21 22:21:33,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:21:33,399 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 62 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:21:33,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 54 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:21:33,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-21 22:21:33,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2023-11-21 22:21:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-11-21 22:21:33,403 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 14 [2023-11-21 22:21:33,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:21:33,404 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-11-21 22:21:33,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,404 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-11-21 22:21:33,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-21 22:21:33,405 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:21:33,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:33,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:21:33,405 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-11-21 22:21:33,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:33,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1286823483, now seen corresponding path program 1 times [2023-11-21 22:21:33,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:33,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537261968] [2023-11-21 22:21:33,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:33,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:33,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:33,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:33,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537261968] [2023-11-21 22:21:33,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537261968] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:33,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:33,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:21:33,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333424423] [2023-11-21 22:21:33,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:33,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:21:33,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:33,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:21:33,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:21:33,489 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:21:33,553 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2023-11-21 22:21:33,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:21:33,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-21 22:21:33,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:21:33,555 INFO L225 Difference]: With dead ends: 64 [2023-11-21 22:21:33,555 INFO L226 Difference]: Without dead ends: 62 [2023-11-21 22:21:33,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:21:33,556 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 40 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:21:33,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 93 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:21:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-21 22:21:33,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 35. [2023-11-21 22:21:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-11-21 22:21:33,560 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 15 [2023-11-21 22:21:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:21:33,561 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-11-21 22:21:33,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-11-21 22:21:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-21 22:21:33,562 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:21:33,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:33,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:21:33,562 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-11-21 22:21:33,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:33,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1236826449, now seen corresponding path program 1 times [2023-11-21 22:21:33,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:33,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510132584] [2023-11-21 22:21:33,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:33,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:33,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:33,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510132584] [2023-11-21 22:21:33,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510132584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:33,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:33,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:21:33,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560744669] [2023-11-21 22:21:33,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:33,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:21:33,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:33,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:21:33,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:21:33,651 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:21:33,769 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2023-11-21 22:21:33,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:21:33,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-21 22:21:33,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:21:33,771 INFO L225 Difference]: With dead ends: 69 [2023-11-21 22:21:33,771 INFO L226 Difference]: Without dead ends: 67 [2023-11-21 22:21:33,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:21:33,772 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 71 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:21:33,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 88 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:21:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-21 22:21:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 33. [2023-11-21 22:21:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2023-11-21 22:21:33,787 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 16 [2023-11-21 22:21:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:21:33,789 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2023-11-21 22:21:33,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2023-11-21 22:21:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-21 22:21:33,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:21:33,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:33,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:21:33,791 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-11-21 22:21:33,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:33,791 INFO L85 PathProgramCache]: Analyzing trace with hash -313081598, now seen corresponding path program 1 times [2023-11-21 22:21:33,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:33,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885403452] [2023-11-21 22:21:33,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:33,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:33,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:33,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885403452] [2023-11-21 22:21:33,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885403452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:33,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:33,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:21:33,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566836523] [2023-11-21 22:21:33,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:33,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:21:33,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:33,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:21:33,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:21:33,917 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:34,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:21:34,028 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2023-11-21 22:21:34,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:21:34,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-21 22:21:34,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:21:34,030 INFO L225 Difference]: With dead ends: 57 [2023-11-21 22:21:34,030 INFO L226 Difference]: Without dead ends: 55 [2023-11-21 22:21:34,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-21 22:21:34,033 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 81 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:21:34,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 71 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:21:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-21 22:21:34,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 31. [2023-11-21 22:21:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.25) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-11-21 22:21:34,036 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 17 [2023-11-21 22:21:34,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:21:34,036 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-11-21 22:21:34,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:34,037 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-11-21 22:21:34,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 22:21:34,040 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:21:34,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:34,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 22:21:34,040 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-11-21 22:21:34,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:34,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1115590792, now seen corresponding path program 1 times [2023-11-21 22:21:34,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:34,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724041478] [2023-11-21 22:21:34,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:34,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:34,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:34,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:34,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724041478] [2023-11-21 22:21:34,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724041478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:34,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:34,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:21:34,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500672783] [2023-11-21 22:21:34,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:34,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:21:34,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:34,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:21:34,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:21:34,126 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:21:34,237 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2023-11-21 22:21:34,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:21:34,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-21 22:21:34,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:21:34,238 INFO L225 Difference]: With dead ends: 82 [2023-11-21 22:21:34,238 INFO L226 Difference]: Without dead ends: 80 [2023-11-21 22:21:34,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:21:34,239 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 78 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:21:34,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 130 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:21:34,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-21 22:21:34,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 29. [2023-11-21 22:21:34,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-11-21 22:21:34,243 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2023-11-21 22:21:34,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:21:34,243 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-11-21 22:21:34,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-11-21 22:21:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-21 22:21:34,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:21:34,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:34,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 22:21:34,244 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-11-21 22:21:34,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash -223572023, now seen corresponding path program 1 times [2023-11-21 22:21:34,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:34,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817817869] [2023-11-21 22:21:34,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:34,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:34,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:34,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817817869] [2023-11-21 22:21:34,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817817869] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:34,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:34,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:21:34,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111550251] [2023-11-21 22:21:34,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:34,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:21:34,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:34,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:21:34,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:21:34,391 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:21:34,487 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2023-11-21 22:21:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:21:34,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-21 22:21:34,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:21:34,488 INFO L225 Difference]: With dead ends: 55 [2023-11-21 22:21:34,488 INFO L226 Difference]: Without dead ends: 53 [2023-11-21 22:21:34,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-21 22:21:34,489 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 69 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:21:34,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 62 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:21:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-21 22:21:34,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2023-11-21 22:21:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-11-21 22:21:34,492 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2023-11-21 22:21:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:21:34,492 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-21 22:21:34,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:34,493 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-11-21 22:21:34,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-21 22:21:34,493 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:21:34,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:34,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 22:21:34,494 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2023-11-21 22:21:34,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:21:34,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1659206047, now seen corresponding path program 1 times [2023-11-21 22:21:34,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:21:34,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355870891] [2023-11-21 22:21:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:21:34,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:21:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:21:34,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:21:34,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:21:34,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355870891] [2023-11-21 22:21:34,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355870891] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:21:34,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:21:34,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:21:34,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775133680] [2023-11-21 22:21:34,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:21:34,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:21:34,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:21:34,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:21:34,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:21:34,588 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:21:34,730 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2023-11-21 22:21:34,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:21:34,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-21 22:21:34,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:21:34,731 INFO L225 Difference]: With dead ends: 120 [2023-11-21 22:21:34,732 INFO L226 Difference]: Without dead ends: 0 [2023-11-21 22:21:34,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:21:34,733 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 130 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:21:34,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 182 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:21:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-21 22:21:34,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-21 22:21:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-21 22:21:34,735 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2023-11-21 22:21:34,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:21:34,735 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-21 22:21:34,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:21:34,736 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-21 22:21:34,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-21 22:21:34,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2023-11-21 22:21:34,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2023-11-21 22:21:34,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2023-11-21 22:21:34,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2023-11-21 22:21:34,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2023-11-21 22:21:34,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2023-11-21 22:21:34,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2023-11-21 22:21:34,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2023-11-21 22:21:34,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2023-11-21 22:21:34,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2023-11-21 22:21:34,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2023-11-21 22:21:34,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2023-11-21 22:21:34,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2023-11-21 22:21:34,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2023-11-21 22:21:34,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2023-11-21 22:21:34,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2023-11-21 22:21:34,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 22:21:34,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-21 22:21:34,749 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2023-11-21 22:21:34,750 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2023-11-21 22:21:34,750 INFO L899 garLoopResultBuilder]: For program point L217(line 217) no Hoare annotation was computed. [2023-11-21 22:21:34,750 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 281) no Hoare annotation was computed. [2023-11-21 22:21:34,750 INFO L899 garLoopResultBuilder]: For program point L110(lines 110 123) no Hoare annotation was computed. [2023-11-21 22:21:34,750 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 13 313) no Hoare annotation was computed. [2023-11-21 22:21:34,751 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2023-11-21 22:21:34,751 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 300) no Hoare annotation was computed. [2023-11-21 22:21:34,751 INFO L899 garLoopResultBuilder]: For program point L193(line 193) no Hoare annotation was computed. [2023-11-21 22:21:34,751 INFO L899 garLoopResultBuilder]: For program point $Ultimate##6(lines 34 305) no Hoare annotation was computed. [2023-11-21 22:21:34,751 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2023-11-21 22:21:34,751 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 127) no Hoare annotation was computed. [2023-11-21 22:21:34,752 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 312) no Hoare annotation was computed. [2023-11-21 22:21:34,752 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 267) no Hoare annotation was computed. [2023-11-21 22:21:34,752 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2023-11-21 22:21:34,752 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 288) no Hoare annotation was computed. [2023-11-21 22:21:34,752 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2023-11-21 22:21:34,753 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 269) no Hoare annotation was computed. [2023-11-21 22:21:34,753 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2023-11-21 22:21:34,753 INFO L899 garLoopResultBuilder]: For program point L153(line 153) no Hoare annotation was computed. [2023-11-21 22:21:34,753 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) no Hoare annotation was computed. [2023-11-21 22:21:34,753 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2023-11-21 22:21:34,753 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 245) no Hoare annotation was computed. [2023-11-21 22:21:34,754 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 273) no Hoare annotation was computed. [2023-11-21 22:21:34,754 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-21 22:21:34,754 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 294) no Hoare annotation was computed. [2023-11-21 22:21:34,754 INFO L899 garLoopResultBuilder]: For program point $Ultimate##4(lines 30 311) no Hoare annotation was computed. [2023-11-21 22:21:34,754 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 141) no Hoare annotation was computed. [2023-11-21 22:21:34,755 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-11-21 22:21:34,755 INFO L899 garLoopResultBuilder]: For program point L245(line 245) no Hoare annotation was computed. [2023-11-21 22:21:34,755 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-11-21 22:21:34,755 INFO L899 garLoopResultBuilder]: For program point L229(line 229) no Hoare annotation was computed. [2023-11-21 22:21:34,755 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 279) no Hoare annotation was computed. [2023-11-21 22:21:34,755 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2023-11-21 22:21:34,756 INFO L899 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2023-11-21 22:21:34,756 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 283) no Hoare annotation was computed. [2023-11-21 22:21:34,756 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 125) no Hoare annotation was computed. [2023-11-21 22:21:34,756 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 265) no Hoare annotation was computed. [2023-11-21 22:21:34,756 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 165) no Hoare annotation was computed. [2023-11-21 22:21:34,756 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 286) no Hoare annotation was computed. [2023-11-21 22:21:34,757 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2023-11-21 22:21:34,757 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 129) no Hoare annotation was computed. [2023-11-21 22:21:34,757 INFO L899 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2023-11-21 22:21:34,757 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 285) no Hoare annotation was computed. [2023-11-21 22:21:34,757 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-21 22:21:34,758 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 153) no Hoare annotation was computed. [2023-11-21 22:21:34,758 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 271) no Hoare annotation was computed. [2023-11-21 22:21:34,758 INFO L899 garLoopResultBuilder]: For program point L141(line 141) no Hoare annotation was computed. [2023-11-21 22:21:34,758 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2023-11-21 22:21:34,758 INFO L899 garLoopResultBuilder]: For program point L257(line 257) no Hoare annotation was computed. [2023-11-21 22:21:34,758 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 275) no Hoare annotation was computed. [2023-11-21 22:21:34,759 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-11-21 22:21:34,759 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 193) no Hoare annotation was computed. [2023-11-21 22:21:34,759 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2023-11-21 22:21:34,759 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 277) no Hoare annotation was computed. [2023-11-21 22:21:34,759 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-21 22:21:34,760 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 229) no Hoare annotation was computed. [2023-11-21 22:21:34,760 INFO L899 garLoopResultBuilder]: For program point L68(lines 38 294) no Hoare annotation was computed. [2023-11-21 22:21:34,763 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:21:34,766 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:21:34,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:21:34 BoogieIcfgContainer [2023-11-21 22:21:34,772 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:21:34,772 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:21:34,773 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:21:34,773 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:21:34,773 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:21:30" (3/4) ... [2023-11-21 22:21:34,776 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-21 22:21:34,788 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-11-21 22:21:34,788 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-21 22:21:34,789 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-21 22:21:34,790 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-21 22:21:34,897 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 22:21:34,897 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx/witness.yml [2023-11-21 22:21:34,897 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:21:34,898 INFO L158 Benchmark]: Toolchain (without parser) took 5196.62ms. Allocated memory was 138.4MB in the beginning and 199.2MB in the end (delta: 60.8MB). Free memory was 92.9MB in the beginning and 75.2MB in the end (delta: 17.7MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. [2023-11-21 22:21:34,899 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 138.4MB. Free memory is still 107.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:21:34,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.32ms. Allocated memory is still 138.4MB. Free memory was 92.4MB in the beginning and 75.0MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-21 22:21:34,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.84ms. Allocated memory is still 138.4MB. Free memory was 75.0MB in the beginning and 72.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:21:34,900 INFO L158 Benchmark]: Boogie Preprocessor took 46.88ms. Allocated memory is still 138.4MB. Free memory was 72.9MB in the beginning and 70.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:21:34,900 INFO L158 Benchmark]: RCFGBuilder took 543.30ms. Allocated memory is still 138.4MB. Free memory was 70.8MB in the beginning and 55.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-21 22:21:34,901 INFO L158 Benchmark]: TraceAbstraction took 4040.58ms. Allocated memory was 138.4MB in the beginning and 199.2MB in the end (delta: 60.8MB). Free memory was 54.7MB in the beginning and 81.5MB in the end (delta: -26.8MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2023-11-21 22:21:34,901 INFO L158 Benchmark]: Witness Printer took 125.24ms. Allocated memory is still 199.2MB. Free memory was 81.5MB in the beginning and 75.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-21 22:21:34,904 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 138.4MB. Free memory is still 107.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.32ms. Allocated memory is still 138.4MB. Free memory was 92.4MB in the beginning and 75.0MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.84ms. Allocated memory is still 138.4MB. Free memory was 75.0MB in the beginning and 72.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.88ms. Allocated memory is still 138.4MB. Free memory was 72.9MB in the beginning and 70.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 543.30ms. Allocated memory is still 138.4MB. Free memory was 70.8MB in the beginning and 55.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4040.58ms. Allocated memory was 138.4MB in the beginning and 199.2MB in the end (delta: 60.8MB). Free memory was 54.7MB in the beginning and 81.5MB in the end (delta: -26.8MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Witness Printer took 125.24ms. Allocated memory is still 199.2MB. Free memory was 81.5MB in the beginning and 75.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1315 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1315 mSDsluCounter, 1528 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 681 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 927 IncrementalHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 847 mSDtfsCounter, 927 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 436 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 0 LocationsWithAnnotation, 0 PreInvPairs, 0 NumberOfFragments, 0 HoareAnnotationTreeSize, 0 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 0 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 678 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-21 22:21:34,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3bbf8a23-c435-4376-b405-5a4855084e93/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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