./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 08:25:04,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 08:25:04,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 08:25:04,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 08:25:04,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 08:25:04,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 08:25:04,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 08:25:04,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 08:25:04,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 08:25:04,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 08:25:04,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 08:25:04,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 08:25:04,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 08:25:04,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 08:25:04,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 08:25:04,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 08:25:04,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 08:25:04,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 08:25:04,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 08:25:04,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 08:25:04,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 08:25:04,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 08:25:04,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 08:25:04,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 08:25:04,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 08:25:04,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 08:25:04,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 08:25:04,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 08:25:04,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 08:25:04,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 08:25:04,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 08:25:04,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 08:25:04,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 08:25:04,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 08:25:04,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 08:25:04,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 08:25:04,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 08:25:04,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 08:25:04,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 08:25:04,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 08:25:04,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 08:25:04,432 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-07 08:25:04,479 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 08:25:04,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 08:25:04,480 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 08:25:04,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 08:25:04,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 08:25:04,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 08:25:04,489 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 08:25:04,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 08:25:04,490 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 08:25:04,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 08:25:04,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 08:25:04,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 08:25:04,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 08:25:04,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 08:25:04,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 08:25:04,492 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 08:25:04,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 08:25:04,493 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 08:25:04,493 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 08:25:04,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 08:25:04,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 08:25:04,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 08:25:04,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:25:04,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 08:25:04,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 08:25:04,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 08:25:04,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 08:25:04,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 08:25:04,495 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 08:25:04,497 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 08:25:04,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 08:25:04,497 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 08:25:04,497 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/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_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 [2021-11-07 08:25:04,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 08:25:04,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 08:25:04,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 08:25:04,851 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 08:25:04,852 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 08:25:04,853 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2021-11-07 08:25:04,953 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/data/56ea31b22/35bb0f9700964b1a94b088bdec252215/FLAG5634ba4a3 [2021-11-07 08:25:05,475 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 08:25:05,477 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2021-11-07 08:25:05,490 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/data/56ea31b22/35bb0f9700964b1a94b088bdec252215/FLAG5634ba4a3 [2021-11-07 08:25:05,817 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/data/56ea31b22/35bb0f9700964b1a94b088bdec252215 [2021-11-07 08:25:05,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 08:25:05,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 08:25:05,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 08:25:05,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 08:25:05,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 08:25:05,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:25:05" (1/1) ... [2021-11-07 08:25:05,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d315da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:05, skipping insertion in model container [2021-11-07 08:25:05,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:25:05" (1/1) ... [2021-11-07 08:25:05,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 08:25:05,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 08:25:06,066 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2021-11-07 08:25:06,072 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2021-11-07 08:25:06,074 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2021-11-07 08:25:06,078 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2021-11-07 08:25:06,080 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2021-11-07 08:25:06,083 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2021-11-07 08:25:06,085 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2021-11-07 08:25:06,088 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2021-11-07 08:25:06,090 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2021-11-07 08:25:06,098 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2021-11-07 08:25:06,100 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2021-11-07 08:25:06,103 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2021-11-07 08:25:06,109 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2021-11-07 08:25:06,111 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2021-11-07 08:25:06,113 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2021-11-07 08:25:06,115 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2021-11-07 08:25:06,116 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2021-11-07 08:25:06,118 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2021-11-07 08:25:06,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:25:06,135 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 08:25:06,149 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2021-11-07 08:25:06,152 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2021-11-07 08:25:06,153 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2021-11-07 08:25:06,156 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2021-11-07 08:25:06,157 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2021-11-07 08:25:06,159 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2021-11-07 08:25:06,161 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2021-11-07 08:25:06,163 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2021-11-07 08:25:06,165 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2021-11-07 08:25:06,168 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2021-11-07 08:25:06,169 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2021-11-07 08:25:06,172 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2021-11-07 08:25:06,174 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2021-11-07 08:25:06,175 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2021-11-07 08:25:06,177 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2021-11-07 08:25:06,179 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2021-11-07 08:25:06,181 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2021-11-07 08:25:06,182 WARN L228 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_2f267a4e-b848-46b5-b144-c93c7bb2a453/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2021-11-07 08:25:06,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:25:06,201 INFO L208 MainTranslator]: Completed translation [2021-11-07 08:25:06,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:06 WrapperNode [2021-11-07 08:25:06,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 08:25:06,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 08:25:06,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 08:25:06,204 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 08:25:06,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:06" (1/1) ... [2021-11-07 08:25:06,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:06" (1/1) ... [2021-11-07 08:25:06,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 08:25:06,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 08:25:06,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 08:25:06,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 08:25:06,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:06" (1/1) ... [2021-11-07 08:25:06,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:06" (1/1) ... [2021-11-07 08:25:06,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:06" (1/1) ... [2021-11-07 08:25:06,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:06" (1/1) ... [2021-11-07 08:25:06,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:06" (1/1) ... [2021-11-07 08:25:06,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:06" (1/1) ... [2021-11-07 08:25:06,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:06" (1/1) ... [2021-11-07 08:25:06,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 08:25:06,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 08:25:06,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 08:25:06,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 08:25:06,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:06" (1/1) ... [2021-11-07 08:25:06,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:25:06,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:25:06,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 08:25:06,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 08:25:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 08:25:06,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 08:25:06,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 08:25:06,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 08:25:06,834 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 08:25:06,835 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 08:25:06,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:25:06 BoogieIcfgContainer [2021-11-07 08:25:06,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 08:25:06,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 08:25:06,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 08:25:06,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 08:25:06,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:25:05" (1/3) ... [2021-11-07 08:25:06,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4761998f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:25:06, skipping insertion in model container [2021-11-07 08:25:06,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:06" (2/3) ... [2021-11-07 08:25:06,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4761998f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:25:06, skipping insertion in model container [2021-11-07 08:25:06,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:25:06" (3/3) ... [2021-11-07 08:25:06,866 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2021-11-07 08:25:06,873 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 08:25:06,874 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2021-11-07 08:25:06,953 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 08:25:06,961 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 08:25:06,962 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-11-07 08:25:06,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 08:25:07,005 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:07,005 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:07,018 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:07,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:07,033 INFO L85 PathProgramCache]: Analyzing trace with hash 123910062, now seen corresponding path program 1 times [2021-11-07 08:25:07,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:07,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911597493] [2021-11-07 08:25:07,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:07,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:07,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:07,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911597493] [2021-11-07 08:25:07,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911597493] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:07,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:07,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:25:07,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489835507] [2021-11-07 08:25:07,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:25:07,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:07,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:25:07,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:25:07,440 INFO L87 Difference]: Start difference. First operand has 75 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 0 states have call successors, (0), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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) [2021-11-07 08:25:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:07,606 INFO L93 Difference]: Finished difference Result 123 states and 164 transitions. [2021-11-07 08:25:07,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:25:07,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 [2021-11-07 08:25:07,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:07,618 INFO L225 Difference]: With dead ends: 123 [2021-11-07 08:25:07,619 INFO L226 Difference]: Without dead ends: 107 [2021-11-07 08:25:07,622 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:25:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-11-07 08:25:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2021-11-07 08:25:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2021-11-07 08:25:07,664 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 8 [2021-11-07 08:25:07,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:07,665 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2021-11-07 08:25:07,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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) [2021-11-07 08:25:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2021-11-07 08:25:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 08:25:07,666 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:07,666 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:07,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 08:25:07,667 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:07,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash 120339118, now seen corresponding path program 1 times [2021-11-07 08:25:07,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:07,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231959640] [2021-11-07 08:25:07,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:07,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:07,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:07,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231959640] [2021-11-07 08:25:07,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231959640] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:07,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:07,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:25:07,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832796229] [2021-11-07 08:25:07,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:25:07,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:07,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:25:07,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:25:07,737 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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) [2021-11-07 08:25:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:07,806 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2021-11-07 08:25:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:25:07,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 [2021-11-07 08:25:07,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:07,808 INFO L225 Difference]: With dead ends: 107 [2021-11-07 08:25:07,809 INFO L226 Difference]: Without dead ends: 105 [2021-11-07 08:25:07,810 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:25:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-07 08:25:07,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2021-11-07 08:25:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.392156862745098) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2021-11-07 08:25:07,819 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 8 [2021-11-07 08:25:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:07,820 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2021-11-07 08:25:07,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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) [2021-11-07 08:25:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2021-11-07 08:25:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 08:25:07,821 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:07,822 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:07,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 08:25:07,822 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:07,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:07,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2031737892, now seen corresponding path program 1 times [2021-11-07 08:25:07,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:07,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093362328] [2021-11-07 08:25:07,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:07,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:07,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:07,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093362328] [2021-11-07 08:25:07,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093362328] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:07,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:07,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:25:07,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020651940] [2021-11-07 08:25:07,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:25:07,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:07,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:25:07,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:25:07,899 INFO L87 Difference]: Start difference. First operand 67 states and 71 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) [2021-11-07 08:25:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:07,985 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-11-07 08:25:07,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:25:07,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 08:25:07,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:07,987 INFO L225 Difference]: With dead ends: 69 [2021-11-07 08:25:07,987 INFO L226 Difference]: Without dead ends: 67 [2021-11-07 08:25:07,988 INFO L786 BasicCegarLoop]: 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 [2021-11-07 08:25:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-11-07 08:25:07,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2021-11-07 08:25:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.38) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-11-07 08:25:07,996 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 11 [2021-11-07 08:25:07,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:07,997 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-11-07 08:25:07,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:07,997 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-11-07 08:25:07,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 08:25:07,998 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:07,998 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:07,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 08:25:07,999 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:08,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:08,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1271153903, now seen corresponding path program 1 times [2021-11-07 08:25:08,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:08,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267955804] [2021-11-07 08:25:08,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:08,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:08,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:08,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267955804] [2021-11-07 08:25:08,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267955804] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:08,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:08,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:25:08,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167620126] [2021-11-07 08:25:08,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:25:08,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:08,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:25:08,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:25:08,062 INFO L87 Difference]: Start difference. First operand 65 states and 69 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) [2021-11-07 08:25:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:08,141 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2021-11-07 08:25:08,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:25:08,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 08:25:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:08,143 INFO L225 Difference]: With dead ends: 67 [2021-11-07 08:25:08,143 INFO L226 Difference]: Without dead ends: 65 [2021-11-07 08:25:08,143 INFO L786 BasicCegarLoop]: 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 [2021-11-07 08:25:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-07 08:25:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2021-11-07 08:25:08,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2021-11-07 08:25:08,150 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 11 [2021-11-07 08:25:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:08,151 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2021-11-07 08:25:08,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2021-11-07 08:25:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 08:25:08,152 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:08,152 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:08,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 08:25:08,153 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:08,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:08,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1440630601, now seen corresponding path program 1 times [2021-11-07 08:25:08,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:08,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431708267] [2021-11-07 08:25:08,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:08,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:08,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:08,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431708267] [2021-11-07 08:25:08,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431708267] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:08,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:08,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:25:08,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376346860] [2021-11-07 08:25:08,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:25:08,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:08,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:25:08,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:25:08,207 INFO L87 Difference]: Start difference. First operand 63 states and 67 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) [2021-11-07 08:25:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:08,256 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2021-11-07 08:25:08,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:25:08,256 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 [2021-11-07 08:25:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:08,257 INFO L225 Difference]: With dead ends: 65 [2021-11-07 08:25:08,257 INFO L226 Difference]: Without dead ends: 61 [2021-11-07 08:25:08,258 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:25:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-07 08:25:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2021-11-07 08:25:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-11-07 08:25:08,264 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 12 [2021-11-07 08:25:08,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:08,265 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-11-07 08:25:08,265 INFO L471 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) [2021-11-07 08:25:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-11-07 08:25:08,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 08:25:08,266 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:08,266 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:08,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 08:25:08,267 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:08,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:08,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1440142029, now seen corresponding path program 1 times [2021-11-07 08:25:08,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:08,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092932374] [2021-11-07 08:25:08,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:08,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:08,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:08,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092932374] [2021-11-07 08:25:08,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092932374] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:08,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:08,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:25:08,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932035908] [2021-11-07 08:25:08,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:25:08,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:08,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:25:08,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:25:08,323 INFO L87 Difference]: Start difference. First operand 59 states and 63 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) [2021-11-07 08:25:08,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:08,415 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2021-11-07 08:25:08,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:25:08,415 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 [2021-11-07 08:25:08,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:08,416 INFO L225 Difference]: With dead ends: 95 [2021-11-07 08:25:08,417 INFO L226 Difference]: Without dead ends: 93 [2021-11-07 08:25:08,417 INFO L786 BasicCegarLoop]: 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 [2021-11-07 08:25:08,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-07 08:25:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 57. [2021-11-07 08:25:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:08,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-11-07 08:25:08,423 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 12 [2021-11-07 08:25:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:08,424 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-11-07 08:25:08,424 INFO L471 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) [2021-11-07 08:25:08,424 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-11-07 08:25:08,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 08:25:08,425 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:08,425 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:08,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 08:25:08,426 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:08,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:08,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1440126141, now seen corresponding path program 1 times [2021-11-07 08:25:08,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:08,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729248439] [2021-11-07 08:25:08,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:08,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:08,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:08,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:08,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729248439] [2021-11-07 08:25:08,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729248439] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:08,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:08,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:25:08,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767977479] [2021-11-07 08:25:08,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:25:08,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:08,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:25:08,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:25:08,492 INFO L87 Difference]: Start difference. First operand 57 states and 61 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) [2021-11-07 08:25:08,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:08,608 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2021-11-07 08:25:08,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:25:08,609 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 [2021-11-07 08:25:08,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:08,612 INFO L225 Difference]: With dead ends: 100 [2021-11-07 08:25:08,612 INFO L226 Difference]: Without dead ends: 98 [2021-11-07 08:25:08,613 INFO L786 BasicCegarLoop]: 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 [2021-11-07 08:25:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-07 08:25:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 55. [2021-11-07 08:25:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2021-11-07 08:25:08,633 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 12 [2021-11-07 08:25:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:08,634 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-11-07 08:25:08,635 INFO L471 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) [2021-11-07 08:25:08,635 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2021-11-07 08:25:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 08:25:08,636 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:08,637 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:08,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 08:25:08,637 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:08,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:08,638 INFO L85 PathProgramCache]: Analyzing trace with hash -751061257, now seen corresponding path program 1 times [2021-11-07 08:25:08,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:08,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527541537] [2021-11-07 08:25:08,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:08,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:08,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:08,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527541537] [2021-11-07 08:25:08,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527541537] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:08,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:08,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:25:08,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261215766] [2021-11-07 08:25:08,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:25:08,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:08,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:25:08,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:25:08,707 INFO L87 Difference]: Start difference. First operand 55 states and 59 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) [2021-11-07 08:25:08,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:08,757 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2021-11-07 08:25:08,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:25:08,758 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 [2021-11-07 08:25:08,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:08,758 INFO L225 Difference]: With dead ends: 57 [2021-11-07 08:25:08,759 INFO L226 Difference]: Without dead ends: 53 [2021-11-07 08:25:08,760 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:25:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-07 08:25:08,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2021-11-07 08:25:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.3414634146341464) 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) [2021-11-07 08:25:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2021-11-07 08:25:08,772 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 12 [2021-11-07 08:25:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:08,773 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2021-11-07 08:25:08,773 INFO L471 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) [2021-11-07 08:25:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2021-11-07 08:25:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 08:25:08,779 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:08,780 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:08,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 08:25:08,780 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:08,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1694725733, now seen corresponding path program 1 times [2021-11-07 08:25:08,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:08,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193870707] [2021-11-07 08:25:08,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:08,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:08,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:08,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193870707] [2021-11-07 08:25:08,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193870707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:08,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:08,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 08:25:08,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880058380] [2021-11-07 08:25:08,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:25:08,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:08,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:25:08,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:25:08,905 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) [2021-11-07 08:25:09,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:09,067 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2021-11-07 08:25:09,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 08:25:09,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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 [2021-11-07 08:25:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:09,069 INFO L225 Difference]: With dead ends: 118 [2021-11-07 08:25:09,069 INFO L226 Difference]: Without dead ends: 116 [2021-11-07 08:25:09,070 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:25:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-07 08:25:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 56. [2021-11-07 08:25:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.326086956521739) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-11-07 08:25:09,089 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 13 [2021-11-07 08:25:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:09,089 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-11-07 08:25:09,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) [2021-11-07 08:25:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-11-07 08:25:09,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 08:25:09,094 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:09,094 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:09,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 08:25:09,095 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:09,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:09,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1694233189, now seen corresponding path program 1 times [2021-11-07 08:25:09,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:09,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263655604] [2021-11-07 08:25:09,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:09,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:09,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:09,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:09,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263655604] [2021-11-07 08:25:09,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263655604] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:09,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:09,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 08:25:09,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536838585] [2021-11-07 08:25:09,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:25:09,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:09,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:25:09,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:25:09,264 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) [2021-11-07 08:25:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:09,388 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2021-11-07 08:25:09,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 08:25:09,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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 [2021-11-07 08:25:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:09,390 INFO L225 Difference]: With dead ends: 116 [2021-11-07 08:25:09,390 INFO L226 Difference]: Without dead ends: 114 [2021-11-07 08:25:09,391 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:25:09,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-11-07 08:25:09,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 58. [2021-11-07 08:25:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.3125) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2021-11-07 08:25:09,395 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 13 [2021-11-07 08:25:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:09,395 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2021-11-07 08:25:09,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) [2021-11-07 08:25:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2021-11-07 08:25:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 08:25:09,397 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:09,397 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:09,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 08:25:09,397 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:09,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:09,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1791008026, now seen corresponding path program 1 times [2021-11-07 08:25:09,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:09,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106663714] [2021-11-07 08:25:09,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:09,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:09,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:09,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106663714] [2021-11-07 08:25:09,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106663714] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:09,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:09,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:25:09,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496361545] [2021-11-07 08:25:09,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:25:09,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:09,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:25:09,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:25:09,442 INFO L87 Difference]: Start difference. First operand 58 states and 63 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) [2021-11-07 08:25:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:09,516 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2021-11-07 08:25:09,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:25:09,517 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 [2021-11-07 08:25:09,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:09,518 INFO L225 Difference]: With dead ends: 76 [2021-11-07 08:25:09,519 INFO L226 Difference]: Without dead ends: 74 [2021-11-07 08:25:09,519 INFO L786 BasicCegarLoop]: 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 [2021-11-07 08:25:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-07 08:25:09,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2021-11-07 08:25:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-11-07 08:25:09,525 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 13 [2021-11-07 08:25:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:09,525 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-11-07 08:25:09,525 INFO L471 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) [2021-11-07 08:25:09,526 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-11-07 08:25:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 08:25:09,526 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:09,527 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:09,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 08:25:09,527 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:09,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:09,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1789284122, now seen corresponding path program 1 times [2021-11-07 08:25:09,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:09,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863790270] [2021-11-07 08:25:09,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:09,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:09,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:09,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863790270] [2021-11-07 08:25:09,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863790270] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:09,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:09,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:25:09,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817480984] [2021-11-07 08:25:09,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:25:09,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:09,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:25:09,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:25:09,575 INFO L87 Difference]: Start difference. First operand 56 states and 61 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) [2021-11-07 08:25:09,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:09,641 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2021-11-07 08:25:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:25:09,642 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 [2021-11-07 08:25:09,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:09,642 INFO L225 Difference]: With dead ends: 57 [2021-11-07 08:25:09,643 INFO L226 Difference]: Without dead ends: 55 [2021-11-07 08:25:09,643 INFO L786 BasicCegarLoop]: 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 [2021-11-07 08:25:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-11-07 08:25:09,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2021-11-07 08:25:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2021-11-07 08:25:09,648 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2021-11-07 08:25:09,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:09,648 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2021-11-07 08:25:09,648 INFO L471 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) [2021-11-07 08:25:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2021-11-07 08:25:09,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 08:25:09,649 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:09,649 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:09,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 08:25:09,650 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:09,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:09,651 INFO L85 PathProgramCache]: Analyzing trace with hash 313330138, now seen corresponding path program 1 times [2021-11-07 08:25:09,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:09,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701887028] [2021-11-07 08:25:09,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:09,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:09,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:09,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701887028] [2021-11-07 08:25:09,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701887028] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:09,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:09,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 08:25:09,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328489234] [2021-11-07 08:25:09,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:25:09,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:09,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:25:09,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:25:09,750 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) [2021-11-07 08:25:09,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:09,860 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2021-11-07 08:25:09,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 08:25:09,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 [2021-11-07 08:25:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:09,863 INFO L225 Difference]: With dead ends: 92 [2021-11-07 08:25:09,863 INFO L226 Difference]: Without dead ends: 90 [2021-11-07 08:25:09,864 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:25:09,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-11-07 08:25:09,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2021-11-07 08:25:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2021-11-07 08:25:09,870 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 14 [2021-11-07 08:25:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:09,870 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2021-11-07 08:25:09,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) [2021-11-07 08:25:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2021-11-07 08:25:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 08:25:09,871 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:09,871 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:09,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 08:25:09,872 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:09,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash 314877283, now seen corresponding path program 1 times [2021-11-07 08:25:09,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:09,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665862878] [2021-11-07 08:25:09,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:09,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:09,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:09,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:09,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665862878] [2021-11-07 08:25:09,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665862878] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:09,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:09,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:25:09,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712854971] [2021-11-07 08:25:09,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:25:09,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:09,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:25:09,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:25:09,905 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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) [2021-11-07 08:25:09,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:09,977 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2021-11-07 08:25:09,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:25:09,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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 [2021-11-07 08:25:09,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:09,978 INFO L225 Difference]: With dead ends: 80 [2021-11-07 08:25:09,978 INFO L226 Difference]: Without dead ends: 78 [2021-11-07 08:25:09,979 INFO L786 BasicCegarLoop]: 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 [2021-11-07 08:25:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-07 08:25:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2021-11-07 08:25:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2021-11-07 08:25:09,989 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 14 [2021-11-07 08:25:09,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:09,990 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2021-11-07 08:25:09,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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) [2021-11-07 08:25:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2021-11-07 08:25:09,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 08:25:09,991 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:09,991 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:09,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 08:25:09,992 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:09,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash 366771218, now seen corresponding path program 1 times [2021-11-07 08:25:09,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:09,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340319144] [2021-11-07 08:25:09,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:09,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:10,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:10,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340319144] [2021-11-07 08:25:10,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340319144] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:10,107 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:10,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 08:25:10,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155230912] [2021-11-07 08:25:10,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:25:10,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:10,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:25:10,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:25:10,120 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) [2021-11-07 08:25:10,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:10,203 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2021-11-07 08:25:10,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 08:25:10,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 [2021-11-07 08:25:10,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:10,204 INFO L225 Difference]: With dead ends: 70 [2021-11-07 08:25:10,204 INFO L226 Difference]: Without dead ends: 66 [2021-11-07 08:25:10,206 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:25:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-07 08:25:10,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2021-11-07 08:25:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2021-11-07 08:25:10,211 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 14 [2021-11-07 08:25:10,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:10,211 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2021-11-07 08:25:10,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) [2021-11-07 08:25:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2021-11-07 08:25:10,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 08:25:10,212 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:10,212 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:10,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 08:25:10,212 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:10,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:10,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1171265312, now seen corresponding path program 1 times [2021-11-07 08:25:10,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:10,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568934200] [2021-11-07 08:25:10,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:10,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:10,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:10,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568934200] [2021-11-07 08:25:10,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568934200] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:10,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:10,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 08:25:10,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357413185] [2021-11-07 08:25:10,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:25:10,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:10,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:25:10,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:25:10,321 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2021-11-07 08:25:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:10,426 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2021-11-07 08:25:10,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 08:25:10,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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 [2021-11-07 08:25:10,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:10,428 INFO L225 Difference]: With dead ends: 87 [2021-11-07 08:25:10,428 INFO L226 Difference]: Without dead ends: 85 [2021-11-07 08:25:10,429 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:25:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-07 08:25:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 62. [2021-11-07 08:25:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 61 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2021-11-07 08:25:10,434 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 15 [2021-11-07 08:25:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:10,435 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2021-11-07 08:25:10,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2021-11-07 08:25:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2021-11-07 08:25:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 08:25:10,435 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:10,436 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:10,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 08:25:10,436 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:10,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:10,437 INFO L85 PathProgramCache]: Analyzing trace with hash 462679229, now seen corresponding path program 1 times [2021-11-07 08:25:10,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:10,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178929963] [2021-11-07 08:25:10,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:10,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:10,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:10,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178929963] [2021-11-07 08:25:10,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178929963] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:10,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:10,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:25:10,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781342109] [2021-11-07 08:25:10,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:25:10,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:10,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:25:10,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:25:10,481 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) [2021-11-07 08:25:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:10,508 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2021-11-07 08:25:10,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:25:10,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 [2021-11-07 08:25:10,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:10,509 INFO L225 Difference]: With dead ends: 62 [2021-11-07 08:25:10,509 INFO L226 Difference]: Without dead ends: 60 [2021-11-07 08:25:10,510 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:25:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-07 08:25:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-11-07 08:25:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:10,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2021-11-07 08:25:10,516 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 16 [2021-11-07 08:25:10,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:10,518 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2021-11-07 08:25:10,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) [2021-11-07 08:25:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2021-11-07 08:25:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 08:25:10,519 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:10,519 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:10,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 08:25:10,519 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:10,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:10,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1458158324, now seen corresponding path program 1 times [2021-11-07 08:25:10,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:10,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234455676] [2021-11-07 08:25:10,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:10,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:10,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:10,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234455676] [2021-11-07 08:25:10,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234455676] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:10,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:10,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:25:10,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402009513] [2021-11-07 08:25:10,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:25:10,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:10,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:25:10,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:25:10,561 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) [2021-11-07 08:25:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:10,596 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2021-11-07 08:25:10,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:25:10,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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 [2021-11-07 08:25:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:10,597 INFO L225 Difference]: With dead ends: 60 [2021-11-07 08:25:10,597 INFO L226 Difference]: Without dead ends: 56 [2021-11-07 08:25:10,598 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:25:10,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-07 08:25:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-11-07 08:25:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2021-11-07 08:25:10,603 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 17 [2021-11-07 08:25:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:10,603 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2021-11-07 08:25:10,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) [2021-11-07 08:25:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2021-11-07 08:25:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 08:25:10,604 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:10,604 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:10,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 08:25:10,605 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:10,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:10,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1747922500, now seen corresponding path program 1 times [2021-11-07 08:25:10,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:10,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837680622] [2021-11-07 08:25:10,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:10,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:10,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:10,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837680622] [2021-11-07 08:25:10,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837680622] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:25:10,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887346353] [2021-11-07 08:25:10,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:10,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:25:10,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:25:10,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:25:10,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 08:25:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:10,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 08:25:10,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:25:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:11,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887346353] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:25:11,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:25:11,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2021-11-07 08:25:11,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186604695] [2021-11-07 08:25:11,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 08:25:11,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:11,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 08:25:11,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-11-07 08:25:11,265 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:11,538 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2021-11-07 08:25:11,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 08:25:11,539 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 08:25:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:11,540 INFO L225 Difference]: With dead ends: 121 [2021-11-07 08:25:11,540 INFO L226 Difference]: Without dead ends: 119 [2021-11-07 08:25:11,541 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-11-07 08:25:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-07 08:25:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 52. [2021-11-07 08:25:11,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2021-11-07 08:25:11,546 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 18 [2021-11-07 08:25:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:11,546 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2021-11-07 08:25:11,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2021-11-07 08:25:11,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 08:25:11,547 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:11,547 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:11,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-07 08:25:11,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:25:11,748 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:11,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1748415044, now seen corresponding path program 1 times [2021-11-07 08:25:11,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:11,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251156038] [2021-11-07 08:25:11,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:11,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:11,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:11,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251156038] [2021-11-07 08:25:11,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251156038] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:25:11,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569766929] [2021-11-07 08:25:11,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:11,826 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:25:11,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:25:11,830 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 08:25:11,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 08:25:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:11,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 08:25:11,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 08:25:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:12,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569766929] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 08:25:12,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 08:25:12,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2021-11-07 08:25:12,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767408373] [2021-11-07 08:25:12,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 08:25:12,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:12,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 08:25:12,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-11-07 08:25:12,281 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:12,537 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2021-11-07 08:25:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 08:25:12,538 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-07 08:25:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:12,538 INFO L225 Difference]: With dead ends: 100 [2021-11-07 08:25:12,539 INFO L226 Difference]: Without dead ends: 98 [2021-11-07 08:25:12,539 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-11-07 08:25:12,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-07 08:25:12,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 45. [2021-11-07 08:25:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 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) [2021-11-07 08:25:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2021-11-07 08:25:12,545 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2021-11-07 08:25:12,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:12,546 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2021-11-07 08:25:12,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:12,547 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2021-11-07 08:25:12,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 08:25:12,547 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:12,547 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:12,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 08:25:12,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 08:25:12,770 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:12,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:12,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2026613132, now seen corresponding path program 1 times [2021-11-07 08:25:12,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:12,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757562030] [2021-11-07 08:25:12,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:12,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:12,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:12,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757562030] [2021-11-07 08:25:12,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757562030] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:12,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:12,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 08:25:12,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335511427] [2021-11-07 08:25:12,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:25:12,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:12,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:25:12,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:25:12,830 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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) [2021-11-07 08:25:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:12,916 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2021-11-07 08:25:12,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 08:25:12,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 [2021-11-07 08:25:12,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:12,917 INFO L225 Difference]: With dead ends: 60 [2021-11-07 08:25:12,917 INFO L226 Difference]: Without dead ends: 58 [2021-11-07 08:25:12,917 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 08:25:12,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-11-07 08:25:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2021-11-07 08:25:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2021-11-07 08:25:12,927 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2021-11-07 08:25:12,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:12,928 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2021-11-07 08:25:12,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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) [2021-11-07 08:25:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2021-11-07 08:25:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 08:25:12,928 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:12,928 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:12,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 08:25:12,929 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:12,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:12,929 INFO L85 PathProgramCache]: Analyzing trace with hash -684716563, now seen corresponding path program 1 times [2021-11-07 08:25:12,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:12,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520513609] [2021-11-07 08:25:12,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:12,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:13,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:13,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520513609] [2021-11-07 08:25:13,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520513609] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:13,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:13,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 08:25:13,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157133804] [2021-11-07 08:25:13,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 08:25:13,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:13,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 08:25:13,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:25:13,003 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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) [2021-11-07 08:25:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:13,075 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2021-11-07 08:25:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 08:25:13,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 [2021-11-07 08:25:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:13,076 INFO L225 Difference]: With dead ends: 52 [2021-11-07 08:25:13,077 INFO L226 Difference]: Without dead ends: 50 [2021-11-07 08:25:13,078 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 08:25:13,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-11-07 08:25:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2021-11-07 08:25:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:25:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2021-11-07 08:25:13,083 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 19 [2021-11-07 08:25:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:13,084 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2021-11-07 08:25:13,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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) [2021-11-07 08:25:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2021-11-07 08:25:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 08:25:13,085 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:25:13,085 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:13,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 08:25:13,086 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-11-07 08:25:13,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:25:13,086 INFO L85 PathProgramCache]: Analyzing trace with hash -631275483, now seen corresponding path program 1 times [2021-11-07 08:25:13,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:25:13,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010616679] [2021-11-07 08:25:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:25:13,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:25:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:25:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:25:13,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:25:13,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010616679] [2021-11-07 08:25:13,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010616679] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:25:13,164 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:25:13,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 08:25:13,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934749563] [2021-11-07 08:25:13,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 08:25:13,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:25:13,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 08:25:13,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:25:13,169 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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) [2021-11-07 08:25:13,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:25:13,224 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2021-11-07 08:25:13,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:25:13,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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 [2021-11-07 08:25:13,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:25:13,225 INFO L225 Difference]: With dead ends: 35 [2021-11-07 08:25:13,225 INFO L226 Difference]: Without dead ends: 0 [2021-11-07 08:25:13,225 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:25:13,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-07 08:25:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-07 08:25:13,226 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) [2021-11-07 08:25:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-07 08:25:13,226 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2021-11-07 08:25:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:25:13,226 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-07 08:25:13,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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) [2021-11-07 08:25:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-07 08:25:13,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-07 08:25:13,230 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,231 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,231 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,231 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,231 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,232 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,232 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,232 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,232 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,232 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,233 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,233 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,233 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,233 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,235 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,236 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,236 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,236 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 08:25:13,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-07 08:25:13,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-07 08:25:13,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 08:25:13,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 08:25:13,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 08:25:13,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 08:25:13,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 08:25:13,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 08:25:14,320 INFO L857 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2021-11-07 08:25:14,321 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2021-11-07 08:25:14,321 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 72) no Hoare annotation was computed. [2021-11-07 08:25:14,321 INFO L857 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2021-11-07 08:25:14,321 INFO L857 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2021-11-07 08:25:14,321 INFO L857 garLoopResultBuilder]: For program point L366(line 366) no Hoare annotation was computed. [2021-11-07 08:25:14,321 INFO L857 garLoopResultBuilder]: For program point L333(line 333) no Hoare annotation was computed. [2021-11-07 08:25:14,322 INFO L857 garLoopResultBuilder]: For program point L234(lines 234 242) no Hoare annotation was computed. [2021-11-07 08:25:14,322 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 297) no Hoare annotation was computed. [2021-11-07 08:25:14,322 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 126) no Hoare annotation was computed. [2021-11-07 08:25:14,322 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-07 08:25:14,322 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-07 08:25:14,322 INFO L857 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2021-11-07 08:25:14,322 INFO L857 garLoopResultBuilder]: For program point L309(line 309) no Hoare annotation was computed. [2021-11-07 08:25:14,322 INFO L857 garLoopResultBuilder]: For program point L20(lines 20 401) no Hoare annotation was computed. [2021-11-07 08:25:14,323 INFO L857 garLoopResultBuilder]: For program point L276(lines 276 391) no Hoare annotation was computed. [2021-11-07 08:25:14,323 INFO L860 garLoopResultBuilder]: At program point L400(lines 15 402) the Hoare annotation is: true [2021-11-07 08:25:14,323 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 345) no Hoare annotation was computed. [2021-11-07 08:25:14,323 INFO L857 garLoopResultBuilder]: For program point L70(lines 70 94) no Hoare annotation was computed. [2021-11-07 08:25:14,323 INFO L853 garLoopResultBuilder]: At program point L384(lines 282 391) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)))) (or (and (<= 1 ULTIMATE.start_main_~main__t~0) .cse2) (and .cse2 .cse1))))) (or (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) .cse0 .cse1) (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~19) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~18 0)) .cse0)))) [2021-11-07 08:25:14,324 INFO L853 garLoopResultBuilder]: At program point L351(lines 32 395) the Hoare annotation is: (let ((.cse4 (<= 0 ULTIMATE.start_main_~main__tagbuf_len~0))) (or (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (let ((.cse3 (<= ULTIMATE.start_main_~main__t~0 1))) (let ((.cse0 (let ((.cse5 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0))) (.cse6 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0))) (.cse7 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 0)))) (or (and .cse5 (not (= ULTIMATE.start_main_~main__tagbuf_len~0 0)) .cse3 .cse6 .cse7) (and .cse5 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~19 0)) .cse6 .cse7)))) (.cse1 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~17)) (.cse2 (<= 1 ULTIMATE.start_main_~main__t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~19)))))) (and (not (= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) .cse4 (= ULTIMATE.start_main_~main__t~0 0)))) [2021-11-07 08:25:14,324 INFO L857 garLoopResultBuilder]: For program point L186(lines 186 196) no Hoare annotation was computed. [2021-11-07 08:25:14,324 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 278) no Hoare annotation was computed. [2021-11-07 08:25:14,324 INFO L857 garLoopResultBuilder]: For program point L376(lines 376 385) no Hoare annotation was computed. [2021-11-07 08:25:14,324 INFO L857 garLoopResultBuilder]: For program point L343(lines 343 352) no Hoare annotation was computed. [2021-11-07 08:25:14,324 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2021-11-07 08:25:14,324 INFO L857 garLoopResultBuilder]: For program point L112(lines 112 203) no Hoare annotation was computed. [2021-11-07 08:25:14,325 INFO L857 garLoopResultBuilder]: For program point L236(line 236) no Hoare annotation was computed. [2021-11-07 08:25:14,325 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 333) no Hoare annotation was computed. [2021-11-07 08:25:14,325 INFO L853 garLoopResultBuilder]: At program point L195(lines 56 253) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2021-11-07 08:25:14,325 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2021-11-07 08:25:14,325 INFO L857 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2021-11-07 08:25:14,325 INFO L857 garLoopResultBuilder]: For program point L278(line 278) no Hoare annotation was computed. [2021-11-07 08:25:14,325 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 378) no Hoare annotation was computed. [2021-11-07 08:25:14,326 INFO L857 garLoopResultBuilder]: For program point L105(lines 105 209) no Hoare annotation was computed. [2021-11-07 08:25:14,326 INFO L857 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2021-11-07 08:25:14,326 INFO L857 garLoopResultBuilder]: For program point L39(lines 39 255) no Hoare annotation was computed. [2021-11-07 08:25:14,326 INFO L857 garLoopResultBuilder]: For program point L295(lines 295 317) no Hoare annotation was computed. [2021-11-07 08:25:14,326 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2021-11-07 08:25:14,326 INFO L857 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2021-11-07 08:25:14,326 INFO L857 garLoopResultBuilder]: For program point L378(line 378) no Hoare annotation was computed. [2021-11-07 08:25:14,326 INFO L857 garLoopResultBuilder]: For program point L345(line 345) no Hoare annotation was computed. [2021-11-07 08:25:14,327 INFO L857 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2021-11-07 08:25:14,327 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 366) no Hoare annotation was computed. [2021-11-07 08:25:14,327 INFO L857 garLoopResultBuilder]: For program point L32(lines 32 395) no Hoare annotation was computed. [2021-11-07 08:25:14,327 INFO L857 garLoopResultBuilder]: For program point L288(lines 288 390) no Hoare annotation was computed. [2021-11-07 08:25:14,327 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-07 08:25:14,327 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 244) no Hoare annotation was computed. [2021-11-07 08:25:14,327 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2021-11-07 08:25:14,327 INFO L857 garLoopResultBuilder]: For program point L24(lines 24 396) no Hoare annotation was computed. [2021-11-07 08:25:14,328 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) no Hoare annotation was computed. [2021-11-07 08:25:14,328 INFO L857 garLoopResultBuilder]: For program point L82(lines 82 92) no Hoare annotation was computed. [2021-11-07 08:25:14,328 INFO L857 garLoopResultBuilder]: For program point L140(lines 140 162) no Hoare annotation was computed. [2021-11-07 08:25:14,328 INFO L857 garLoopResultBuilder]: For program point L297(line 297) no Hoare annotation was computed. [2021-11-07 08:25:14,328 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-07 08:25:14,328 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 176) no Hoare annotation was computed. [2021-11-07 08:25:14,328 INFO L857 garLoopResultBuilder]: For program point L124(lines 124 201) no Hoare annotation was computed. [2021-11-07 08:25:14,328 INFO L860 garLoopResultBuilder]: At program point L314(lines 32 395) the Hoare annotation is: true [2021-11-07 08:25:14,329 INFO L857 garLoopResultBuilder]: For program point L215(lines 215 250) no Hoare annotation was computed. [2021-11-07 08:25:14,329 INFO L857 garLoopResultBuilder]: For program point L50(lines 50 253) no Hoare annotation was computed. [2021-11-07 08:25:14,329 INFO L857 garLoopResultBuilder]: For program point L174(lines 174 198) no Hoare annotation was computed. [2021-11-07 08:25:14,329 INFO L857 garLoopResultBuilder]: For program point L364(lines 364 387) no Hoare annotation was computed. [2021-11-07 08:25:14,329 INFO L857 garLoopResultBuilder]: For program point L331(lines 331 354) no Hoare annotation was computed. [2021-11-07 08:25:14,329 INFO L857 garLoopResultBuilder]: For program point L265(lines 265 393) no Hoare annotation was computed. [2021-11-07 08:25:14,329 INFO L857 garLoopResultBuilder]: For program point L133(lines 133 200) no Hoare annotation was computed. [2021-11-07 08:25:14,329 INFO L857 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2021-11-07 08:25:14,330 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 236) no Hoare annotation was computed. [2021-11-07 08:25:14,330 INFO L853 garLoopResultBuilder]: At program point L249(lines 101 251) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2021-11-07 08:25:14,330 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 84) no Hoare annotation was computed. [2021-11-07 08:25:14,330 INFO L857 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2021-11-07 08:25:14,330 INFO L857 garLoopResultBuilder]: For program point L307(lines 307 315) no Hoare annotation was computed. [2021-11-07 08:25:14,330 INFO L857 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2021-11-07 08:25:14,331 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 309) no Hoare annotation was computed. [2021-11-07 08:25:14,331 INFO L857 garLoopResultBuilder]: For program point L101(lines 101 251) no Hoare annotation was computed. [2021-11-07 08:25:14,331 INFO L857 garLoopResultBuilder]: For program point L324(lines 324 389) no Hoare annotation was computed. [2021-11-07 08:25:14,334 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:25:14,335 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 08:25:14,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:25:14 BoogieIcfgContainer [2021-11-07 08:25:14,357 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 08:25:14,358 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 08:25:14,358 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 08:25:14,358 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 08:25:14,359 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:25:06" (3/4) ... [2021-11-07 08:25:14,363 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-07 08:25:14,379 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-11-07 08:25:14,380 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-07 08:25:14,381 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 08:25:14,381 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 08:25:14,486 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/witness.graphml [2021-11-07 08:25:14,486 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 08:25:14,488 INFO L168 Benchmark]: Toolchain (without parser) took 8666.17 ms. Allocated memory was 113.2 MB in the beginning and 142.6 MB in the end (delta: 29.4 MB). Free memory was 74.8 MB in the beginning and 58.3 MB in the end (delta: 16.5 MB). Peak memory consumption was 46.4 MB. Max. memory is 16.1 GB. [2021-11-07 08:25:14,489 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 113.2 MB. Free memory is still 91.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 08:25:14,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.87 ms. Allocated memory is still 113.2 MB. Free memory was 74.6 MB in the beginning and 81.5 MB in the end (delta: -7.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-07 08:25:14,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.50 ms. Allocated memory is still 113.2 MB. Free memory was 81.5 MB in the beginning and 79.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 08:25:14,491 INFO L168 Benchmark]: Boogie Preprocessor took 39.09 ms. Allocated memory is still 113.2 MB. Free memory was 79.5 MB in the beginning and 78.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 08:25:14,492 INFO L168 Benchmark]: RCFGBuilder took 533.02 ms. Allocated memory is still 113.2 MB. Free memory was 78.3 MB in the beginning and 63.6 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-07 08:25:14,492 INFO L168 Benchmark]: TraceAbstraction took 7517.03 ms. Allocated memory was 113.2 MB in the beginning and 142.6 MB in the end (delta: 29.4 MB). Free memory was 63.2 MB in the beginning and 64.6 MB in the end (delta: -1.4 MB). Peak memory consumption was 60.1 MB. Max. memory is 16.1 GB. [2021-11-07 08:25:14,493 INFO L168 Benchmark]: Witness Printer took 128.56 ms. Allocated memory is still 142.6 MB. Free memory was 64.6 MB in the beginning and 58.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 08:25:14,495 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 113.2 MB. Free memory is still 91.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 377.87 ms. Allocated memory is still 113.2 MB. Free memory was 74.6 MB in the beginning and 81.5 MB in the end (delta: -7.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 60.50 ms. Allocated memory is still 113.2 MB. Free memory was 81.5 MB in the beginning and 79.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.09 ms. Allocated memory is still 113.2 MB. Free memory was 79.5 MB in the beginning and 78.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 533.02 ms. Allocated memory is still 113.2 MB. Free memory was 78.3 MB in the beginning and 63.6 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7517.03 ms. Allocated memory was 113.2 MB in the beginning and 142.6 MB in the end (delta: 29.4 MB). Free memory was 63.2 MB in the beginning and 64.6 MB in the end (delta: -1.4 MB). Peak memory consumption was 60.1 MB. Max. memory is 16.1 GB. * Witness Printer took 128.56 ms. Allocated memory is still 142.6 MB. Free memory was 64.6 MB in the beginning and 58.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * 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: 52]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 72]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 84]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 126]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 142]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 154]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 176]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 188]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 224]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 236]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 278]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 297]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 309]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 345]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 366]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 378]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 75 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1028 SDtfs, 1618 SDslu, 1765 SDs, 0 SdLazy, 2051 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=0, InterpolantAutomatonStates: 142, 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, 23 MinimizatonAttempts, 531 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 192 HoareAnnotationTreeSize, 6 FomulaSimplifications, 10686158 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 6 FomulaSimplificationsInter, 2506650 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 1519 SizeOfPredicates, 6 NumberOfNonLiveVariables, 233 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 4/16 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 18 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (main__t < main__tagbuf_len && ((((((((((!(__VERIFIER_assert__cond == 0) && !(main__tagbuf_len == 0)) && main__t <= 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && 1 <= __VERIFIER_assert__cond) && 1 <= main__t) && main__t <= 1) && 0 <= main__tagbuf_len) || (((((((((!(__VERIFIER_assert__cond == 0) && !(main__tagbuf_len == 0)) && main__t <= 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && 1 <= __VERIFIER_assert__cond) && 1 <= main__t) && 0 <= main__tagbuf_len) && 1 <= __VERIFIER_assert__cond))) || ((!(main__t == main__tagbuf_len) && 0 <= main__tagbuf_len) && main__t == 0) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: main__t < main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: (((main__t <= main__tagbuf_len && !(main__t == main__tagbuf_len)) && ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) || (!(__VERIFIER_assert__cond == 0) && main__t == 0))) && main__t == 0) || (((main__t < main__tagbuf_len && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) || (!(__VERIFIER_assert__cond == 0) && main__t == 0))) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-11-07 08:25:14,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f267a4e-b848-46b5-b144-c93c7bb2a453/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE