./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC --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 ef15c4790969d8e640b2241771e44174daa41407 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 00:22:06,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:22:06,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:22:06,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:22:06,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:22:06,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:22:06,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:22:06,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:22:06,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:22:06,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:22:06,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:22:06,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:22:06,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:22:06,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:22:06,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:22:06,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:22:06,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:22:06,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:22:06,300 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:22:06,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:22:06,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:22:06,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:22:06,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:22:06,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:22:06,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:22:06,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:22:06,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:22:06,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:22:06,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:22:06,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:22:06,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:22:06,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:22:06,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:22:06,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:22:06,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:22:06,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:22:06,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:22:06,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:22:06,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:22:06,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:22:06,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:22:06,340 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-11 00:22:06,363 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:22:06,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:22:06,364 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:22:06,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:22:06,365 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:22:06,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:22:06,366 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:22:06,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:22:06,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:22:06,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:22:06,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 00:22:06,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 00:22:06,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 00:22:06,368 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:22:06,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:22:06,368 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:22:06,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 00:22:06,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:22:06,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:22:06,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 00:22:06,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:22:06,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:22:06,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 00:22:06,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 00:22:06,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:22:06,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 00:22:06,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 00:22:06,372 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:22:06,372 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC/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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC 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 -> ef15c4790969d8e640b2241771e44174daa41407 [2021-10-11 00:22:06,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:22:06,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:22:06,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:22:06,648 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:22:06,648 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:22:06,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2021-10-11 00:22:06,717 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC/data/4e7f8cd43/4ae8b1d1613f4416ae25c594ce040bac/FLAG82b4a896b [2021-10-11 00:22:07,237 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:22:07,237 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2021-10-11 00:22:07,246 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC/data/4e7f8cd43/4ae8b1d1613f4416ae25c594ce040bac/FLAG82b4a896b [2021-10-11 00:22:07,597 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC/data/4e7f8cd43/4ae8b1d1613f4416ae25c594ce040bac [2021-10-11 00:22:07,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:22:07,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:22:07,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:22:07,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:22:07,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:22:07,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:22:07" (1/1) ... [2021-10-11 00:22:07,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@208e5595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:07, skipping insertion in model container [2021-10-11 00:22:07,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:22:07" (1/1) ... [2021-10-11 00:22:07,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:22:07,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:22:07,818 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2021-10-11 00:22:07,841 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2021-10-11 00:22:07,853 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2021-10-11 00:22:07,855 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2021-10-11 00:22:07,858 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2021-10-11 00:22:07,871 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2021-10-11 00:22:07,874 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2021-10-11 00:22:07,876 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2021-10-11 00:22:07,878 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2021-10-11 00:22:07,880 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2021-10-11 00:22:07,884 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2021-10-11 00:22:07,886 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2021-10-11 00:22:07,889 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2021-10-11 00:22:07,891 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2021-10-11 00:22:07,893 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2021-10-11 00:22:07,896 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2021-10-11 00:22:07,897 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2021-10-11 00:22:07,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:22:07,909 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:22:07,924 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2021-10-11 00:22:07,926 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2021-10-11 00:22:07,928 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2021-10-11 00:22:07,929 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2021-10-11 00:22:07,932 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2021-10-11 00:22:07,934 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2021-10-11 00:22:07,936 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2021-10-11 00:22:07,938 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2021-10-11 00:22:07,940 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2021-10-11 00:22:07,942 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2021-10-11 00:22:07,945 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2021-10-11 00:22:07,947 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2021-10-11 00:22:07,949 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2021-10-11 00:22:07,952 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2021-10-11 00:22:07,954 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2021-10-11 00:22:07,956 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2021-10-11 00:22:07,958 WARN L226 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_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2021-10-11 00:22:07,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:22:08,000 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:22:08,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:08 WrapperNode [2021-10-11 00:22:08,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:22:08,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:22:08,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:22:08,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:22:08,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:08" (1/1) ... [2021-10-11 00:22:08,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:08" (1/1) ... [2021-10-11 00:22:08,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:22:08,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:22:08,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:22:08,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:22:08,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:08" (1/1) ... [2021-10-11 00:22:08,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:08" (1/1) ... [2021-10-11 00:22:08,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:08" (1/1) ... [2021-10-11 00:22:08,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:08" (1/1) ... [2021-10-11 00:22:08,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:08" (1/1) ... [2021-10-11 00:22:08,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:08" (1/1) ... [2021-10-11 00:22:08,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:08" (1/1) ... [2021-10-11 00:22:08,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:22:08,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:22:08,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:22:08,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:22:08,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:08" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:22:08,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:22:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:22:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:22:08,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:22:08,937 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:22:08,937 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-11 00:22:08,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:22:08 BoogieIcfgContainer [2021-10-11 00:22:08,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:22:08,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 00:22:08,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 00:22:08,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 00:22:08,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:22:07" (1/3) ... [2021-10-11 00:22:08,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6eabf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:22:08, skipping insertion in model container [2021-10-11 00:22:08,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:08" (2/3) ... [2021-10-11 00:22:08,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6eabf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:22:08, skipping insertion in model container [2021-10-11 00:22:08,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:22:08" (3/3) ... [2021-10-11 00:22:08,954 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2021-10-11 00:22:08,971 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 00:22:08,975 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2021-10-11 00:22:09,006 INFO L253 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2021-10-11 00:22:09,050 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 00:22:09,050 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 00:22:09,050 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 00:22:09,050 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:22:09,051 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:22:09,051 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 00:22:09,051 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:22:09,051 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 00:22:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2021-10-11 00:22:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-11 00:22:09,084 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:09,085 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:09,087 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:09,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:09,095 INFO L82 PathProgramCache]: Analyzing trace with hash 123971630, now seen corresponding path program 1 times [2021-10-11 00:22:09,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:09,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541499672] [2021-10-11 00:22:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:09,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541499672] [2021-10-11 00:22:09,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:09,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:22:09,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392513746] [2021-10-11 00:22:09,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:22:09,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:09,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:22:09,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:22:09,444 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 4 states. [2021-10-11 00:22:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:09,730 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2021-10-11 00:22:09,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:22:09,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2021-10-11 00:22:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:09,756 INFO L225 Difference]: With dead ends: 125 [2021-10-11 00:22:09,756 INFO L226 Difference]: Without dead ends: 109 [2021-10-11 00:22:09,760 INFO L677 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-10-11 00:22:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-10-11 00:22:09,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2021-10-11 00:22:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2021-10-11 00:22:09,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-10-11 00:22:09,811 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2021-10-11 00:22:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:09,812 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-10-11 00:22:09,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:22:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-10-11 00:22:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-11 00:22:09,813 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:09,813 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:09,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 00:22:09,814 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:09,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:09,815 INFO L82 PathProgramCache]: Analyzing trace with hash 120336139, now seen corresponding path program 1 times [2021-10-11 00:22:09,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:09,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949119270] [2021-10-11 00:22:09,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:09,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949119270] [2021-10-11 00:22:09,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:09,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:22:09,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959307740] [2021-10-11 00:22:09,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:22:09,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:09,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:22:09,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:22:09,898 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2021-10-11 00:22:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:10,011 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2021-10-11 00:22:10,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:22:10,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2021-10-11 00:22:10,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:10,021 INFO L225 Difference]: With dead ends: 65 [2021-10-11 00:22:10,022 INFO L226 Difference]: Without dead ends: 63 [2021-10-11 00:22:10,023 INFO L677 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-10-11 00:22:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-11 00:22:10,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-10-11 00:22:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2021-10-11 00:22:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2021-10-11 00:22:10,040 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 8 [2021-10-11 00:22:10,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:10,040 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2021-10-11 00:22:10,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:22:10,041 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2021-10-11 00:22:10,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-11 00:22:10,041 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:10,042 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:10,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 00:22:10,042 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:10,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:10,043 INFO L82 PathProgramCache]: Analyzing trace with hash -564542931, now seen corresponding path program 1 times [2021-10-11 00:22:10,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:10,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331760530] [2021-10-11 00:22:10,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:10,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331760530] [2021-10-11 00:22:10,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:10,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:22:10,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493126605] [2021-10-11 00:22:10,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:22:10,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:10,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:22:10,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:22:10,146 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2021-10-11 00:22:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:10,250 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-10-11 00:22:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:22:10,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2021-10-11 00:22:10,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:10,252 INFO L225 Difference]: With dead ends: 69 [2021-10-11 00:22:10,252 INFO L226 Difference]: Without dead ends: 67 [2021-10-11 00:22:10,253 INFO L677 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-10-11 00:22:10,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-10-11 00:22:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2021-10-11 00:22:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-10-11 00:22:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2021-10-11 00:22:10,261 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 9 [2021-10-11 00:22:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:10,262 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-10-11 00:22:10,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:22:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2021-10-11 00:22:10,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 00:22:10,263 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:10,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:10,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 00:22:10,264 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:10,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:10,264 INFO L82 PathProgramCache]: Analyzing trace with hash -429055130, now seen corresponding path program 1 times [2021-10-11 00:22:10,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:10,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256307844] [2021-10-11 00:22:10,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:10,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256307844] [2021-10-11 00:22:10,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:10,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:22:10,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922553145] [2021-10-11 00:22:10,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:22:10,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:10,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:22:10,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:22:10,325 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2021-10-11 00:22:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:10,500 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2021-10-11 00:22:10,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:22:10,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2021-10-11 00:22:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:10,504 INFO L225 Difference]: With dead ends: 67 [2021-10-11 00:22:10,504 INFO L226 Difference]: Without dead ends: 65 [2021-10-11 00:22:10,505 INFO L677 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-10-11 00:22:10,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-11 00:22:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2021-10-11 00:22:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2021-10-11 00:22:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2021-10-11 00:22:10,512 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 11 [2021-10-11 00:22:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:10,512 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2021-10-11 00:22:10,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:22:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2021-10-11 00:22:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 00:22:10,513 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:10,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:10,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 00:22:10,514 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:10,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:10,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1359750351, now seen corresponding path program 1 times [2021-10-11 00:22:10,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:10,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606878575] [2021-10-11 00:22:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:10,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606878575] [2021-10-11 00:22:10,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:10,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:22:10,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873499626] [2021-10-11 00:22:10,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:22:10,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:10,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:22:10,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:22:10,572 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2021-10-11 00:22:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:10,723 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2021-10-11 00:22:10,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:22:10,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2021-10-11 00:22:10,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:10,725 INFO L225 Difference]: With dead ends: 65 [2021-10-11 00:22:10,725 INFO L226 Difference]: Without dead ends: 63 [2021-10-11 00:22:10,726 INFO L677 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-10-11 00:22:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-11 00:22:10,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-10-11 00:22:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2021-10-11 00:22:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2021-10-11 00:22:10,732 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2021-10-11 00:22:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:10,732 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2021-10-11 00:22:10,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:22:10,733 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2021-10-11 00:22:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 00:22:10,733 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:10,734 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:10,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 00:22:10,734 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:10,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:10,735 INFO L82 PathProgramCache]: Analyzing trace with hash -415802953, now seen corresponding path program 1 times [2021-10-11 00:22:10,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:10,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765529606] [2021-10-11 00:22:10,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:10,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765529606] [2021-10-11 00:22:10,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:10,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:22:10,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326881453] [2021-10-11 00:22:10,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:22:10,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:10,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:22:10,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:22:10,784 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 4 states. [2021-10-11 00:22:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:10,886 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2021-10-11 00:22:10,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:22:10,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2021-10-11 00:22:10,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:10,888 INFO L225 Difference]: With dead ends: 63 [2021-10-11 00:22:10,888 INFO L226 Difference]: Without dead ends: 59 [2021-10-11 00:22:10,889 INFO L677 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-10-11 00:22:10,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-10-11 00:22:10,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2021-10-11 00:22:10,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2021-10-11 00:22:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2021-10-11 00:22:10,895 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 12 [2021-10-11 00:22:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:10,895 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2021-10-11 00:22:10,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:22:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2021-10-11 00:22:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 00:22:10,897 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:10,897 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:10,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 00:22:10,897 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:10,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:10,898 INFO L82 PathProgramCache]: Analyzing trace with hash -415312395, now seen corresponding path program 1 times [2021-10-11 00:22:10,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:10,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204229541] [2021-10-11 00:22:10,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:10,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204229541] [2021-10-11 00:22:10,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:10,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:22:10,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250810787] [2021-10-11 00:22:10,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:22:10,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:10,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:22:10,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:22:10,981 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2021-10-11 00:22:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:11,189 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2021-10-11 00:22:11,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:22:11,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2021-10-11 00:22:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:11,192 INFO L225 Difference]: With dead ends: 100 [2021-10-11 00:22:11,192 INFO L226 Difference]: Without dead ends: 98 [2021-10-11 00:22:11,192 INFO L677 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-10-11 00:22:11,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-10-11 00:22:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2021-10-11 00:22:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-10-11 00:22:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-10-11 00:22:11,199 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 12 [2021-10-11 00:22:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:11,199 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-10-11 00:22:11,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:22:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-10-11 00:22:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 00:22:11,200 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:11,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:11,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 00:22:11,201 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:11,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:11,202 INFO L82 PathProgramCache]: Analyzing trace with hash 797416153, now seen corresponding path program 1 times [2021-10-11 00:22:11,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:11,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846155702] [2021-10-11 00:22:11,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:11,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846155702] [2021-10-11 00:22:11,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:11,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:22:11,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413277538] [2021-10-11 00:22:11,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:22:11,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:11,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:22:11,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:22:11,241 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2021-10-11 00:22:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:11,325 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2021-10-11 00:22:11,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:22:11,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2021-10-11 00:22:11,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:11,328 INFO L225 Difference]: With dead ends: 57 [2021-10-11 00:22:11,328 INFO L226 Difference]: Without dead ends: 53 [2021-10-11 00:22:11,329 INFO L677 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-10-11 00:22:11,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-10-11 00:22:11,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2021-10-11 00:22:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2021-10-11 00:22:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-10-11 00:22:11,337 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 12 [2021-10-11 00:22:11,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:11,337 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-10-11 00:22:11,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:22:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-10-11 00:22:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 00:22:11,340 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:11,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:11,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 00:22:11,341 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:11,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:11,341 INFO L82 PathProgramCache]: Analyzing trace with hash 10221853, now seen corresponding path program 1 times [2021-10-11 00:22:11,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:11,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709682968] [2021-10-11 00:22:11,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:11,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709682968] [2021-10-11 00:22:11,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:11,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:22:11,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539387824] [2021-10-11 00:22:11,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:22:11,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:11,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:22:11,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:22:11,522 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2021-10-11 00:22:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:11,673 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2021-10-11 00:22:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:22:11,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2021-10-11 00:22:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:11,674 INFO L225 Difference]: With dead ends: 118 [2021-10-11 00:22:11,674 INFO L226 Difference]: Without dead ends: 116 [2021-10-11 00:22:11,677 INFO L677 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-10-11 00:22:11,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-10-11 00:22:11,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 57. [2021-10-11 00:22:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2021-10-11 00:22:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-10-11 00:22:11,692 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 13 [2021-10-11 00:22:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:11,693 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-10-11 00:22:11,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:22:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-10-11 00:22:11,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 00:22:11,693 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:11,693 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:11,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 00:22:11,694 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:11,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:11,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1032848570, now seen corresponding path program 1 times [2021-10-11 00:22:11,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:11,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155324649] [2021-10-11 00:22:11,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:11,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-10-11 00:22:11,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155324649] [2021-10-11 00:22:11,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:11,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:22:11,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631159302] [2021-10-11 00:22:11,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:22:11,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:11,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:22:11,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:22:11,733 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 5 states. [2021-10-11 00:22:11,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:11,844 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2021-10-11 00:22:11,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:22:11,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2021-10-11 00:22:11,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:11,845 INFO L225 Difference]: With dead ends: 74 [2021-10-11 00:22:11,845 INFO L226 Difference]: Without dead ends: 72 [2021-10-11 00:22:11,846 INFO L677 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-10-11 00:22:11,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-10-11 00:22:11,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2021-10-11 00:22:11,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2021-10-11 00:22:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2021-10-11 00:22:11,850 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 13 [2021-10-11 00:22:11,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:11,851 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2021-10-11 00:22:11,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:22:11,851 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2021-10-11 00:22:11,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 00:22:11,852 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:11,852 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:11,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 00:22:11,852 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:11,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:11,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1031124666, now seen corresponding path program 1 times [2021-10-11 00:22:11,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:11,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235329425] [2021-10-11 00:22:11,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:11,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235329425] [2021-10-11 00:22:11,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:11,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:22:11,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550308001] [2021-10-11 00:22:11,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:22:11,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:11,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:22:11,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:22:11,902 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 5 states. [2021-10-11 00:22:12,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:12,002 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2021-10-11 00:22:12,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:22:12,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2021-10-11 00:22:12,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:12,003 INFO L225 Difference]: With dead ends: 55 [2021-10-11 00:22:12,003 INFO L226 Difference]: Without dead ends: 53 [2021-10-11 00:22:12,003 INFO L677 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-10-11 00:22:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-10-11 00:22:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-10-11 00:22:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-10-11 00:22:12,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2021-10-11 00:22:12,007 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2021-10-11 00:22:12,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:12,008 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2021-10-11 00:22:12,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:22:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2021-10-11 00:22:12,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 00:22:12,008 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:12,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:12,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 00:22:12,009 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:12,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:12,009 INFO L82 PathProgramCache]: Analyzing trace with hash 310078394, now seen corresponding path program 1 times [2021-10-11 00:22:12,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:12,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030032381] [2021-10-11 00:22:12,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:12,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:12,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030032381] [2021-10-11 00:22:12,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:12,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:22:12,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191848707] [2021-10-11 00:22:12,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:22:12,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:12,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:22:12,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:22:12,137 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 6 states. [2021-10-11 00:22:12,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:12,243 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2021-10-11 00:22:12,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 00:22:12,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2021-10-11 00:22:12,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:12,246 INFO L225 Difference]: With dead ends: 78 [2021-10-11 00:22:12,246 INFO L226 Difference]: Without dead ends: 76 [2021-10-11 00:22:12,246 INFO L677 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-10-11 00:22:12,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-10-11 00:22:12,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 53. [2021-10-11 00:22:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-10-11 00:22:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2021-10-11 00:22:12,252 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 14 [2021-10-11 00:22:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:12,252 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2021-10-11 00:22:12,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:22:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2021-10-11 00:22:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 00:22:12,253 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:12,253 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:12,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 00:22:12,254 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:12,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:12,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1953530500, now seen corresponding path program 1 times [2021-10-11 00:22:12,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:12,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478632548] [2021-10-11 00:22:12,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:12,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:12,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478632548] [2021-10-11 00:22:12,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:12,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:22:12,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271210500] [2021-10-11 00:22:12,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:22:12,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:12,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:22:12,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:22:12,355 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 6 states. [2021-10-11 00:22:12,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:12,492 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2021-10-11 00:22:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:22:12,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2021-10-11 00:22:12,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:12,496 INFO L225 Difference]: With dead ends: 92 [2021-10-11 00:22:12,496 INFO L226 Difference]: Without dead ends: 90 [2021-10-11 00:22:12,496 INFO L677 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-10-11 00:22:12,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-10-11 00:22:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2021-10-11 00:22:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2021-10-11 00:22:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2021-10-11 00:22:12,501 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 14 [2021-10-11 00:22:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:12,502 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2021-10-11 00:22:12,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:22:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2021-10-11 00:22:12,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 00:22:12,503 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:12,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:12,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-11 00:22:12,503 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:12,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:12,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1951983355, now seen corresponding path program 1 times [2021-10-11 00:22:12,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:12,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502702224] [2021-10-11 00:22:12,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:12,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502702224] [2021-10-11 00:22:12,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:12,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:22:12,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478869638] [2021-10-11 00:22:12,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:22:12,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:12,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:22:12,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:22:12,539 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 5 states. [2021-10-11 00:22:12,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:12,642 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2021-10-11 00:22:12,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:22:12,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2021-10-11 00:22:12,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:12,643 INFO L225 Difference]: With dead ends: 81 [2021-10-11 00:22:12,643 INFO L226 Difference]: Without dead ends: 79 [2021-10-11 00:22:12,644 INFO L677 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-10-11 00:22:12,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-10-11 00:22:12,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2021-10-11 00:22:12,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2021-10-11 00:22:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2021-10-11 00:22:12,648 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 14 [2021-10-11 00:22:12,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:12,649 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2021-10-11 00:22:12,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:22:12,649 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2021-10-11 00:22:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 00:22:12,649 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:12,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:12,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-11 00:22:12,649 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:12,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:12,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1900089420, now seen corresponding path program 1 times [2021-10-11 00:22:12,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:12,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194950789] [2021-10-11 00:22:12,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:12,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194950789] [2021-10-11 00:22:12,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:12,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:22:12,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127799984] [2021-10-11 00:22:12,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:22:12,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:12,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:22:12,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:22:12,753 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 6 states. [2021-10-11 00:22:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:12,856 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2021-10-11 00:22:12,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:22:12,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2021-10-11 00:22:12,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:12,857 INFO L225 Difference]: With dead ends: 70 [2021-10-11 00:22:12,857 INFO L226 Difference]: Without dead ends: 66 [2021-10-11 00:22:12,858 INFO L677 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-10-11 00:22:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-10-11 00:22:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2021-10-11 00:22:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2021-10-11 00:22:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2021-10-11 00:22:12,863 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 14 [2021-10-11 00:22:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:12,863 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2021-10-11 00:22:12,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:22:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2021-10-11 00:22:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 00:22:12,864 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:12,864 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:12,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-11 00:22:12,864 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:12,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:12,865 INFO L82 PathProgramCache]: Analyzing trace with hash -381937728, now seen corresponding path program 1 times [2021-10-11 00:22:12,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:12,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013107101] [2021-10-11 00:22:12,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:12,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013107101] [2021-10-11 00:22:12,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:12,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:22:12,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338430482] [2021-10-11 00:22:12,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:22:12,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:12,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:22:12,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:22:12,972 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 6 states. [2021-10-11 00:22:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:13,125 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2021-10-11 00:22:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:22:13,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2021-10-11 00:22:13,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:13,127 INFO L225 Difference]: With dead ends: 87 [2021-10-11 00:22:13,127 INFO L226 Difference]: Without dead ends: 85 [2021-10-11 00:22:13,127 INFO L677 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-10-11 00:22:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-10-11 00:22:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2021-10-11 00:22:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2021-10-11 00:22:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2021-10-11 00:22:13,134 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 15 [2021-10-11 00:22:13,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:13,134 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2021-10-11 00:22:13,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:22:13,134 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2021-10-11 00:22:13,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 00:22:13,135 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:13,135 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:13,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-11 00:22:13,136 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:13,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:13,136 INFO L82 PathProgramCache]: Analyzing trace with hash -441974753, now seen corresponding path program 1 times [2021-10-11 00:22:13,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:13,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741782624] [2021-10-11 00:22:13,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:13,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741782624] [2021-10-11 00:22:13,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:13,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:22:13,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280971698] [2021-10-11 00:22:13,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:22:13,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:13,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:22:13,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:22:13,172 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 4 states. [2021-10-11 00:22:13,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:13,212 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2021-10-11 00:22:13,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:22:13,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2021-10-11 00:22:13,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:13,213 INFO L225 Difference]: With dead ends: 63 [2021-10-11 00:22:13,213 INFO L226 Difference]: Without dead ends: 61 [2021-10-11 00:22:13,214 INFO L677 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-10-11 00:22:13,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-10-11 00:22:13,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-10-11 00:22:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2021-10-11 00:22:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2021-10-11 00:22:13,220 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 16 [2021-10-11 00:22:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:13,220 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2021-10-11 00:22:13,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:22:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2021-10-11 00:22:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 00:22:13,221 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:13,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:13,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-11 00:22:13,221 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:13,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:13,222 INFO L82 PathProgramCache]: Analyzing trace with hash -816311340, now seen corresponding path program 1 times [2021-10-11 00:22:13,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:13,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928830212] [2021-10-11 00:22:13,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:13,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928830212] [2021-10-11 00:22:13,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:13,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:22:13,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083522945] [2021-10-11 00:22:13,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:22:13,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:13,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:22:13,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:22:13,256 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 4 states. [2021-10-11 00:22:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:13,314 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2021-10-11 00:22:13,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:22:13,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2021-10-11 00:22:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:13,315 INFO L225 Difference]: With dead ends: 61 [2021-10-11 00:22:13,315 INFO L226 Difference]: Without dead ends: 57 [2021-10-11 00:22:13,316 INFO L677 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-10-11 00:22:13,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-10-11 00:22:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-10-11 00:22:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2021-10-11 00:22:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2021-10-11 00:22:13,320 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 17 [2021-10-11 00:22:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:13,321 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2021-10-11 00:22:13,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:22:13,321 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2021-10-11 00:22:13,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-11 00:22:13,321 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:13,321 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:13,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-11 00:22:13,322 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:13,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:13,322 INFO L82 PathProgramCache]: Analyzing trace with hash -508949322, now seen corresponding path program 1 times [2021-10-11 00:22:13,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:13,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604602529] [2021-10-11 00:22:13,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:13,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604602529] [2021-10-11 00:22:13,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60371251] [2021-10-11 00:22:13,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:22:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:13,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-11 00:22:13,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:22:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:13,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:22:13,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2021-10-11 00:22:13,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127271190] [2021-10-11 00:22:13,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-10-11 00:22:13,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:13,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 00:22:13,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-11 00:22:13,693 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 11 states. [2021-10-11 00:22:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:14,013 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2021-10-11 00:22:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 00:22:14,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2021-10-11 00:22:14,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:14,014 INFO L225 Difference]: With dead ends: 93 [2021-10-11 00:22:14,015 INFO L226 Difference]: Without dead ends: 91 [2021-10-11 00:22:14,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-10-11 00:22:14,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-10-11 00:22:14,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 53. [2021-10-11 00:22:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-10-11 00:22:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2021-10-11 00:22:14,021 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 18 [2021-10-11 00:22:14,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:14,021 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2021-10-11 00:22:14,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-10-11 00:22:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2021-10-11 00:22:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-11 00:22:14,022 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:14,022 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:14,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:22:14,237 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:14,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:14,238 INFO L82 PathProgramCache]: Analyzing trace with hash 479271318, now seen corresponding path program 1 times [2021-10-11 00:22:14,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:14,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126426077] [2021-10-11 00:22:14,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:14,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126426077] [2021-10-11 00:22:14,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:14,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:22:14,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984685451] [2021-10-11 00:22:14,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:22:14,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:14,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:22:14,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:22:14,320 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 6 states. [2021-10-11 00:22:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:14,439 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2021-10-11 00:22:14,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:22:14,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2021-10-11 00:22:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:14,441 INFO L225 Difference]: With dead ends: 68 [2021-10-11 00:22:14,441 INFO L226 Difference]: Without dead ends: 66 [2021-10-11 00:22:14,442 INFO L677 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-10-11 00:22:14,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-10-11 00:22:14,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2021-10-11 00:22:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2021-10-11 00:22:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2021-10-11 00:22:14,452 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 18 [2021-10-11 00:22:14,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:14,452 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2021-10-11 00:22:14,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:22:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2021-10-11 00:22:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 00:22:14,453 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:14,453 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:14,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-11 00:22:14,453 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:14,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:14,454 INFO L82 PathProgramCache]: Analyzing trace with hash 397067279, now seen corresponding path program 1 times [2021-10-11 00:22:14,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:14,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413607982] [2021-10-11 00:22:14,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:14,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:14,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413607982] [2021-10-11 00:22:14,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:14,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:22:14,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139114666] [2021-10-11 00:22:14,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:22:14,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:14,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:22:14,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:22:14,538 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 6 states. [2021-10-11 00:22:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:14,648 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2021-10-11 00:22:14,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:22:14,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2021-10-11 00:22:14,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:14,652 INFO L225 Difference]: With dead ends: 60 [2021-10-11 00:22:14,652 INFO L226 Difference]: Without dead ends: 58 [2021-10-11 00:22:14,652 INFO L677 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-10-11 00:22:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-10-11 00:22:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2021-10-11 00:22:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2021-10-11 00:22:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2021-10-11 00:22:14,656 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 19 [2021-10-11 00:22:14,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:14,656 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2021-10-11 00:22:14,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:22:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2021-10-11 00:22:14,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 00:22:14,656 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:14,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:14,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-11 00:22:14,657 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:14,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:14,657 INFO L82 PathProgramCache]: Analyzing trace with hash 450508359, now seen corresponding path program 1 times [2021-10-11 00:22:14,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:14,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565583671] [2021-10-11 00:22:14,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:14,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565583671] [2021-10-11 00:22:14,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:22:14,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:22:14,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030505276] [2021-10-11 00:22:14,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:22:14,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:14,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:22:14,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:22:14,731 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2021-10-11 00:22:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:14,830 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2021-10-11 00:22:14,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:22:14,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2021-10-11 00:22:14,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:14,831 INFO L225 Difference]: With dead ends: 43 [2021-10-11 00:22:14,831 INFO L226 Difference]: Without dead ends: 20 [2021-10-11 00:22:14,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:22:14,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-11 00:22:14,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-10-11 00:22:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-10-11 00:22:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2021-10-11 00:22:14,837 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 19 [2021-10-11 00:22:14,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:14,838 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2021-10-11 00:22:14,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:22:14,838 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2021-10-11 00:22:14,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 00:22:14,839 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:22:14,839 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:22:14,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-11 00:22:14,839 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:22:14,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:22:14,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1395641153, now seen corresponding path program 1 times [2021-10-11 00:22:14,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:22:14,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765899193] [2021-10-11 00:22:14,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:22:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:14,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765899193] [2021-10-11 00:22:14,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502875183] [2021-10-11 00:22:14,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:22:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:22:15,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-11 00:22:15,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:22:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:22:15,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:22:15,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2021-10-11 00:22:15,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654993032] [2021-10-11 00:22:15,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-10-11 00:22:15,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:22:15,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 00:22:15,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-11 00:22:15,139 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 11 states. [2021-10-11 00:22:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:22:15,276 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2021-10-11 00:22:15,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 00:22:15,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2021-10-11 00:22:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:22:15,277 INFO L225 Difference]: With dead ends: 20 [2021-10-11 00:22:15,277 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 00:22:15,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-10-11 00:22:15,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 00:22:15,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 00:22:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 00:22:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 00:22:15,278 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2021-10-11 00:22:15,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:22:15,279 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:22:15,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-10-11 00:22:15,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 00:22:15,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 00:22:15,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-10-11 00:22:15,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 00:22:15,928 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2021-10-11 00:22:16,179 WARN L197 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 29 [2021-10-11 00:22:16,285 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 14 [2021-10-11 00:22:16,287 INFO L262 CegarLoopResult]: For program point L225(line 225) no Hoare annotation was computed. [2021-10-11 00:22:16,287 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2021-10-11 00:22:16,287 INFO L262 CegarLoopResult]: For program point L349(lines 349 358) no Hoare annotation was computed. [2021-10-11 00:22:16,288 INFO L258 CegarLoopResult]: At program point L250(lines 102 252) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0)) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) [2021-10-11 00:22:16,288 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-10-11 00:22:16,288 INFO L262 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2021-10-11 00:22:16,288 INFO L262 CegarLoopResult]: For program point L308(lines 308 316) no Hoare annotation was computed. [2021-10-11 00:22:16,288 INFO L262 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2021-10-11 00:22:16,288 INFO L262 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2021-10-11 00:22:16,288 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2021-10-11 00:22:16,288 INFO L262 CegarLoopResult]: For program point L102(lines 102 252) no Hoare annotation was computed. [2021-10-11 00:22:16,288 INFO L262 CegarLoopResult]: For program point L325(lines 325 362) no Hoare annotation was computed. [2021-10-11 00:22:16,288 INFO L262 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2021-10-11 00:22:16,289 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2021-10-11 00:22:16,289 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 00:22:16,289 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-11 00:22:16,289 INFO L262 CegarLoopResult]: For program point L20(lines 20 374) no Hoare annotation was computed. [2021-10-11 00:22:16,289 INFO L262 CegarLoopResult]: For program point L177(line 177) no Hoare annotation was computed. [2021-10-11 00:22:16,289 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) no Hoare annotation was computed. [2021-10-11 00:22:16,289 INFO L262 CegarLoopResult]: For program point L235(lines 235 243) no Hoare annotation was computed. [2021-10-11 00:22:16,289 INFO L262 CegarLoopResult]: For program point L351(line 351) no Hoare annotation was computed. [2021-10-11 00:22:16,290 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) no Hoare annotation was computed. [2021-10-11 00:22:16,290 INFO L262 CegarLoopResult]: For program point L153(lines 153 161) no Hoare annotation was computed. [2021-10-11 00:22:16,290 INFO L262 CegarLoopResult]: For program point L54(lines 54 254) no Hoare annotation was computed. [2021-10-11 00:22:16,290 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2021-10-11 00:22:16,290 INFO L262 CegarLoopResult]: For program point L310(line 310) no Hoare annotation was computed. [2021-10-11 00:22:16,290 INFO L262 CegarLoopResult]: For program point L277(lines 277 364) no Hoare annotation was computed. [2021-10-11 00:22:16,290 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) no Hoare annotation was computed. [2021-10-11 00:22:16,291 INFO L262 CegarLoopResult]: For program point L71(lines 71 95) no Hoare annotation was computed. [2021-10-11 00:22:16,291 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2021-10-11 00:22:16,291 INFO L262 CegarLoopResult]: For program point L187(lines 187 197) no Hoare annotation was computed. [2021-10-11 00:22:16,291 INFO L262 CegarLoopResult]: For program point L113(lines 113 204) no Hoare annotation was computed. [2021-10-11 00:22:16,291 INFO L262 CegarLoopResult]: For program point L237(line 237) no Hoare annotation was computed. [2021-10-11 00:22:16,291 INFO L258 CegarLoopResult]: At program point L328(lines 32 368) the Hoare annotation is: (let ((.cse0 (< 0 ULTIMATE.start_main_~main__tagbuf_len~0)) (.cse3 (<= ULTIMATE.start_main_~main__t~0 1))) (let ((.cse1 (let ((.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse4 .cse0 .cse3) (and .cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 0)))))) (.cse2 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 1))) (or (and .cse0 (= ULTIMATE.start_main_~main__t~0 0)) (and (not (= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) .cse1 (<= 1 ULTIMATE.start_main_~main__t~0) (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 1) .cse2) (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse1 (<= 0 ULTIMATE.start_main_~main__t~0) .cse3 .cse2)))) [2021-10-11 00:22:16,292 INFO L258 CegarLoopResult]: At program point L196(lines 60 254) the Hoare annotation is: (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0)) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) [2021-10-11 00:22:16,292 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) no Hoare annotation was computed. [2021-10-11 00:22:16,292 INFO L262 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2021-10-11 00:22:16,292 INFO L262 CegarLoopResult]: For program point L56(line 56) no Hoare annotation was computed. [2021-10-11 00:22:16,292 INFO L262 CegarLoopResult]: For program point L279(line 279) no Hoare annotation was computed. [2021-10-11 00:22:16,292 INFO L262 CegarLoopResult]: For program point L337(lines 337 360) no Hoare annotation was computed. [2021-10-11 00:22:16,293 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) no Hoare annotation was computed. [2021-10-11 00:22:16,293 INFO L262 CegarLoopResult]: For program point L106(lines 106 210) no Hoare annotation was computed. [2021-10-11 00:22:16,293 INFO L262 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2021-10-11 00:22:16,293 INFO L262 CegarLoopResult]: For program point L296(lines 296 318) no Hoare annotation was computed. [2021-10-11 00:22:16,293 INFO L262 CegarLoopResult]: For program point L32(lines 32 368) no Hoare annotation was computed. [2021-10-11 00:22:16,293 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-11 00:22:16,293 INFO L262 CegarLoopResult]: For program point L189(line 189) no Hoare annotation was computed. [2021-10-11 00:22:16,294 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-10-11 00:22:16,294 INFO L262 CegarLoopResult]: For program point L24(lines 24 369) no Hoare annotation was computed. [2021-10-11 00:22:16,294 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2021-10-11 00:22:16,294 INFO L262 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2021-10-11 00:22:16,294 INFO L262 CegarLoopResult]: For program point L289(lines 289 363) no Hoare annotation was computed. [2021-10-11 00:22:16,294 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 00:22:16,294 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2021-10-11 00:22:16,295 INFO L262 CegarLoopResult]: For program point L223(lines 223 245) no Hoare annotation was computed. [2021-10-11 00:22:16,295 INFO L262 CegarLoopResult]: For program point L83(lines 83 93) no Hoare annotation was computed. [2021-10-11 00:22:16,295 INFO L262 CegarLoopResult]: For program point L339(line 339) no Hoare annotation was computed. [2021-10-11 00:22:16,295 INFO L262 CegarLoopResult]: For program point L141(lines 141 163) no Hoare annotation was computed. [2021-10-11 00:22:16,295 INFO L262 CegarLoopResult]: For program point L42(lines 42 256) no Hoare annotation was computed. [2021-10-11 00:22:16,295 INFO L262 CegarLoopResult]: For program point L298(line 298) no Hoare annotation was computed. [2021-10-11 00:22:16,295 INFO L262 CegarLoopResult]: For program point L125(lines 125 202) no Hoare annotation was computed. [2021-10-11 00:22:16,296 INFO L265 CegarLoopResult]: At program point L315(lines 32 368) the Hoare annotation is: true [2021-10-11 00:22:16,296 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) no Hoare annotation was computed. [2021-10-11 00:22:16,296 INFO L262 CegarLoopResult]: For program point L216(lines 216 251) no Hoare annotation was computed. [2021-10-11 00:22:16,296 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2021-10-11 00:22:16,296 INFO L265 CegarLoopResult]: At program point L373(lines 15 375) the Hoare annotation is: true [2021-10-11 00:22:16,296 INFO L262 CegarLoopResult]: For program point L175(lines 175 199) no Hoare annotation was computed. [2021-10-11 00:22:16,296 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) no Hoare annotation was computed. [2021-10-11 00:22:16,297 INFO L262 CegarLoopResult]: For program point L266(lines 266 366) no Hoare annotation was computed. [2021-10-11 00:22:16,297 INFO L262 CegarLoopResult]: For program point L134(lines 134 201) no Hoare annotation was computed. [2021-10-11 00:22:16,297 INFO L258 CegarLoopResult]: At program point L357(lines 283 364) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_main_~main__t~0 0))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse4 .cse2) (and .cse4 (<= 1 ULTIMATE.start_main_~main__t~0)))))) (or (and .cse3 .cse2) (and .cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0)))))) (.cse1 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 1))) (or (and .cse0 (not (= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 1) .cse1) (and .cse0 (< 0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse2 .cse1)))) [2021-10-11 00:22:16,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:22:16 BoogieIcfgContainer [2021-10-11 00:22:16,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 00:22:16,320 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:22:16,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:22:16,320 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:22:16,321 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:22:08" (3/4) ... [2021-10-11 00:22:16,324 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 00:22:16,339 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-11 00:22:16,339 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-11 00:22:16,340 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 00:22:16,341 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 00:22:16,427 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2abbe346-b2fd-4c2d-beec-48e8ba3d9ffe/bin/uautomizer-Z5i5R5N3CC/witness.graphml [2021-10-11 00:22:16,428 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:22:16,429 INFO L168 Benchmark]: Toolchain (without parser) took 8827.33 ms. Allocated memory was 132.1 MB in the beginning and 205.5 MB in the end (delta: 73.4 MB). Free memory was 102.0 MB in the beginning and 158.9 MB in the end (delta: -56.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:22:16,430 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 79.7 MB. Free memory is still 37.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:22:16,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.08 ms. Allocated memory is still 132.1 MB. Free memory was 102.0 MB in the beginning and 101.9 MB in the end (delta: 106.0 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:22:16,431 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.18 ms. Allocated memory is still 132.1 MB. Free memory was 101.9 MB in the beginning and 100.1 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:22:16,431 INFO L168 Benchmark]: Boogie Preprocessor took 51.76 ms. Allocated memory is still 132.1 MB. Free memory was 100.1 MB in the beginning and 98.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:22:16,432 INFO L168 Benchmark]: RCFGBuilder took 813.68 ms. Allocated memory is still 132.1 MB. Free memory was 98.7 MB in the beginning and 74.3 MB in the end (delta: 24.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:22:16,432 INFO L168 Benchmark]: TraceAbstraction took 7374.82 ms. Allocated memory was 132.1 MB in the beginning and 205.5 MB in the end (delta: 73.4 MB). Free memory was 73.9 MB in the beginning and 165.2 MB in the end (delta: -91.3 MB). Peak memory consumption was 87.9 MB. Max. memory is 16.1 GB. [2021-10-11 00:22:16,433 INFO L168 Benchmark]: Witness Printer took 108.06 ms. Allocated memory is still 205.5 MB. Free memory was 165.2 MB in the beginning and 158.9 MB in the end (delta: 6.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:22:16,435 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.29 ms. Allocated memory is still 79.7 MB. Free memory is still 37.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 396.08 ms. Allocated memory is still 132.1 MB. Free memory was 102.0 MB in the beginning and 101.9 MB in the end (delta: 106.0 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 70.18 ms. Allocated memory is still 132.1 MB. Free memory was 101.9 MB in the beginning and 100.1 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 51.76 ms. Allocated memory is still 132.1 MB. Free memory was 100.1 MB in the beginning and 98.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 813.68 ms. Allocated memory is still 132.1 MB. Free memory was 98.7 MB in the beginning and 74.3 MB in the end (delta: 24.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7374.82 ms. Allocated memory was 132.1 MB in the beginning and 205.5 MB in the end (delta: 73.4 MB). Free memory was 73.9 MB in the beginning and 165.2 MB in the end (delta: -91.3 MB). Peak memory consumption was 87.9 MB. Max. memory is 16.1 GB. * Witness Printer took 108.06 ms. Allocated memory is still 205.5 MB. Free memory was 165.2 MB in the beginning and 158.9 MB in the end (delta: 6.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 155]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 351]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 339]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 44]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 279]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 127]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 143]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 225]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 310]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 298]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 237]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((main__t < main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((0 < main__tagbuf_len && main__t == 0) || (((((!(main__t == main__tagbuf_len) && (((!(__VERIFIER_assert__cond == 0) && 0 < main__tagbuf_len) && main__t <= 1) || (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__t) && main__t <= main__tagbuf_len) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1)) || ((((main__t < main__tagbuf_len && (((!(__VERIFIER_assert__cond == 0) && 0 < main__tagbuf_len) && main__t <= 1) || (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)))) && 0 <= main__t) && main__t <= 1) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((((((((!(__VERIFIER_assert__cond == 0) && main__t == 0) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__t)) && main__t == 0) || (((!(__VERIFIER_assert__cond == 0) && main__t == 0) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__t)) && !(__VERIFIER_assert__cond == 0))) && !(main__t == main__tagbuf_len)) && main__t <= main__tagbuf_len) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) || (((((((!(__VERIFIER_assert__cond == 0) && main__t == 0) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__t)) && main__t == 0) || (((!(__VERIFIER_assert__cond == 0) && main__t == 0) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__t)) && !(__VERIFIER_assert__cond == 0))) && 0 < main__tagbuf_len) && main__t == 0) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) && main__t <= main__tagbuf_len - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 17 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.4s, OverallIterations: 23, TraceHistogramMax: 2, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 959 SDtfs, 1523 SDslu, 1370 SDs, 0 SdLazy, 1647 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, 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, 338 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 14 NumberOfFragments, 225 HoareAnnotationTreeSize, 6 FomulaSimplifications, 257383 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 16323 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 14875 SizeOfPredicates, 16 NumberOfNonLiveVariables, 237 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 8/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 RESULT: Ultimate proved your program to be correct! Received shutdown request...