./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 b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a --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 fc74ae7e31589f228260101e75826f872a5ff2be20b18370840af309ca05fc6e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 13:51:17,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:51:17,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:51:17,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:51:17,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:51:17,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:51:17,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:51:17,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:51:17,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:51:17,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:51:17,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:51:17,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:51:17,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:51:17,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:51:17,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:51:17,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:51:17,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:51:17,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:51:17,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:51:17,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:51:17,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:51:17,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:51:17,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:51:17,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:51:17,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:51:17,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:51:17,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:51:17,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:51:17,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:51:17,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:51:17,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:51:17,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:51:17,351 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:51:17,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:51:17,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:51:17,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:51:17,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:51:17,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:51:17,357 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:51:17,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:51:17,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:51:17,359 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 13:51:17,399 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:51:17,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:51:17,400 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:51:17,401 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:51:17,402 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:51:17,402 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:51:17,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:51:17,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:51:17,403 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:51:17,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:51:17,405 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:51:17,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:51:17,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:51:17,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:51:17,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 13:51:17,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:51:17,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 13:51:17,407 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:51:17,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 13:51:17,408 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:51:17,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 13:51:17,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:51:17,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:51:17,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:51:17,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:51:17,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:51:17,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:51:17,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 13:51:17,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:51:17,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:51:17,411 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 13:51:17,412 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 13:51:17,412 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 13:51:17,412 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a 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 -> fc74ae7e31589f228260101e75826f872a5ff2be20b18370840af309ca05fc6e [2022-11-21 13:51:17,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:51:17,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:51:17,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:51:17,760 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:51:17,760 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:51:17,762 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2022-11-21 13:51:20,703 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:51:20,895 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:51:20,897 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2022-11-21 13:51:20,908 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/data/57a848366/a9dddaec7fd94b329adf52f12879f4dd/FLAG79e82c669 [2022-11-21 13:51:20,926 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/data/57a848366/a9dddaec7fd94b329adf52f12879f4dd [2022-11-21 13:51:20,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:51:20,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:51:20,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:51:20,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:51:20,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:51:20,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:51:20" (1/1) ... [2022-11-21 13:51:20,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139f2a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:20, skipping insertion in model container [2022-11-21 13:51:20,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:51:20" (1/1) ... [2022-11-21 13:51:20,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:51:20,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:51:21,126 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2022-11-21 13:51:21,131 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2022-11-21 13:51:21,134 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2022-11-21 13:51:21,135 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2022-11-21 13:51:21,138 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2022-11-21 13:51:21,140 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2022-11-21 13:51:21,144 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2022-11-21 13:51:21,147 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2022-11-21 13:51:21,149 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2022-11-21 13:51:21,151 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2022-11-21 13:51:21,154 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2022-11-21 13:51:21,155 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2022-11-21 13:51:21,158 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2022-11-21 13:51:21,160 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2022-11-21 13:51:21,162 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2022-11-21 13:51:21,164 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2022-11-21 13:51:21,166 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2022-11-21 13:51:21,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:51:21,183 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:51:21,198 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2022-11-21 13:51:21,200 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2022-11-21 13:51:21,201 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2022-11-21 13:51:21,203 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2022-11-21 13:51:21,206 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2022-11-21 13:51:21,207 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2022-11-21 13:51:21,209 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2022-11-21 13:51:21,210 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2022-11-21 13:51:21,216 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2022-11-21 13:51:21,218 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2022-11-21 13:51:21,221 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2022-11-21 13:51:21,222 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2022-11-21 13:51:21,224 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2022-11-21 13:51:21,226 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2022-11-21 13:51:21,228 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2022-11-21 13:51:21,230 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2022-11-21 13:51:21,231 WARN L237 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_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2022-11-21 13:51:21,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:51:21,251 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:51:21,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:21 WrapperNode [2022-11-21 13:51:21,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:51:21,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:51:21,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:51:21,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:51:21,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:21" (1/1) ... [2022-11-21 13:51:21,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:21" (1/1) ... [2022-11-21 13:51:21,294 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 229 [2022-11-21 13:51:21,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:51:21,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:51:21,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:51:21,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:51:21,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:21" (1/1) ... [2022-11-21 13:51:21,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:21" (1/1) ... [2022-11-21 13:51:21,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:21" (1/1) ... [2022-11-21 13:51:21,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:21" (1/1) ... [2022-11-21 13:51:21,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:21" (1/1) ... [2022-11-21 13:51:21,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:21" (1/1) ... [2022-11-21 13:51:21,317 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:21" (1/1) ... [2022-11-21 13:51:21,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:21" (1/1) ... [2022-11-21 13:51:21,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:51:21,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:51:21,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:51:21,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:51:21,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:21" (1/1) ... [2022-11-21 13:51:21,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:51:21,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:51:21,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:51:21,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:51:21,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:51:21,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:51:21,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:51:21,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:51:21,560 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:51:21,577 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:51:22,023 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:51:22,030 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:51:22,030 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 13:51:22,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:51:22 BoogieIcfgContainer [2022-11-21 13:51:22,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:51:22,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:51:22,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:51:22,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:51:22,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:51:20" (1/3) ... [2022-11-21 13:51:22,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af5df43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:51:22, skipping insertion in model container [2022-11-21 13:51:22,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:51:21" (2/3) ... [2022-11-21 13:51:22,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af5df43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:51:22, skipping insertion in model container [2022-11-21 13:51:22,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:51:22" (3/3) ... [2022-11-21 13:51:22,054 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2022-11-21 13:51:22,079 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:51:22,079 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-11-21 13:51:22,156 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:51:22,163 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57e7b282, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:51:22,163 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-11-21 13:51:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 53 states have (on average 1.849056603773585) internal successors, (98), 70 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:22,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 13:51:22,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:22,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:22,176 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:22,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:22,181 INFO L85 PathProgramCache]: Analyzing trace with hash 123971630, now seen corresponding path program 1 times [2022-11-21 13:51:22,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:22,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63604244] [2022-11-21 13:51:22,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:22,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:22,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:22,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63604244] [2022-11-21 13:51:22,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63604244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:22,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:22,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:51:22,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251064162] [2022-11-21 13:51:22,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:22,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:51:22,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:22,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:51:22,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:51:22,607 INFO L87 Difference]: Start difference. First operand has 71 states, 53 states have (on average 1.849056603773585) internal successors, (98), 70 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:22,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:22,816 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2022-11-21 13:51:22,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:51:22,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-21 13:51:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:22,832 INFO L225 Difference]: With dead ends: 125 [2022-11-21 13:51:22,832 INFO L226 Difference]: Without dead ends: 109 [2022-11-21 13:51:22,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:51:22,840 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 83 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:22,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 252 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-21 13:51:22,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2022-11-21 13:51:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-11-21 13:51:22,876 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2022-11-21 13:51:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:22,876 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-11-21 13:51:22,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-11-21 13:51:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 13:51:22,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:22,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:22,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:51:22,878 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:22,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:22,879 INFO L85 PathProgramCache]: Analyzing trace with hash 120336139, now seen corresponding path program 1 times [2022-11-21 13:51:22,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:22,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551605378] [2022-11-21 13:51:22,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:22,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:23,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:23,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551605378] [2022-11-21 13:51:23,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551605378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:23,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:23,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:51:23,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887752706] [2022-11-21 13:51:23,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:23,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:51:23,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:23,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:51:23,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:51:23,013 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:23,074 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-11-21 13:51:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:51:23,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-21 13:51:23,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:23,076 INFO L225 Difference]: With dead ends: 65 [2022-11-21 13:51:23,076 INFO L226 Difference]: Without dead ends: 63 [2022-11-21 13:51:23,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:51:23,078 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 100 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:23,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 56 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:51:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-21 13:51:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-21 13:51:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-11-21 13:51:23,086 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 8 [2022-11-21 13:51:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:23,087 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-11-21 13:51:23,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-11-21 13:51:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 13:51:23,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:23,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:23,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:51:23,088 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:23,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:23,089 INFO L85 PathProgramCache]: Analyzing trace with hash -564542931, now seen corresponding path program 1 times [2022-11-21 13:51:23,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:23,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311454757] [2022-11-21 13:51:23,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:23,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:23,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:23,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:23,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311454757] [2022-11-21 13:51:23,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311454757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:23,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:23,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:51:23,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129606803] [2022-11-21 13:51:23,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:23,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:51:23,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:23,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:51:23,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:51:23,219 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:23,294 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-11-21 13:51:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:51:23,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-21 13:51:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:23,296 INFO L225 Difference]: With dead ends: 69 [2022-11-21 13:51:23,296 INFO L226 Difference]: Without dead ends: 67 [2022-11-21 13:51:23,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:51:23,298 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 43 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:23,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 117 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-21 13:51:23,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-11-21 13:51:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:23,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-11-21 13:51:23,312 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 9 [2022-11-21 13:51:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:23,313 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-11-21 13:51:23,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:23,313 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-11-21 13:51:23,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 13:51:23,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:23,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:23,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 13:51:23,314 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:23,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:23,320 INFO L85 PathProgramCache]: Analyzing trace with hash -429055130, now seen corresponding path program 1 times [2022-11-21 13:51:23,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:23,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950067980] [2022-11-21 13:51:23,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:23,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:23,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:23,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950067980] [2022-11-21 13:51:23,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950067980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:23,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:23,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:51:23,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080816447] [2022-11-21 13:51:23,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:23,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:51:23,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:23,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:51:23,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:51:23,445 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:23,544 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-11-21 13:51:23,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:51:23,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-21 13:51:23,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:23,549 INFO L225 Difference]: With dead ends: 67 [2022-11-21 13:51:23,550 INFO L226 Difference]: Without dead ends: 65 [2022-11-21 13:51:23,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:23,554 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 59 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:23,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 113 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:23,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-21 13:51:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2022-11-21 13:51:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.36) internal successors, (68), 63 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-11-21 13:51:23,573 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 11 [2022-11-21 13:51:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:23,575 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-11-21 13:51:23,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:23,576 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-11-21 13:51:23,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 13:51:23,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:23,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:23,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 13:51:23,577 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:23,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1359750351, now seen corresponding path program 1 times [2022-11-21 13:51:23,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:23,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085315965] [2022-11-21 13:51:23,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:23,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:23,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:23,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085315965] [2022-11-21 13:51:23,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085315965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:23,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:23,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:51:23,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816936562] [2022-11-21 13:51:23,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:23,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:51:23,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:23,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:51:23,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:51:23,700 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:23,807 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-11-21 13:51:23,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:51:23,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-21 13:51:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:23,809 INFO L225 Difference]: With dead ends: 65 [2022-11-21 13:51:23,809 INFO L226 Difference]: Without dead ends: 63 [2022-11-21 13:51:23,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:23,811 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:23,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 107 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-21 13:51:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-11-21 13:51:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.346938775510204) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-11-21 13:51:23,826 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2022-11-21 13:51:23,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:23,826 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-11-21 13:51:23,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-11-21 13:51:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 13:51:23,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:23,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:23,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 13:51:23,829 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:23,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:23,829 INFO L85 PathProgramCache]: Analyzing trace with hash -415802953, now seen corresponding path program 1 times [2022-11-21 13:51:23,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:23,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678418129] [2022-11-21 13:51:23,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:23,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:23,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:23,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678418129] [2022-11-21 13:51:23,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678418129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:23,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:23,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:51:23,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556292259] [2022-11-21 13:51:23,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:23,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:51:23,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:23,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:51:23,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:51:23,927 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:23,983 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-11-21 13:51:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:51:23,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-21 13:51:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:23,984 INFO L225 Difference]: With dead ends: 63 [2022-11-21 13:51:23,984 INFO L226 Difference]: Without dead ends: 59 [2022-11-21 13:51:23,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:51:23,985 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 16 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:23,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 126 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:51:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-21 13:51:23,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-11-21 13:51:23,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:23,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-11-21 13:51:23,991 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 12 [2022-11-21 13:51:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:23,991 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-11-21 13:51:23,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-11-21 13:51:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 13:51:23,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:23,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:23,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 13:51:23,993 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:23,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:23,994 INFO L85 PathProgramCache]: Analyzing trace with hash -415312395, now seen corresponding path program 1 times [2022-11-21 13:51:23,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:23,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931510091] [2022-11-21 13:51:23,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:23,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:24,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:24,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931510091] [2022-11-21 13:51:24,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931510091] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:24,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:24,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:51:24,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762057560] [2022-11-21 13:51:24,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:24,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:51:24,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:24,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:51:24,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:51:24,074 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:24,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:24,199 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2022-11-21 13:51:24,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:51:24,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-21 13:51:24,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:24,200 INFO L225 Difference]: With dead ends: 100 [2022-11-21 13:51:24,201 INFO L226 Difference]: Without dead ends: 98 [2022-11-21 13:51:24,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:24,203 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 95 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:24,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 144 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:24,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-21 13:51:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2022-11-21 13:51:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-11-21 13:51:24,222 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 12 [2022-11-21 13:51:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:24,223 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-11-21 13:51:24,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-11-21 13:51:24,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 13:51:24,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:24,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:24,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 13:51:24,225 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:24,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:24,226 INFO L85 PathProgramCache]: Analyzing trace with hash 797416153, now seen corresponding path program 1 times [2022-11-21 13:51:24,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:24,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34110827] [2022-11-21 13:51:24,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:24,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:24,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:24,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34110827] [2022-11-21 13:51:24,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34110827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:24,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:24,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:51:24,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398177348] [2022-11-21 13:51:24,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:24,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:51:24,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:24,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:51:24,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:51:24,294 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:24,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:24,339 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-11-21 13:51:24,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:51:24,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-21 13:51:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:24,341 INFO L225 Difference]: With dead ends: 57 [2022-11-21 13:51:24,341 INFO L226 Difference]: Without dead ends: 53 [2022-11-21 13:51:24,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:51:24,344 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:24,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 114 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:51:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-21 13:51:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-11-21 13:51:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-11-21 13:51:24,357 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 12 [2022-11-21 13:51:24,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:24,358 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-11-21 13:51:24,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-11-21 13:51:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 13:51:24,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:24,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:24,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 13:51:24,360 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:24,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:24,361 INFO L85 PathProgramCache]: Analyzing trace with hash 10221853, now seen corresponding path program 1 times [2022-11-21 13:51:24,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:24,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711381944] [2022-11-21 13:51:24,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:24,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:24,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:24,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711381944] [2022-11-21 13:51:24,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711381944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:24,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:24,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:51:24,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127129034] [2022-11-21 13:51:24,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:24,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:51:24,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:24,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:51:24,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:24,561 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:24,746 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-11-21 13:51:24,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:51:24,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 13:51:24,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:24,747 INFO L225 Difference]: With dead ends: 118 [2022-11-21 13:51:24,747 INFO L226 Difference]: Without dead ends: 116 [2022-11-21 13:51:24,748 INFO L412 NwaCegarLoop]: 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 [2022-11-21 13:51:24,748 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 83 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:24,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 250 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:24,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-21 13:51:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 57. [2022-11-21 13:51:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-21 13:51:24,756 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 13 [2022-11-21 13:51:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:24,757 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-21 13:51:24,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-21 13:51:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 13:51:24,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:24,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:24,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 13:51:24,758 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:24,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1032848570, now seen corresponding path program 1 times [2022-11-21 13:51:24,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:24,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759453731] [2022-11-21 13:51:24,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:24,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:24,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:24,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759453731] [2022-11-21 13:51:24,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759453731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:24,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:24,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:51:24,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241858920] [2022-11-21 13:51:24,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:24,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:51:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:24,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:51:24,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:51:24,831 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:24,925 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-11-21 13:51:24,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:51:24,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 13:51:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:24,926 INFO L225 Difference]: With dead ends: 74 [2022-11-21 13:51:24,926 INFO L226 Difference]: Without dead ends: 72 [2022-11-21 13:51:24,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:24,927 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 69 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:24,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 103 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-21 13:51:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2022-11-21 13:51:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-11-21 13:51:24,935 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 13 [2022-11-21 13:51:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:24,935 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-11-21 13:51:24,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:24,935 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-11-21 13:51:24,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 13:51:24,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:24,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:24,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 13:51:24,937 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:24,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:24,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1031124666, now seen corresponding path program 1 times [2022-11-21 13:51:24,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:24,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499299304] [2022-11-21 13:51:24,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:24,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:25,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:25,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499299304] [2022-11-21 13:51:25,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499299304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:25,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:25,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:51:25,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567665568] [2022-11-21 13:51:25,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:25,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:51:25,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:25,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:51:25,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:51:25,005 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:25,078 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-11-21 13:51:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:51:25,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 13:51:25,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:25,079 INFO L225 Difference]: With dead ends: 55 [2022-11-21 13:51:25,079 INFO L226 Difference]: Without dead ends: 53 [2022-11-21 13:51:25,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:25,080 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:25,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 77 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-21 13:51:25,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-21 13:51:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-11-21 13:51:25,086 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2022-11-21 13:51:25,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:25,087 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-11-21 13:51:25,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-11-21 13:51:25,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 13:51:25,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:25,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:25,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 13:51:25,088 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:25,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash 310078394, now seen corresponding path program 1 times [2022-11-21 13:51:25,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:25,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761363942] [2022-11-21 13:51:25,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:25,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:25,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:25,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761363942] [2022-11-21 13:51:25,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761363942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:25,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:25,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:51:25,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16637483] [2022-11-21 13:51:25,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:25,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:51:25,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:25,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:51:25,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:25,237 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:25,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:25,329 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2022-11-21 13:51:25,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:51:25,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 13:51:25,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:25,332 INFO L225 Difference]: With dead ends: 78 [2022-11-21 13:51:25,332 INFO L226 Difference]: Without dead ends: 76 [2022-11-21 13:51:25,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:51:25,333 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 89 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:25,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 85 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-21 13:51:25,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 53. [2022-11-21 13:51:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-11-21 13:51:25,340 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 14 [2022-11-21 13:51:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:25,340 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-11-21 13:51:25,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-11-21 13:51:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 13:51:25,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:25,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:25,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 13:51:25,342 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:25,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:25,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1953530500, now seen corresponding path program 1 times [2022-11-21 13:51:25,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:25,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393437861] [2022-11-21 13:51:25,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:25,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:25,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:25,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393437861] [2022-11-21 13:51:25,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393437861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:25,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:25,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:51:25,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454358999] [2022-11-21 13:51:25,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:25,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:51:25,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:25,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:51:25,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:25,503 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:25,603 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-11-21 13:51:25,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:51:25,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 13:51:25,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:25,605 INFO L225 Difference]: With dead ends: 92 [2022-11-21 13:51:25,605 INFO L226 Difference]: Without dead ends: 90 [2022-11-21 13:51:25,605 INFO L412 NwaCegarLoop]: 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 [2022-11-21 13:51:25,607 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 59 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:25,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 131 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-21 13:51:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2022-11-21 13:51:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-11-21 13:51:25,624 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 14 [2022-11-21 13:51:25,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:25,624 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-11-21 13:51:25,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:25,625 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-11-21 13:51:25,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 13:51:25,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:25,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:25,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 13:51:25,626 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:25,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:25,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1951983355, now seen corresponding path program 1 times [2022-11-21 13:51:25,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:25,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183480114] [2022-11-21 13:51:25,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:25,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:25,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:25,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183480114] [2022-11-21 13:51:25,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183480114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:25,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:25,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:51:25,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254416925] [2022-11-21 13:51:25,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:25,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:51:25,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:25,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:51:25,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:51:25,681 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:25,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:25,763 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-11-21 13:51:25,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:51:25,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 13:51:25,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:25,764 INFO L225 Difference]: With dead ends: 81 [2022-11-21 13:51:25,764 INFO L226 Difference]: Without dead ends: 79 [2022-11-21 13:51:25,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:25,765 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 60 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:25,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 95 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-21 13:51:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2022-11-21 13:51:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-11-21 13:51:25,774 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 14 [2022-11-21 13:51:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:25,774 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-11-21 13:51:25,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-11-21 13:51:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 13:51:25,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:25,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:25,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 13:51:25,776 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:25,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1900089420, now seen corresponding path program 1 times [2022-11-21 13:51:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:25,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234784467] [2022-11-21 13:51:25,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:25,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:25,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234784467] [2022-11-21 13:51:25,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234784467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:25,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:25,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:51:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994530233] [2022-11-21 13:51:25,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:25,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:51:25,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:25,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:51:25,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:25,943 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:26,024 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-11-21 13:51:26,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:51:26,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 13:51:26,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:26,025 INFO L225 Difference]: With dead ends: 70 [2022-11-21 13:51:26,025 INFO L226 Difference]: Without dead ends: 66 [2022-11-21 13:51:26,027 INFO L412 NwaCegarLoop]: 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 [2022-11-21 13:51:26,027 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 30 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:26,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 96 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:26,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-21 13:51:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2022-11-21 13:51:26,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-11-21 13:51:26,035 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 14 [2022-11-21 13:51:26,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:26,036 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-11-21 13:51:26,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-11-21 13:51:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 13:51:26,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:26,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:26,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 13:51:26,037 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:26,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:26,038 INFO L85 PathProgramCache]: Analyzing trace with hash -381937728, now seen corresponding path program 1 times [2022-11-21 13:51:26,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:26,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729175166] [2022-11-21 13:51:26,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:26,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:26,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:26,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729175166] [2022-11-21 13:51:26,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729175166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:26,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:26,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:51:26,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313299211] [2022-11-21 13:51:26,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:26,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:51:26,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:26,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:51:26,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:26,222 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:26,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:26,317 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2022-11-21 13:51:26,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:51:26,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 13:51:26,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:26,319 INFO L225 Difference]: With dead ends: 87 [2022-11-21 13:51:26,319 INFO L226 Difference]: Without dead ends: 85 [2022-11-21 13:51:26,319 INFO L412 NwaCegarLoop]: 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 [2022-11-21 13:51:26,320 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 51 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:26,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 147 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-21 13:51:26,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2022-11-21 13:51:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.25) internal successors, (70), 62 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-11-21 13:51:26,330 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 15 [2022-11-21 13:51:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:26,330 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-11-21 13:51:26,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-11-21 13:51:26,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 13:51:26,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:26,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:26,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 13:51:26,332 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:26,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash -441974753, now seen corresponding path program 1 times [2022-11-21 13:51:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:26,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229825925] [2022-11-21 13:51:26,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:26,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:26,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:26,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229825925] [2022-11-21 13:51:26,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229825925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:26,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:26,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:51:26,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873224813] [2022-11-21 13:51:26,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:26,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:51:26,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:26,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:51:26,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:51:26,397 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:26,428 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-11-21 13:51:26,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:51:26,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 13:51:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:26,429 INFO L225 Difference]: With dead ends: 63 [2022-11-21 13:51:26,429 INFO L226 Difference]: Without dead ends: 61 [2022-11-21 13:51:26,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:51:26,430 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 35 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:26,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 64 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:51:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-21 13:51:26,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-21 13:51:26,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:26,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-11-21 13:51:26,439 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 16 [2022-11-21 13:51:26,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:26,441 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-11-21 13:51:26,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:26,441 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-11-21 13:51:26,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 13:51:26,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:26,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:26,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 13:51:26,442 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:26,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:26,443 INFO L85 PathProgramCache]: Analyzing trace with hash -816311340, now seen corresponding path program 1 times [2022-11-21 13:51:26,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:26,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161602662] [2022-11-21 13:51:26,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:26,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:26,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:26,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161602662] [2022-11-21 13:51:26,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161602662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:26,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:26,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:51:26,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886635425] [2022-11-21 13:51:26,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:26,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:51:26,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:26,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:51:26,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:51:26,495 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:26,549 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-11-21 13:51:26,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:51:26,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 13:51:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:26,551 INFO L225 Difference]: With dead ends: 61 [2022-11-21 13:51:26,551 INFO L226 Difference]: Without dead ends: 57 [2022-11-21 13:51:26,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:51:26,552 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:26,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 86 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:51:26,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-21 13:51:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-21 13:51:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-11-21 13:51:26,559 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 17 [2022-11-21 13:51:26,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:26,560 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-11-21 13:51:26,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:26,560 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-11-21 13:51:26,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 13:51:26,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:26,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:26,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 13:51:26,561 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:26,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:26,561 INFO L85 PathProgramCache]: Analyzing trace with hash -508949322, now seen corresponding path program 1 times [2022-11-21 13:51:26,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:26,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618062007] [2022-11-21 13:51:26,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:26,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:26,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:26,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618062007] [2022-11-21 13:51:26,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618062007] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:26,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798544966] [2022-11-21 13:51:26,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:26,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:26,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:51:26,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:51:26,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 13:51:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:26,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-21 13:51:26,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:27,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:51:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:51:27,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798544966] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:51:27,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:51:27,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 17 [2022-11-21 13:51:27,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298733410] [2022-11-21 13:51:27,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:51:27,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-21 13:51:27,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:27,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-21 13:51:27,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-21 13:51:27,227 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:27,542 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-11-21 13:51:27,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 13:51:27,543 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-21 13:51:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:27,543 INFO L225 Difference]: With dead ends: 104 [2022-11-21 13:51:27,543 INFO L226 Difference]: Without dead ends: 102 [2022-11-21 13:51:27,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2022-11-21 13:51:27,544 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 252 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:27,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 145 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:51:27,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-21 13:51:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 53. [2022-11-21 13:51:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:27,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2022-11-21 13:51:27,554 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 18 [2022-11-21 13:51:27,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:27,554 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2022-11-21 13:51:27,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:27,554 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2022-11-21 13:51:27,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 13:51:27,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:27,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:27,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 13:51:27,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:27,761 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:27,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash 479271318, now seen corresponding path program 1 times [2022-11-21 13:51:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:27,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665692068] [2022-11-21 13:51:27,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:27,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:27,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665692068] [2022-11-21 13:51:27,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665692068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:27,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:27,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:51:27,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590122800] [2022-11-21 13:51:27,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:27,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:51:27,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:27,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:51:27,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:27,883 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:27,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:27,988 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2022-11-21 13:51:27,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:51:27,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-21 13:51:27,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:27,990 INFO L225 Difference]: With dead ends: 68 [2022-11-21 13:51:27,990 INFO L226 Difference]: Without dead ends: 66 [2022-11-21 13:51:27,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:51:27,991 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 71 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:27,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 44 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-21 13:51:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2022-11-21 13:51:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-11-21 13:51:28,004 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 18 [2022-11-21 13:51:28,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:28,004 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-11-21 13:51:28,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-11-21 13:51:28,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:51:28,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:28,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:28,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 13:51:28,006 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:28,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash 397067279, now seen corresponding path program 1 times [2022-11-21 13:51:28,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:28,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494636982] [2022-11-21 13:51:28,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:28,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:28,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:28,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494636982] [2022-11-21 13:51:28,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494636982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:28,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:28,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:51:28,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593119009] [2022-11-21 13:51:28,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:28,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:51:28,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:28,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:51:28,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:28,139 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:28,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:28,227 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2022-11-21 13:51:28,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:51:28,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 13:51:28,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:28,228 INFO L225 Difference]: With dead ends: 60 [2022-11-21 13:51:28,228 INFO L226 Difference]: Without dead ends: 58 [2022-11-21 13:51:28,228 INFO L412 NwaCegarLoop]: 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 [2022-11-21 13:51:28,229 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 85 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:28,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 37 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:51:28,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-21 13:51:28,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2022-11-21 13:51:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:28,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-11-21 13:51:28,239 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 19 [2022-11-21 13:51:28,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:28,239 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-11-21 13:51:28,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-11-21 13:51:28,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:51:28,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:28,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:28,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 13:51:28,240 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:28,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:28,241 INFO L85 PathProgramCache]: Analyzing trace with hash 450508359, now seen corresponding path program 1 times [2022-11-21 13:51:28,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:28,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475328430] [2022-11-21 13:51:28,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:28,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:28,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:28,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475328430] [2022-11-21 13:51:28,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475328430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:51:28,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:51:28,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:51:28,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179582637] [2022-11-21 13:51:28,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:51:28,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:51:28,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:28,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:51:28,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:51:28,340 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:28,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:28,410 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-11-21 13:51:28,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:51:28,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 13:51:28,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:28,411 INFO L225 Difference]: With dead ends: 43 [2022-11-21 13:51:28,411 INFO L226 Difference]: Without dead ends: 20 [2022-11-21 13:51:28,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:51:28,414 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 64 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:28,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 27 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:51:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-21 13:51:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-21 13:51:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-11-21 13:51:28,418 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 19 [2022-11-21 13:51:28,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:28,419 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-11-21 13:51:28,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-11-21 13:51:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:51:28,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:28,420 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:51:28,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 13:51:28,421 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-21 13:51:28,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:28,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1395641153, now seen corresponding path program 1 times [2022-11-21 13:51:28,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:28,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670423746] [2022-11-21 13:51:28,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:28,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:28,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:28,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670423746] [2022-11-21 13:51:28,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670423746] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:28,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282902140] [2022-11-21 13:51:28,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:28,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:28,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:51:28,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:51:28,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 13:51:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:28,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-21 13:51:28,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:28,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:51:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:51:28,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282902140] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:51:28,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:51:28,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 17 [2022-11-21 13:51:28,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478664782] [2022-11-21 13:51:28,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:51:28,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-21 13:51:28,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:28,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-21 13:51:28,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-21 13:51:28,931 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:29,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:29,050 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-11-21 13:51:29,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 13:51:29,051 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 13:51:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:29,051 INFO L225 Difference]: With dead ends: 31 [2022-11-21 13:51:29,051 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 13:51:29,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2022-11-21 13:51:29,053 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 52 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:29,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 36 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:51:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 13:51:29,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 13:51:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 13:51:29,055 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-11-21 13:51:29,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:29,055 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 13:51:29,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:51:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 13:51:29,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 13:51:29,058 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2022-11-21 13:51:29,059 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2022-11-21 13:51:29,060 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2022-11-21 13:51:29,060 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2022-11-21 13:51:29,060 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2022-11-21 13:51:29,060 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2022-11-21 13:51:29,060 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2022-11-21 13:51:29,061 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2022-11-21 13:51:29,061 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2022-11-21 13:51:29,061 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2022-11-21 13:51:29,061 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2022-11-21 13:51:29,061 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2022-11-21 13:51:29,061 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2022-11-21 13:51:29,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2022-11-21 13:51:29,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2022-11-21 13:51:29,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2022-11-21 13:51:29,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2022-11-21 13:51:29,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 13:51:29,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-21 13:51:29,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 13:51:40,351 WARN L233 SmtUtils]: Spent 11.08s on a formula simplification. DAG size of input: 77 DAG size of output: 75 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 13:52:07,202 WARN L233 SmtUtils]: Spent 23.95s on a formula simplification. DAG size of input: 73 DAG size of output: 71 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 13:52:07,998 INFO L899 garLoopResultBuilder]: For program point L225(line 225) no Hoare annotation was computed. [2022-11-21 13:52:07,998 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-11-21 13:52:07,998 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 358) no Hoare annotation was computed. [2022-11-21 13:52:07,999 INFO L895 garLoopResultBuilder]: At program point L250(lines 102 252) the Hoare annotation is: (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0)) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0)) (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (not (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| |ULTIMATE.start_main_~main__t~0#1|))) [2022-11-21 13:52:07,999 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2022-11-21 13:52:07,999 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-11-21 13:52:07,999 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 316) no Hoare annotation was computed. [2022-11-21 13:52:07,999 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-11-21 13:52:07,999 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-11-21 13:52:08,000 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2022-11-21 13:52:08,000 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 252) no Hoare annotation was computed. [2022-11-21 13:52:08,000 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 362) no Hoare annotation was computed. [2022-11-21 13:52:08,000 INFO L899 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-11-21 13:52:08,000 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2022-11-21 13:52:08,000 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 13:52:08,000 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 13:52:08,000 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 374) no Hoare annotation was computed. [2022-11-21 13:52:08,000 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-11-21 13:52:08,001 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) no Hoare annotation was computed. [2022-11-21 13:52:08,001 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 243) no Hoare annotation was computed. [2022-11-21 13:52:08,001 INFO L899 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2022-11-21 13:52:08,001 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) no Hoare annotation was computed. [2022-11-21 13:52:08,001 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 161) no Hoare annotation was computed. [2022-11-21 13:52:08,001 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 254) no Hoare annotation was computed. [2022-11-21 13:52:08,001 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-11-21 13:52:08,001 INFO L899 garLoopResultBuilder]: For program point L310(line 310) no Hoare annotation was computed. [2022-11-21 13:52:08,001 INFO L899 garLoopResultBuilder]: For program point L277(lines 277 364) no Hoare annotation was computed. [2022-11-21 13:52:08,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) no Hoare annotation was computed. [2022-11-21 13:52:08,002 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 95) no Hoare annotation was computed. [2022-11-21 13:52:08,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2022-11-21 13:52:08,002 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 197) no Hoare annotation was computed. [2022-11-21 13:52:08,002 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 204) no Hoare annotation was computed. [2022-11-21 13:52:08,002 INFO L899 garLoopResultBuilder]: For program point L237(line 237) no Hoare annotation was computed. [2022-11-21 13:52:08,002 INFO L895 garLoopResultBuilder]: At program point L328(lines 32 368) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_main_~main__t~0#1| 1))) (let ((.cse0 (let ((.cse2 (<= 1 |ULTIMATE.start_main_~main__t~0#1|)) (.cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)))) (or (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 0)) .cse2 .cse3) (and .cse2 .cse3 (not (= |ULTIMATE.start_main_~main__tagbuf_len~0#1| 0)) (< 0 (+ |ULTIMATE.start_main_~main__tagbuf_len~0#1| 1)) .cse1))))) (or (and (or (= |ULTIMATE.start_main_~main__t~0#1| 0) (and .cse0 .cse1)) (< |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) (and .cse0 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 1) (not (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| |ULTIMATE.start_main_~main__t~0#1|)))))) [2022-11-21 13:52:08,003 INFO L895 garLoopResultBuilder]: At program point L196(lines 60 254) the Hoare annotation is: (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0)) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0)) (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) [2022-11-21 13:52:08,003 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) no Hoare annotation was computed. [2022-11-21 13:52:08,003 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-11-21 13:52:08,003 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-11-21 13:52:08,003 INFO L899 garLoopResultBuilder]: For program point L279(line 279) no Hoare annotation was computed. [2022-11-21 13:52:08,003 INFO L899 garLoopResultBuilder]: For program point L337(lines 337 360) no Hoare annotation was computed. [2022-11-21 13:52:08,003 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) no Hoare annotation was computed. [2022-11-21 13:52:08,003 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 210) no Hoare annotation was computed. [2022-11-21 13:52:08,004 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2022-11-21 13:52:08,004 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 318) no Hoare annotation was computed. [2022-11-21 13:52:08,004 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 368) no Hoare annotation was computed. [2022-11-21 13:52:08,004 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 13:52:08,004 INFO L899 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-11-21 13:52:08,004 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-11-21 13:52:08,004 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 369) no Hoare annotation was computed. [2022-11-21 13:52:08,004 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2022-11-21 13:52:08,004 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2022-11-21 13:52:08,004 INFO L899 garLoopResultBuilder]: For program point L289(lines 289 363) no Hoare annotation was computed. [2022-11-21 13:52:08,005 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 13:52:08,005 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2022-11-21 13:52:08,005 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 245) no Hoare annotation was computed. [2022-11-21 13:52:08,005 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 93) no Hoare annotation was computed. [2022-11-21 13:52:08,005 INFO L899 garLoopResultBuilder]: For program point L339(line 339) no Hoare annotation was computed. [2022-11-21 13:52:08,005 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 163) no Hoare annotation was computed. [2022-11-21 13:52:08,005 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 256) no Hoare annotation was computed. [2022-11-21 13:52:08,005 INFO L899 garLoopResultBuilder]: For program point L298(line 298) no Hoare annotation was computed. [2022-11-21 13:52:08,005 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 202) no Hoare annotation was computed. [2022-11-21 13:52:08,006 INFO L902 garLoopResultBuilder]: At program point L315(lines 32 368) the Hoare annotation is: true [2022-11-21 13:52:08,006 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) no Hoare annotation was computed. [2022-11-21 13:52:08,006 INFO L899 garLoopResultBuilder]: For program point L216(lines 216 251) no Hoare annotation was computed. [2022-11-21 13:52:08,006 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2022-11-21 13:52:08,006 INFO L902 garLoopResultBuilder]: At program point L373(lines 15 375) the Hoare annotation is: true [2022-11-21 13:52:08,006 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 199) no Hoare annotation was computed. [2022-11-21 13:52:08,006 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) no Hoare annotation was computed. [2022-11-21 13:52:08,006 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 366) no Hoare annotation was computed. [2022-11-21 13:52:08,006 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 201) no Hoare annotation was computed. [2022-11-21 13:52:08,007 INFO L895 garLoopResultBuilder]: At program point L357(lines 283 364) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~main__t~0#1| 0))) (let ((.cse1 (let ((.cse3 (<= 0 |ULTIMATE.start_main_~main__t~0#1|)) (.cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)))) (or (and .cse3 .cse4 .cse0) (and .cse3 .cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0)))))) (.cse2 (< |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 1) .cse1 .cse2) (and (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 1) .cse1 .cse2)))) [2022-11-21 13:52:08,026 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:52:08,028 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 13:52:08,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:52:08 BoogieIcfgContainer [2022-11-21 13:52:08,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 13:52:08,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 13:52:08,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 13:52:08,058 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 13:52:08,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:51:22" (3/4) ... [2022-11-21 13:52:08,061 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 13:52:08,087 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-21 13:52:08,088 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-21 13:52:08,088 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-21 13:52:08,104 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 13:52:08,175 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 13:52:08,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 13:52:08,176 INFO L158 Benchmark]: Toolchain (without parser) took 47241.52ms. Allocated memory was 167.8MB in the beginning and 664.8MB in the end (delta: 497.0MB). Free memory was 123.4MB in the beginning and 526.0MB in the end (delta: -402.5MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2022-11-21 13:52:08,176 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 121.6MB. Free memory was 84.9MB in the beginning and 84.8MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:52:08,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.77ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 106.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-21 13:52:08,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.21ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 104.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:52:08,177 INFO L158 Benchmark]: Boogie Preprocessor took 25.38ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 103.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:52:08,177 INFO L158 Benchmark]: RCFGBuilder took 710.52ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 132.6MB in the end (delta: -29.1MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2022-11-21 13:52:08,178 INFO L158 Benchmark]: TraceAbstraction took 46022.87ms. Allocated memory was 167.8MB in the beginning and 664.8MB in the end (delta: 497.0MB). Free memory was 132.6MB in the beginning and 531.2MB in the end (delta: -398.6MB). Peak memory consumption was 393.3MB. Max. memory is 16.1GB. [2022-11-21 13:52:08,178 INFO L158 Benchmark]: Witness Printer took 117.91ms. Allocated memory is still 664.8MB. Free memory was 531.2MB in the beginning and 526.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 13:52:08,180 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.26ms. Allocated memory is still 121.6MB. Free memory was 84.9MB in the beginning and 84.8MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.77ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 106.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.21ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 104.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.38ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 103.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 710.52ms. Allocated memory is still 167.8MB. Free memory was 103.5MB in the beginning and 132.6MB in the end (delta: -29.1MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * TraceAbstraction took 46022.87ms. Allocated memory was 167.8MB in the beginning and 664.8MB in the end (delta: 497.0MB). Free memory was 132.6MB in the beginning and 531.2MB in the end (delta: -398.6MB). Peak memory consumption was 393.3MB. Max. memory is 16.1GB. * Witness Printer took 117.91ms. Allocated memory is still 664.8MB. Free memory was 531.2MB in the beginning and 526.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 44]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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: 73]: 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: 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: 155]: 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: 189]: 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: 237]: 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: 298]: 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: 339]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 45.9s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 38.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1515 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1515 mSDsluCounter, 2452 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1498 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1818 IncrementalHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 954 mSDtfsCounter, 1818 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 349 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 17 NumberOfFragments, 189 HoareAnnotationTreeSize, 6 FomulaSimplifications, 279314 FormulaSimplificationTreeSizeReduction, 38.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 465478 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 366 ConstructedInterpolants, 0 QuantifiedInterpolants, 1691 SizeOfPredicates, 12 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && main__t <= main__tagbuf_len - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: (((main__t == 0 && __VERIFIER_assert__cond == 1) && (((0 <= main__t && !(__VERIFIER_assert__cond == 0)) && main__t == 0) || ((0 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && main__t < main__tagbuf_len) || (((1 <= main__t && __VERIFIER_assert__cond == 1) && (((0 <= main__t && !(__VERIFIER_assert__cond == 0)) && main__t == 0) || ((0 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && main__t < main__tagbuf_len) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((main__t == 0 || ((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) || ((((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len == 0)) && 0 < main__tagbuf_len + 1) && main__t <= 1)) && main__t <= 1)) && main__t < main__tagbuf_len) || (((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) || ((((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len == 0)) && 0 < main__tagbuf_len + 1) && main__t <= 1)) && __VERIFIER_assert__cond == 1) && !(main__tagbuf_len <= main__t)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-21 13:52:08,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0f0ed8e-2649-4ba5-826c-c3312eb73a6f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE