./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f5182ada4c25502e8c117aae65840c303a96073ec563a87f29fad662bee2286b --- 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-5e519f3 [2022-11-03 02:41:54,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:41:54,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:41:54,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:41:54,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:41:54,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:41:54,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:41:54,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:41:54,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:41:54,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:41:54,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:41:54,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:41:54,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:41:54,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:41:54,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:41:54,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:41:54,294 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:41:54,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:41:54,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:41:54,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:41:54,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:41:54,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:41:54,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:41:54,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:41:54,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:41:54,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:41:54,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:41:54,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:41:54,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:41:54,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:41:54,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:41:54,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:41:54,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:41:54,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:41:54,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:41:54,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:41:54,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:41:54,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:41:54,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:41:54,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:41:54,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:41:54,337 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:41:54,379 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:41:54,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:41:54,379 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:41:54,380 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:41:54,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:41:54,380 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:41:54,381 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:41:54,381 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:41:54,381 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:41:54,381 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:41:54,381 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:41:54,381 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:41:54,382 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:41:54,382 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:41:54,382 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:41:54,382 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:41:54,382 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:41:54,383 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:41:54,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:41:54,383 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:41:54,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:41:54,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:41:54,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:41:54,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:41:54,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:41:54,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:41:54,385 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:41:54,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:41:54,385 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:41:54,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:41:54,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:41:54,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:41:54,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:41:54,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:41:54,386 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:41:54,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:41:54,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:41:54,387 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:41:54,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:41:54,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:41:54,387 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:41:54,387 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_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI/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_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI 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 -> Taipan 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 -> f5182ada4c25502e8c117aae65840c303a96073ec563a87f29fad662bee2286b [2022-11-03 02:41:54,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:41:54,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:41:54,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:41:54,708 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:41:54,708 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:41:54,710 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2022-11-03 02:41:54,791 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI/data/d0191dde5/2b305da344974669b0733d92b90ee96b/FLAG6c6141285 [2022-11-03 02:41:55,438 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:41:55,439 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2022-11-03 02:41:55,455 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI/data/d0191dde5/2b305da344974669b0733d92b90ee96b/FLAG6c6141285 [2022-11-03 02:41:55,692 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI/data/d0191dde5/2b305da344974669b0733d92b90ee96b [2022-11-03 02:41:55,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:41:55,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:41:55,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:41:55,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:41:55,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:41:55,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:41:55" (1/1) ... [2022-11-03 02:41:55,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ddb9a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:55, skipping insertion in model container [2022-11-03 02:41:55,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:41:55" (1/1) ... [2022-11-03 02:41:55,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:41:55,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:41:56,038 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[901,914] [2022-11-03 02:41:56,043 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1116,1129] [2022-11-03 02:41:56,046 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1625,1638] [2022-11-03 02:41:56,047 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1840,1853] [2022-11-03 02:41:56,050 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2157,2170] [2022-11-03 02:41:56,051 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2372,2385] [2022-11-03 02:41:56,054 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2867,2880] [2022-11-03 02:41:56,056 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3082,3095] [2022-11-03 02:41:56,058 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3384,3397] [2022-11-03 02:41:56,060 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3602,3615] [2022-11-03 02:41:56,062 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3878,3891] [2022-11-03 02:41:56,063 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4096,4109] [2022-11-03 02:41:56,066 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4582,4595] [2022-11-03 02:41:56,067 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4800,4813] [2022-11-03 02:41:56,356 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47686,47699] [2022-11-03 02:41:56,361 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47907,47920] [2022-11-03 02:41:56,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:41:56,398 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:41:56,421 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[901,914] [2022-11-03 02:41:56,422 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1116,1129] [2022-11-03 02:41:56,427 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1625,1638] [2022-11-03 02:41:56,429 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1840,1853] [2022-11-03 02:41:56,439 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2157,2170] [2022-11-03 02:41:56,440 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2372,2385] [2022-11-03 02:41:56,442 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2867,2880] [2022-11-03 02:41:56,443 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3082,3095] [2022-11-03 02:41:56,444 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3384,3397] [2022-11-03 02:41:56,448 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3602,3615] [2022-11-03 02:41:56,450 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3878,3891] [2022-11-03 02:41:56,454 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4096,4109] [2022-11-03 02:41:56,455 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4582,4595] [2022-11-03 02:41:56,464 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4800,4813] [2022-11-03 02:41:56,666 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47686,47699] [2022-11-03 02:41:56,672 WARN L230 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_ab0540b6-21cd-4530-96e1-514e2569a96e/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47907,47920] [2022-11-03 02:41:56,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:41:56,701 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:41:56,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:56 WrapperNode [2022-11-03 02:41:56,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:41:56,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:41:56,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:41:56,704 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:41:56,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:56" (1/1) ... [2022-11-03 02:41:56,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:56" (1/1) ... [2022-11-03 02:41:56,835 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1692 [2022-11-03 02:41:56,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:41:56,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:41:56,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:41:56,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:41:56,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:56" (1/1) ... [2022-11-03 02:41:56,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:56" (1/1) ... [2022-11-03 02:41:56,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:56" (1/1) ... [2022-11-03 02:41:56,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:56" (1/1) ... [2022-11-03 02:41:56,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:56" (1/1) ... [2022-11-03 02:41:56,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:56" (1/1) ... [2022-11-03 02:41:56,923 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:56" (1/1) ... [2022-11-03 02:41:56,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:56" (1/1) ... [2022-11-03 02:41:56,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:41:56,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:41:56,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:41:56,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:41:56,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:56" (1/1) ... [2022-11-03 02:41:56,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:41:56,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:41:57,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:41:57,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:41:57,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:41:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:41:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:41:57,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:41:57,336 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:41:57,339 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:41:58,618 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:41:58,640 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:41:58,641 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 02:41:58,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:41:58 BoogieIcfgContainer [2022-11-03 02:41:58,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:41:58,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:41:58,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:41:58,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:41:58,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:41:55" (1/3) ... [2022-11-03 02:41:58,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1379fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:41:58, skipping insertion in model container [2022-11-03 02:41:58,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:41:56" (2/3) ... [2022-11-03 02:41:58,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1379fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:41:58, skipping insertion in model container [2022-11-03 02:41:58,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:41:58" (3/3) ... [2022-11-03 02:41:58,667 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2022-11-03 02:41:58,687 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:41:58,688 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-03 02:41:58,776 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:41:58,786 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=FINITE_AUTOMATA, 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;@1a036df6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:41:58,787 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-03 02:41:58,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 285 states have (on average 1.975438596491228) internal successors, (563), 301 states have internal predecessors, (563), 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-03 02:41:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:41:58,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:41:58,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:41:58,818 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:41:58,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:41:58,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1144680186, now seen corresponding path program 1 times [2022-11-03 02:41:58,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:41:58,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015178120] [2022-11-03 02:41:58,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:41:58,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:41:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:41:59,219 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-03 02:41:59,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:41:59,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015178120] [2022-11-03 02:41:59,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015178120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:41:59,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:41:59,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:41:59,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518536267] [2022-11-03 02:41:59,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:41:59,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:41:59,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:59,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:41:59,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:41:59,270 INFO L87 Difference]: Start difference. First operand has 302 states, 285 states have (on average 1.975438596491228) internal successors, (563), 301 states have internal predecessors, (563), 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 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-03 02:42:00,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:00,127 INFO L93 Difference]: Finished difference Result 310 states and 568 transitions. [2022-11-03 02:42:00,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:42:00,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-11-03 02:42:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:00,152 INFO L225 Difference]: With dead ends: 310 [2022-11-03 02:42:00,153 INFO L226 Difference]: Without dead ends: 297 [2022-11-03 02:42:00,157 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-03 02:42:00,161 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 485 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:00,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 445 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:42:00,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-11-03 02:42:00,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2022-11-03 02:42:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 282 states have (on average 1.4893617021276595) internal successors, (420), 296 states have internal predecessors, (420), 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-03 02:42:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 420 transitions. [2022-11-03 02:42:00,243 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 420 transitions. Word has length 6 [2022-11-03 02:42:00,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:00,244 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 420 transitions. [2022-11-03 02:42:00,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-03 02:42:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 420 transitions. [2022-11-03 02:42:00,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:42:00,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:00,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:00,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:42:00,246 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:00,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:00,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1125351449, now seen corresponding path program 1 times [2022-11-03 02:42:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:00,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476344569] [2022-11-03 02:42:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:00,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:00,367 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-03 02:42:00,368 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:00,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476344569] [2022-11-03 02:42:00,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476344569] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:00,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:00,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:42:00,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053344063] [2022-11-03 02:42:00,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:00,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:42:00,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:00,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:42:00,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:42:00,372 INFO L87 Difference]: Start difference. First operand 297 states and 420 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-03 02:42:00,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:00,935 INFO L93 Difference]: Finished difference Result 304 states and 427 transitions. [2022-11-03 02:42:00,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:42:00,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2022-11-03 02:42:00,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:00,938 INFO L225 Difference]: With dead ends: 304 [2022-11-03 02:42:00,938 INFO L226 Difference]: Without dead ends: 299 [2022-11-03 02:42:00,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:42:00,939 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 23 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:00,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 982 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:42:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-11-03 02:42:00,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 292. [2022-11-03 02:42:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 278 states have (on average 1.276978417266187) internal successors, (355), 291 states have internal predecessors, (355), 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-03 02:42:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2022-11-03 02:42:00,954 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 7 [2022-11-03 02:42:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:00,954 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2022-11-03 02:42:00,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-03 02:42:00,955 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2022-11-03 02:42:00,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:42:00,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:00,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:00,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:42:00,956 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:00,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:00,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1144463368, now seen corresponding path program 1 times [2022-11-03 02:42:00,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:00,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752631548] [2022-11-03 02:42:00,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:00,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:01,072 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-03 02:42:01,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:01,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752631548] [2022-11-03 02:42:01,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752631548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:01,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:01,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:42:01,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112169657] [2022-11-03 02:42:01,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:01,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:42:01,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:01,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:42:01,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:42:01,075 INFO L87 Difference]: Start difference. First operand 292 states and 355 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-03 02:42:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:01,573 INFO L93 Difference]: Finished difference Result 292 states and 355 transitions. [2022-11-03 02:42:01,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:42:01,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-11-03 02:42:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:01,575 INFO L225 Difference]: With dead ends: 292 [2022-11-03 02:42:01,575 INFO L226 Difference]: Without dead ends: 290 [2022-11-03 02:42:01,576 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-03 02:42:01,577 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 325 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:01,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 162 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:42:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-03 02:42:01,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2022-11-03 02:42:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 277 states have (on average 1.2743682310469313) internal successors, (353), 289 states have internal predecessors, (353), 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-03 02:42:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 353 transitions. [2022-11-03 02:42:01,592 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 353 transitions. Word has length 7 [2022-11-03 02:42:01,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:01,593 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 353 transitions. [2022-11-03 02:42:01,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-03 02:42:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 353 transitions. [2022-11-03 02:42:01,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:42:01,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:01,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:01,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:42:01,595 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:01,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:01,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1118630114, now seen corresponding path program 1 times [2022-11-03 02:42:01,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:01,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356280919] [2022-11-03 02:42:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:01,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:01,724 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-03 02:42:01,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:01,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356280919] [2022-11-03 02:42:01,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356280919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:01,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:01,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:42:01,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084322772] [2022-11-03 02:42:01,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:01,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:42:01,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:01,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:42:01,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:42:01,728 INFO L87 Difference]: Start difference. First operand 290 states and 353 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-03 02:42:02,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:02,070 INFO L93 Difference]: Finished difference Result 295 states and 358 transitions. [2022-11-03 02:42:02,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:42:02,070 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-03 02:42:02,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:02,072 INFO L225 Difference]: With dead ends: 295 [2022-11-03 02:42:02,072 INFO L226 Difference]: Without dead ends: 293 [2022-11-03 02:42:02,073 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-03 02:42:02,074 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 41 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:02,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 743 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:42:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-03 02:42:02,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2022-11-03 02:42:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 280 states have (on average 1.2714285714285714) internal successors, (356), 292 states have internal predecessors, (356), 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-03 02:42:02,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 356 transitions. [2022-11-03 02:42:02,086 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 356 transitions. Word has length 8 [2022-11-03 02:42:02,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:02,086 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 356 transitions. [2022-11-03 02:42:02,086 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-03 02:42:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 356 transitions. [2022-11-03 02:42:02,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:42:02,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:02,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:02,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:42:02,088 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:02,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:02,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1261843174, now seen corresponding path program 1 times [2022-11-03 02:42:02,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:02,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830602661] [2022-11-03 02:42:02,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:02,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:02,160 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-03 02:42:02,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:02,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830602661] [2022-11-03 02:42:02,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830602661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:02,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:02,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:42:02,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357083693] [2022-11-03 02:42:02,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:02,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:42:02,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:02,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:42:02,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:42:02,163 INFO L87 Difference]: Start difference. First operand 293 states and 356 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:42:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:02,793 INFO L93 Difference]: Finished difference Result 293 states and 356 transitions. [2022-11-03 02:42:02,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:42:02,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 02:42:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:02,795 INFO L225 Difference]: With dead ends: 293 [2022-11-03 02:42:02,795 INFO L226 Difference]: Without dead ends: 291 [2022-11-03 02:42:02,796 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-03 02:42:02,799 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 287 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:02,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 273 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:42:02,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-11-03 02:42:02,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2022-11-03 02:42:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 279 states have (on average 1.2688172043010753) internal successors, (354), 290 states have internal predecessors, (354), 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-03 02:42:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 354 transitions. [2022-11-03 02:42:02,811 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 354 transitions. Word has length 10 [2022-11-03 02:42:02,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:02,812 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 354 transitions. [2022-11-03 02:42:02,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:42:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 354 transitions. [2022-11-03 02:42:02,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:42:02,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:02,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:02,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:42:02,814 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:02,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:02,815 INFO L85 PathProgramCache]: Analyzing trace with hash 462436822, now seen corresponding path program 1 times [2022-11-03 02:42:02,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:02,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441608313] [2022-11-03 02:42:02,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:02,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:02,939 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-03 02:42:02,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:02,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441608313] [2022-11-03 02:42:02,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441608313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:02,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:02,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:42:02,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604833784] [2022-11-03 02:42:02,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:02,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:42:02,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:02,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:42:02,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:42:02,946 INFO L87 Difference]: Start difference. First operand 291 states and 354 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:42:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:03,293 INFO L93 Difference]: Finished difference Result 291 states and 354 transitions. [2022-11-03 02:42:03,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:42:03,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:42:03,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:03,295 INFO L225 Difference]: With dead ends: 291 [2022-11-03 02:42:03,296 INFO L226 Difference]: Without dead ends: 287 [2022-11-03 02:42:03,296 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-03 02:42:03,299 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 12 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:03,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 762 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:42:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-03 02:42:03,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2022-11-03 02:42:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 276 states have (on average 1.2681159420289856) internal successors, (350), 286 states have internal predecessors, (350), 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-03 02:42:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 350 transitions. [2022-11-03 02:42:03,315 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 350 transitions. Word has length 11 [2022-11-03 02:42:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:03,316 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 350 transitions. [2022-11-03 02:42:03,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:42:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 350 transitions. [2022-11-03 02:42:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:42:03,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:03,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:03,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:42:03,318 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:03,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:03,319 INFO L85 PathProgramCache]: Analyzing trace with hash -959031714, now seen corresponding path program 1 times [2022-11-03 02:42:03,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:03,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015089743] [2022-11-03 02:42:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:03,568 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-03 02:42:03,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:03,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015089743] [2022-11-03 02:42:03,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015089743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:03,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:03,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:42:03,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255989066] [2022-11-03 02:42:03,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:03,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:42:03,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:03,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:42:03,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:42:03,571 INFO L87 Difference]: Start difference. First operand 287 states and 350 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-03 02:42:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:04,257 INFO L93 Difference]: Finished difference Result 315 states and 380 transitions. [2022-11-03 02:42:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:42:04,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-03 02:42:04,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:04,259 INFO L225 Difference]: With dead ends: 315 [2022-11-03 02:42:04,259 INFO L226 Difference]: Without dead ends: 313 [2022-11-03 02:42:04,259 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-03 02:42:04,260 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 89 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:04,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 891 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:42:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-11-03 02:42:04,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 287. [2022-11-03 02:42:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 276 states have (on average 1.2681159420289856) internal successors, (350), 286 states have internal predecessors, (350), 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-03 02:42:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 350 transitions. [2022-11-03 02:42:04,269 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 350 transitions. Word has length 12 [2022-11-03 02:42:04,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:04,269 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 350 transitions. [2022-11-03 02:42:04,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-03 02:42:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 350 transitions. [2022-11-03 02:42:04,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:42:04,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:04,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:04,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:42:04,271 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:04,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:04,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1465785465, now seen corresponding path program 1 times [2022-11-03 02:42:04,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:04,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391976400] [2022-11-03 02:42:04,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:04,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:04,364 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-03 02:42:04,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:04,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391976400] [2022-11-03 02:42:04,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391976400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:04,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:04,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:42:04,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733429613] [2022-11-03 02:42:04,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:04,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:42:04,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:04,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:42:04,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:42:04,367 INFO L87 Difference]: Start difference. First operand 287 states and 350 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-03 02:42:04,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:04,952 INFO L93 Difference]: Finished difference Result 307 states and 372 transitions. [2022-11-03 02:42:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:42:04,952 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-03 02:42:04,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:04,954 INFO L225 Difference]: With dead ends: 307 [2022-11-03 02:42:04,954 INFO L226 Difference]: Without dead ends: 305 [2022-11-03 02:42:04,954 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-03 02:42:04,955 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 303 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:04,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 281 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:42:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-11-03 02:42:04,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 285. [2022-11-03 02:42:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 275 states have (on average 1.2654545454545454) internal successors, (348), 284 states have internal predecessors, (348), 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-03 02:42:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 348 transitions. [2022-11-03 02:42:04,964 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 348 transitions. Word has length 12 [2022-11-03 02:42:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:04,964 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 348 transitions. [2022-11-03 02:42:04,964 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-03 02:42:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 348 transitions. [2022-11-03 02:42:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:42:04,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:04,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:04,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:42:04,966 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:04,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:04,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1467509369, now seen corresponding path program 1 times [2022-11-03 02:42:04,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:04,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130057522] [2022-11-03 02:42:04,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:04,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:05,028 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-03 02:42:05,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:05,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130057522] [2022-11-03 02:42:05,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130057522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:05,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:05,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:42:05,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36873337] [2022-11-03 02:42:05,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:05,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:42:05,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:05,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:42:05,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:42:05,031 INFO L87 Difference]: Start difference. First operand 285 states and 348 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-03 02:42:05,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:05,610 INFO L93 Difference]: Finished difference Result 288 states and 351 transitions. [2022-11-03 02:42:05,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:42:05,611 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-03 02:42:05,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:05,612 INFO L225 Difference]: With dead ends: 288 [2022-11-03 02:42:05,613 INFO L226 Difference]: Without dead ends: 286 [2022-11-03 02:42:05,613 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-03 02:42:05,614 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 277 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:05,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 255 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:42:05,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-03 02:42:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2022-11-03 02:42:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 274 states have (on average 1.2627737226277371) internal successors, (346), 282 states have internal predecessors, (346), 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-03 02:42:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 346 transitions. [2022-11-03 02:42:05,622 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 346 transitions. Word has length 12 [2022-11-03 02:42:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:05,623 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 346 transitions. [2022-11-03 02:42:05,623 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-03 02:42:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 346 transitions. [2022-11-03 02:42:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:42:05,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:05,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:05,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:42:05,624 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:05,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:05,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1805286727, now seen corresponding path program 1 times [2022-11-03 02:42:05,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:05,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438356174] [2022-11-03 02:42:05,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:05,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:05,777 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-03 02:42:05,777 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:05,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438356174] [2022-11-03 02:42:05,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438356174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:05,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:05,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:42:05,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527398070] [2022-11-03 02:42:05,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:05,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:42:05,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:05,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:42:05,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:42:05,779 INFO L87 Difference]: Start difference. First operand 283 states and 346 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-03 02:42:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:06,310 INFO L93 Difference]: Finished difference Result 321 states and 388 transitions. [2022-11-03 02:42:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:42:06,310 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-03 02:42:06,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:06,312 INFO L225 Difference]: With dead ends: 321 [2022-11-03 02:42:06,312 INFO L226 Difference]: Without dead ends: 319 [2022-11-03 02:42:06,312 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-03 02:42:06,313 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 57 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:06,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 837 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:42:06,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-03 02:42:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 291. [2022-11-03 02:42:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 282 states have (on average 1.2624113475177305) internal successors, (356), 290 states have internal predecessors, (356), 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-03 02:42:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 356 transitions. [2022-11-03 02:42:06,322 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 356 transitions. Word has length 13 [2022-11-03 02:42:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:06,322 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 356 transitions. [2022-11-03 02:42:06,322 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-03 02:42:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 356 transitions. [2022-11-03 02:42:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:42:06,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:06,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:06,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:42:06,323 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:06,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:06,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1803739582, now seen corresponding path program 1 times [2022-11-03 02:42:06,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:06,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694254153] [2022-11-03 02:42:06,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:06,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:06,402 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-03 02:42:06,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:06,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694254153] [2022-11-03 02:42:06,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694254153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:06,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:06,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:42:06,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019629590] [2022-11-03 02:42:06,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:06,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:42:06,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:06,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:42:06,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:42:06,405 INFO L87 Difference]: Start difference. First operand 291 states and 356 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-03 02:42:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:06,985 INFO L93 Difference]: Finished difference Result 311 states and 378 transitions. [2022-11-03 02:42:06,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:42:06,986 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-03 02:42:06,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:06,987 INFO L225 Difference]: With dead ends: 311 [2022-11-03 02:42:06,987 INFO L226 Difference]: Without dead ends: 309 [2022-11-03 02:42:06,988 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-03 02:42:06,988 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 294 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:06,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 273 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:42:06,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-11-03 02:42:07,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 289. [2022-11-03 02:42:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 281 states have (on average 1.2597864768683273) internal successors, (354), 288 states have internal predecessors, (354), 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-03 02:42:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 354 transitions. [2022-11-03 02:42:07,006 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 354 transitions. Word has length 13 [2022-11-03 02:42:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:07,007 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 354 transitions. [2022-11-03 02:42:07,007 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-03 02:42:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 354 transitions. [2022-11-03 02:42:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:42:07,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:07,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:07,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:42:07,009 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:07,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1751845647, now seen corresponding path program 1 times [2022-11-03 02:42:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:07,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906917409] [2022-11-03 02:42:07,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:07,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:07,200 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-03 02:42:07,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:07,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906917409] [2022-11-03 02:42:07,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906917409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:07,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:07,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:42:07,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632781059] [2022-11-03 02:42:07,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:07,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:42:07,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:07,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:42:07,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:42:07,202 INFO L87 Difference]: Start difference. First operand 289 states and 354 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-03 02:42:07,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:07,703 INFO L93 Difference]: Finished difference Result 299 states and 364 transitions. [2022-11-03 02:42:07,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:42:07,703 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-03 02:42:07,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:07,705 INFO L225 Difference]: With dead ends: 299 [2022-11-03 02:42:07,705 INFO L226 Difference]: Without dead ends: 295 [2022-11-03 02:42:07,705 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-03 02:42:07,706 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 29 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:07,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 802 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:42:07,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-03 02:42:07,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 290. [2022-11-03 02:42:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 282 states have (on average 1.2588652482269505) internal successors, (355), 289 states have internal predecessors, (355), 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-03 02:42:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 355 transitions. [2022-11-03 02:42:07,716 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 355 transitions. Word has length 13 [2022-11-03 02:42:07,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:07,716 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 355 transitions. [2022-11-03 02:42:07,716 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-03 02:42:07,717 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 355 transitions. [2022-11-03 02:42:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:42:07,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:07,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:07,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:42:07,718 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:07,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:07,718 INFO L85 PathProgramCache]: Analyzing trace with hash -81348045, now seen corresponding path program 1 times [2022-11-03 02:42:07,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:07,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196684320] [2022-11-03 02:42:07,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:07,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:07,901 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-03 02:42:07,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:07,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196684320] [2022-11-03 02:42:07,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196684320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:07,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:07,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:42:07,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966919330] [2022-11-03 02:42:07,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:07,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:42:07,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:07,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:42:07,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:42:07,904 INFO L87 Difference]: Start difference. First operand 290 states and 355 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-03 02:42:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:08,399 INFO L93 Difference]: Finished difference Result 316 states and 383 transitions. [2022-11-03 02:42:08,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:42:08,399 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-03 02:42:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:08,401 INFO L225 Difference]: With dead ends: 316 [2022-11-03 02:42:08,401 INFO L226 Difference]: Without dead ends: 314 [2022-11-03 02:42:08,402 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-03 02:42:08,402 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 46 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:08,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 853 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:42:08,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-11-03 02:42:08,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 293. [2022-11-03 02:42:08,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 285 states have (on average 1.256140350877193) internal successors, (358), 292 states have internal predecessors, (358), 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-03 02:42:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 358 transitions. [2022-11-03 02:42:08,414 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 358 transitions. Word has length 14 [2022-11-03 02:42:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:08,414 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 358 transitions. [2022-11-03 02:42:08,414 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-03 02:42:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 358 transitions. [2022-11-03 02:42:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:42:08,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:08,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:08,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 02:42:08,415 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:08,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash 286370844, now seen corresponding path program 1 times [2022-11-03 02:42:08,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:08,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936663410] [2022-11-03 02:42:08,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:08,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:08,471 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-03 02:42:08,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:08,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936663410] [2022-11-03 02:42:08,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936663410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:08,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:08,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:42:08,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109233999] [2022-11-03 02:42:08,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:08,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:42:08,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:08,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:42:08,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:42:08,474 INFO L87 Difference]: Start difference. First operand 293 states and 358 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:42:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:08,736 INFO L93 Difference]: Finished difference Result 293 states and 358 transitions. [2022-11-03 02:42:08,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:42:08,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 02:42:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:08,738 INFO L225 Difference]: With dead ends: 293 [2022-11-03 02:42:08,738 INFO L226 Difference]: Without dead ends: 291 [2022-11-03 02:42:08,739 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-03 02:42:08,739 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 330 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:08,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 416 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:42:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-11-03 02:42:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2022-11-03 02:42:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 284 states have (on average 1.2535211267605635) internal successors, (356), 290 states have internal predecessors, (356), 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-03 02:42:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 356 transitions. [2022-11-03 02:42:08,753 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 356 transitions. Word has length 15 [2022-11-03 02:42:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:08,754 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 356 transitions. [2022-11-03 02:42:08,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:42:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 356 transitions. [2022-11-03 02:42:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:42:08,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:08,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:08,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 02:42:08,756 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:08,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash 15602792, now seen corresponding path program 1 times [2022-11-03 02:42:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:08,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147722474] [2022-11-03 02:42:08,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:08,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:08,856 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-03 02:42:08,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:08,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147722474] [2022-11-03 02:42:08,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147722474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:08,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:08,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:42:08,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919755535] [2022-11-03 02:42:08,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:08,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:42:08,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:08,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:42:08,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:42:08,859 INFO L87 Difference]: Start difference. First operand 291 states and 356 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-03 02:42:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:09,467 INFO L93 Difference]: Finished difference Result 291 states and 356 transitions. [2022-11-03 02:42:09,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:42:09,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-03 02:42:09,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:09,469 INFO L225 Difference]: With dead ends: 291 [2022-11-03 02:42:09,469 INFO L226 Difference]: Without dead ends: 289 [2022-11-03 02:42:09,469 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-03 02:42:09,470 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 699 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:09,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 150 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:42:09,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-03 02:42:09,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2022-11-03 02:42:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 280 states have (on average 1.2535714285714286) internal successors, (351), 285 states have internal predecessors, (351), 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-03 02:42:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 351 transitions. [2022-11-03 02:42:09,482 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 351 transitions. Word has length 16 [2022-11-03 02:42:09,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:09,482 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 351 transitions. [2022-11-03 02:42:09,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-03 02:42:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 351 transitions. [2022-11-03 02:42:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:42:09,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:09,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:09,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 02:42:09,484 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:09,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:09,485 INFO L85 PathProgramCache]: Analyzing trace with hash 287565703, now seen corresponding path program 1 times [2022-11-03 02:42:09,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:09,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208223994] [2022-11-03 02:42:09,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:09,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:09,534 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-03 02:42:09,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:09,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208223994] [2022-11-03 02:42:09,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208223994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:09,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:09,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:42:09,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319646578] [2022-11-03 02:42:09,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:09,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:42:09,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:09,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:42:09,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:42:09,537 INFO L87 Difference]: Start difference. First operand 286 states and 351 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-03 02:42:09,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:09,881 INFO L93 Difference]: Finished difference Result 286 states and 351 transitions. [2022-11-03 02:42:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:42:09,882 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-03 02:42:09,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:09,883 INFO L225 Difference]: With dead ends: 286 [2022-11-03 02:42:09,883 INFO L226 Difference]: Without dead ends: 282 [2022-11-03 02:42:09,884 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-03 02:42:09,884 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 7 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:09,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 728 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:42:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-03 02:42:09,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-11-03 02:42:09,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 277 states have (on average 1.2527075812274369) internal successors, (347), 281 states have internal predecessors, (347), 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-03 02:42:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 347 transitions. [2022-11-03 02:42:09,896 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 347 transitions. Word has length 16 [2022-11-03 02:42:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:09,896 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 347 transitions. [2022-11-03 02:42:09,896 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-03 02:42:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 347 transitions. [2022-11-03 02:42:09,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:42:09,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:09,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:09,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 02:42:09,898 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:09,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:09,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1860971197, now seen corresponding path program 1 times [2022-11-03 02:42:09,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:09,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293261141] [2022-11-03 02:42:09,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:09,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:10,093 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-03 02:42:10,094 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:10,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293261141] [2022-11-03 02:42:10,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293261141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:10,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:10,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:42:10,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990283380] [2022-11-03 02:42:10,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:10,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:42:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:10,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:42:10,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:42:10,097 INFO L87 Difference]: Start difference. First operand 282 states and 347 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:42:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:10,706 INFO L93 Difference]: Finished difference Result 296 states and 363 transitions. [2022-11-03 02:42:10,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:42:10,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 02:42:10,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:10,708 INFO L225 Difference]: With dead ends: 296 [2022-11-03 02:42:10,708 INFO L226 Difference]: Without dead ends: 294 [2022-11-03 02:42:10,709 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-03 02:42:10,709 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 485 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:10,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 158 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:42:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-03 02:42:10,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 278. [2022-11-03 02:42:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 274 states have (on average 1.2518248175182483) internal successors, (343), 277 states have internal predecessors, (343), 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-03 02:42:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 343 transitions. [2022-11-03 02:42:10,720 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 343 transitions. Word has length 17 [2022-11-03 02:42:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:10,721 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 343 transitions. [2022-11-03 02:42:10,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:42:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 343 transitions. [2022-11-03 02:42:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:42:10,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:10,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:10,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 02:42:10,723 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:10,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1914412277, now seen corresponding path program 1 times [2022-11-03 02:42:10,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:10,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66266792] [2022-11-03 02:42:10,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:10,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:10,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-03 02:42:10,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:10,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66266792] [2022-11-03 02:42:10,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66266792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:10,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:10,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:42:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459802303] [2022-11-03 02:42:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:10,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:42:10,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:10,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:42:10,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:42:10,831 INFO L87 Difference]: Start difference. First operand 278 states and 343 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:42:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:11,415 INFO L93 Difference]: Finished difference Result 278 states and 343 transitions. [2022-11-03 02:42:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:42:11,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 02:42:11,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:11,419 INFO L225 Difference]: With dead ends: 278 [2022-11-03 02:42:11,419 INFO L226 Difference]: Without dead ends: 274 [2022-11-03 02:42:11,420 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-03 02:42:11,421 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 462 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:11,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 148 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:42:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-03 02:42:11,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2022-11-03 02:42:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 271 states have (on average 1.2509225092250922) internal successors, (339), 273 states have internal predecessors, (339), 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-03 02:42:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 339 transitions. [2022-11-03 02:42:11,431 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 339 transitions. Word has length 17 [2022-11-03 02:42:11,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:11,431 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 339 transitions. [2022-11-03 02:42:11,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:42:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 339 transitions. [2022-11-03 02:42:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:42:11,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:11,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:42:11,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 02:42:11,432 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:11,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:11,433 INFO L85 PathProgramCache]: Analyzing trace with hash 339721299, now seen corresponding path program 1 times [2022-11-03 02:42:11,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:11,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957522700] [2022-11-03 02:42:11,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:11,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:11,602 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-03 02:42:11,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:11,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957522700] [2022-11-03 02:42:11,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957522700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:11,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:11,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:42:11,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586832095] [2022-11-03 02:42:11,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:11,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:42:11,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:11,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:42:11,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:42:11,605 INFO L87 Difference]: Start difference. First operand 274 states and 339 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:42:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:12,190 INFO L93 Difference]: Finished difference Result 283 states and 350 transitions. [2022-11-03 02:42:12,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:42:12,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 02:42:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:12,192 INFO L225 Difference]: With dead ends: 283 [2022-11-03 02:42:12,192 INFO L226 Difference]: Without dead ends: 249 [2022-11-03 02:42:12,192 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-03 02:42:12,193 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 464 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:12,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 148 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:42:12,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-03 02:42:12,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-11-03 02:42:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 247 states have (on average 1.008097165991903) internal successors, (249), 248 states have internal predecessors, (249), 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-03 02:42:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2022-11-03 02:42:12,199 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 17 [2022-11-03 02:42:12,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:12,199 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2022-11-03 02:42:12,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:42:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2022-11-03 02:42:12,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-11-03 02:42:12,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:12,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:42:12,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 02:42:12,206 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:12,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:12,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1536774122, now seen corresponding path program 1 times [2022-11-03 02:42:12,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:12,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253020349] [2022-11-03 02:42:12,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:12,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:17,465 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-03 02:42:17,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:17,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253020349] [2022-11-03 02:42:17,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253020349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:17,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:17,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-11-03 02:42:17,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270007193] [2022-11-03 02:42:17,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:17,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-03 02:42:17,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:17,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-03 02:42:17,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2022-11-03 02:42:17,475 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand has 63 states, 63 states have (on average 3.857142857142857) internal successors, (243), 63 states have internal predecessors, (243), 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-03 02:42:18,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:18,542 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2022-11-03 02:42:18,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-03 02:42:18,543 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.857142857142857) internal successors, (243), 63 states have internal predecessors, (243), 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 243 [2022-11-03 02:42:18,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:18,544 INFO L225 Difference]: With dead ends: 250 [2022-11-03 02:42:18,545 INFO L226 Difference]: Without dead ends: 248 [2022-11-03 02:42:18,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1896, Invalid=2136, Unknown=0, NotChecked=0, Total=4032 [2022-11-03 02:42:18,547 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 732 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:18,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 11 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 02:42:18,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-03 02:42:18,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2022-11-03 02:42:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.0040650406504066) internal successors, (247), 246 states have internal predecessors, (247), 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-03 02:42:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2022-11-03 02:42:18,554 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2022-11-03 02:42:18,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:18,555 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2022-11-03 02:42:18,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.857142857142857) internal successors, (243), 63 states have internal predecessors, (243), 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-03 02:42:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2022-11-03 02:42:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-11-03 02:42:18,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:18,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:42:18,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 02:42:18,560 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:42:18,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:18,561 INFO L85 PathProgramCache]: Analyzing trace with hash -395352156, now seen corresponding path program 1 times [2022-11-03 02:42:18,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:18,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468245703] [2022-11-03 02:42:18,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:18,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:42:19,382 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-03 02:42:19,383 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:42:19,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468245703] [2022-11-03 02:42:19,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468245703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:42:19,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:42:19,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:42:19,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175875031] [2022-11-03 02:42:19,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:42:19,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:42:19,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:42:19,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:42:19,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:42:19,387 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 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-03 02:42:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:19,919 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2022-11-03 02:42:19,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:42:19,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 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 244 [2022-11-03 02:42:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:19,921 INFO L225 Difference]: With dead ends: 249 [2022-11-03 02:42:19,921 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 02:42:19,922 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-03 02:42:19,922 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 425 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:19,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 5 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:42:19,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 02:42:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 02:42:19,924 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-03 02:42:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 02:42:19,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2022-11-03 02:42:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:19,924 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 02:42:19,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 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-03 02:42:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 02:42:19,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 02:42:19,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-11-03 02:42:19,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-11-03 02:42:19,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-11-03 02:42:19,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-11-03 02:42:19,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-11-03 02:42:19,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-11-03 02:42:19,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-11-03 02:42:19,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-11-03 02:42:19,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-11-03 02:42:19,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-11-03 02:42:19,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-11-03 02:42:19,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-11-03 02:42:19,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-11-03 02:42:19,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-11-03 02:42:19,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-11-03 02:42:19,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-11-03 02:42:19,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 02:42:19,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 02:42:21,525 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2022-11-03 02:42:21,525 INFO L899 garLoopResultBuilder]: For program point L1555(lines 1555 2805) no Hoare annotation was computed. [2022-11-03 02:42:21,525 INFO L899 garLoopResultBuilder]: For program point L2546(lines 2546 2653) no Hoare annotation was computed. [2022-11-03 02:42:21,525 INFO L899 garLoopResultBuilder]: For program point L2480(lines 2480 2663) no Hoare annotation was computed. [2022-11-03 02:42:21,525 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 2978) no Hoare annotation was computed. [2022-11-03 02:42:21,525 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2022-11-03 02:42:21,525 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 2937) no Hoare annotation was computed. [2022-11-03 02:42:21,525 INFO L899 garLoopResultBuilder]: For program point L1688(lines 1688 2785) no Hoare annotation was computed. [2022-11-03 02:42:21,525 INFO L899 garLoopResultBuilder]: For program point L1622(lines 1622 2795) no Hoare annotation was computed. [2022-11-03 02:42:21,526 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 125) no Hoare annotation was computed. [2022-11-03 02:42:21,526 INFO L899 garLoopResultBuilder]: For program point L1953(lines 1953 2744) no Hoare annotation was computed. [2022-11-03 02:42:21,526 INFO L899 garLoopResultBuilder]: For program point L830(lines 830 2917) no Hoare annotation was computed. [2022-11-03 02:42:21,526 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 2927) no Hoare annotation was computed. [2022-11-03 02:42:21,526 INFO L899 garLoopResultBuilder]: For program point L2614(lines 2614 2643) no Hoare annotation was computed. [2022-11-03 02:42:21,526 INFO L899 garLoopResultBuilder]: For program point L2218(lines 2218 2703) no Hoare annotation was computed. [2022-11-03 02:42:21,526 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1095 2876) no Hoare annotation was computed. [2022-11-03 02:42:21,526 INFO L899 garLoopResultBuilder]: For program point L1360(lines 1360 2835) no Hoare annotation was computed. [2022-11-03 02:42:21,526 INFO L899 garLoopResultBuilder]: For program point L2351(lines 2351 2683) no Hoare annotation was computed. [2022-11-03 02:42:21,526 INFO L899 garLoopResultBuilder]: For program point L2285(lines 2285 2693) no Hoare annotation was computed. [2022-11-03 02:42:21,526 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 193) no Hoare annotation was computed. [2022-11-03 02:42:21,526 INFO L899 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2022-11-03 02:42:21,527 INFO L899 garLoopResultBuilder]: For program point L2616(line 2616) no Hoare annotation was computed. [2022-11-03 02:42:21,527 INFO L899 garLoopResultBuilder]: For program point L502(lines 502 2967) no Hoare annotation was computed. [2022-11-03 02:42:21,527 INFO L899 garLoopResultBuilder]: For program point L1493(lines 1493 2815) no Hoare annotation was computed. [2022-11-03 02:42:21,527 INFO L899 garLoopResultBuilder]: For program point L1427(lines 1427 2825) no Hoare annotation was computed. [2022-11-03 02:42:21,527 INFO L899 garLoopResultBuilder]: For program point L1758(lines 1758 2774) no Hoare annotation was computed. [2022-11-03 02:42:21,527 INFO L899 garLoopResultBuilder]: For program point L635(lines 635 2947) no Hoare annotation was computed. [2022-11-03 02:42:21,527 INFO L899 garLoopResultBuilder]: For program point L569(lines 569 2957) no Hoare annotation was computed. [2022-11-03 02:42:21,527 INFO L902 garLoopResultBuilder]: At program point L2617(lines 16 3008) the Hoare annotation is: true [2022-11-03 02:42:21,527 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-11-03 02:42:21,528 INFO L899 garLoopResultBuilder]: For program point L2023(lines 2023 2733) no Hoare annotation was computed. [2022-11-03 02:42:21,528 INFO L899 garLoopResultBuilder]: For program point L900(lines 900 2906) no Hoare annotation was computed. [2022-11-03 02:42:21,528 INFO L899 garLoopResultBuilder]: For program point L1165(lines 1165 2865) no Hoare annotation was computed. [2022-11-03 02:42:21,528 INFO L899 garLoopResultBuilder]: For program point L2156(lines 2156 2713) no Hoare annotation was computed. [2022-11-03 02:42:21,528 INFO L899 garLoopResultBuilder]: For program point L2090(lines 2090 2723) no Hoare annotation was computed. [2022-11-03 02:42:21,528 INFO L899 garLoopResultBuilder]: For program point L2421(lines 2421 2672) no Hoare annotation was computed. [2022-11-03 02:42:21,528 INFO L899 garLoopResultBuilder]: For program point L307(lines 307 2997) no Hoare annotation was computed. [2022-11-03 02:42:21,528 INFO L899 garLoopResultBuilder]: For program point L1298(lines 1298 2845) no Hoare annotation was computed. [2022-11-03 02:42:21,528 INFO L899 garLoopResultBuilder]: For program point L1232(lines 1232 2855) no Hoare annotation was computed. [2022-11-03 02:42:21,528 INFO L899 garLoopResultBuilder]: For program point L1563(lines 1563 2804) no Hoare annotation was computed. [2022-11-03 02:42:21,528 INFO L899 garLoopResultBuilder]: For program point L440(lines 440 2977) no Hoare annotation was computed. [2022-11-03 02:42:21,529 INFO L899 garLoopResultBuilder]: For program point L374(lines 374 2987) no Hoare annotation was computed. [2022-11-03 02:42:21,529 INFO L899 garLoopResultBuilder]: For program point L1828(lines 1828 2763) no Hoare annotation was computed. [2022-11-03 02:42:21,529 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 2936) no Hoare annotation was computed. [2022-11-03 02:42:21,529 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 55) no Hoare annotation was computed. [2022-11-03 02:42:21,529 INFO L899 garLoopResultBuilder]: For program point L970(lines 970 2895) no Hoare annotation was computed. [2022-11-03 02:42:21,529 INFO L899 garLoopResultBuilder]: For program point L1961(lines 1961 2743) no Hoare annotation was computed. [2022-11-03 02:42:21,529 INFO L899 garLoopResultBuilder]: For program point L1895(lines 1895 2753) no Hoare annotation was computed. [2022-11-03 02:42:21,529 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) no Hoare annotation was computed. [2022-11-03 02:42:21,529 INFO L899 garLoopResultBuilder]: For program point L2226(lines 2226 2702) no Hoare annotation was computed. [2022-11-03 02:42:21,529 INFO L899 garLoopResultBuilder]: For program point L1103(lines 1103 2875) no Hoare annotation was computed. [2022-11-03 02:42:21,529 INFO L899 garLoopResultBuilder]: For program point L1037(lines 1037 2885) no Hoare annotation was computed. [2022-11-03 02:42:21,530 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 2604) no Hoare annotation was computed. [2022-11-03 02:42:21,530 INFO L899 garLoopResultBuilder]: For program point L2623(lines 2623 2642) no Hoare annotation was computed. [2022-11-03 02:42:21,530 INFO L899 garLoopResultBuilder]: For program point L2491(lines 2491 2661) no Hoare annotation was computed. [2022-11-03 02:42:21,530 INFO L899 garLoopResultBuilder]: For program point L1368(lines 1368 2834) no Hoare annotation was computed. [2022-11-03 02:42:21,530 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-11-03 02:42:21,530 INFO L899 garLoopResultBuilder]: For program point L1633(lines 1633 2793) no Hoare annotation was computed. [2022-11-03 02:42:21,530 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2022-11-03 02:42:21,530 INFO L899 garLoopResultBuilder]: For program point L2558(lines 2558 2651) no Hoare annotation was computed. [2022-11-03 02:42:21,530 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 2966) no Hoare annotation was computed. [2022-11-03 02:42:21,532 INFO L899 garLoopResultBuilder]: For program point L246(lines 246 281) no Hoare annotation was computed. [2022-11-03 02:42:21,533 INFO L899 garLoopResultBuilder]: For program point L775(lines 775 2925) no Hoare annotation was computed. [2022-11-03 02:42:21,533 INFO L899 garLoopResultBuilder]: For program point L1766(lines 1766 2773) no Hoare annotation was computed. [2022-11-03 02:42:21,533 INFO L899 garLoopResultBuilder]: For program point L1700(lines 1700 2783) no Hoare annotation was computed. [2022-11-03 02:42:21,534 INFO L895 garLoopResultBuilder]: At program point L2625(lines 25 3002) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~main__t~0#1|) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) [2022-11-03 02:42:21,534 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 123) no Hoare annotation was computed. [2022-11-03 02:42:21,534 INFO L899 garLoopResultBuilder]: For program point L2031(lines 2031 2732) no Hoare annotation was computed. [2022-11-03 02:42:21,534 INFO L899 garLoopResultBuilder]: For program point L908(lines 908 2905) no Hoare annotation was computed. [2022-11-03 02:42:21,535 INFO L899 garLoopResultBuilder]: For program point L842(lines 842 2915) no Hoare annotation was computed. [2022-11-03 02:42:21,535 INFO L899 garLoopResultBuilder]: For program point L2296(lines 2296 2691) no Hoare annotation was computed. [2022-11-03 02:42:21,535 INFO L899 garLoopResultBuilder]: For program point L1173(lines 1173 2864) no Hoare annotation was computed. [2022-11-03 02:42:21,535 INFO L899 garLoopResultBuilder]: For program point L1438(lines 1438 2823) no Hoare annotation was computed. [2022-11-03 02:42:21,535 INFO L899 garLoopResultBuilder]: For program point L2429(lines 2429 2671) no Hoare annotation was computed. [2022-11-03 02:42:21,535 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 2996) no Hoare annotation was computed. [2022-11-03 02:42:21,536 INFO L899 garLoopResultBuilder]: For program point L2363(lines 2363 2681) no Hoare annotation was computed. [2022-11-03 02:42:21,536 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 191) no Hoare annotation was computed. [2022-11-03 02:42:21,536 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-11-03 02:42:21,536 INFO L899 garLoopResultBuilder]: For program point L580(lines 580 2955) no Hoare annotation was computed. [2022-11-03 02:42:21,536 INFO L899 garLoopResultBuilder]: For program point L1571(lines 1571 2803) no Hoare annotation was computed. [2022-11-03 02:42:21,536 INFO L899 garLoopResultBuilder]: For program point L1505(lines 1505 2813) no Hoare annotation was computed. [2022-11-03 02:42:21,537 INFO L899 garLoopResultBuilder]: For program point L1836(lines 1836 2762) no Hoare annotation was computed. [2022-11-03 02:42:21,537 INFO L899 garLoopResultBuilder]: For program point L713(lines 713 2935) no Hoare annotation was computed. [2022-11-03 02:42:21,537 INFO L899 garLoopResultBuilder]: For program point L647(lines 647 2945) no Hoare annotation was computed. [2022-11-03 02:42:21,537 INFO L899 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-11-03 02:42:21,537 INFO L899 garLoopResultBuilder]: For program point L2101(lines 2101 2721) no Hoare annotation was computed. [2022-11-03 02:42:21,537 INFO L899 garLoopResultBuilder]: For program point L978(lines 978 2894) no Hoare annotation was computed. [2022-11-03 02:42:21,538 INFO L899 garLoopResultBuilder]: For program point L1243(lines 1243 2853) no Hoare annotation was computed. [2022-11-03 02:42:21,538 INFO L899 garLoopResultBuilder]: For program point L2234(lines 2234 2701) no Hoare annotation was computed. [2022-11-03 02:42:21,538 INFO L899 garLoopResultBuilder]: For program point L2168(lines 2168 2711) no Hoare annotation was computed. [2022-11-03 02:42:21,538 INFO L899 garLoopResultBuilder]: For program point L2631(lines 2631 2641) no Hoare annotation was computed. [2022-11-03 02:42:21,538 INFO L899 garLoopResultBuilder]: For program point L2499(lines 2499 2660) no Hoare annotation was computed. [2022-11-03 02:42:21,538 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 2985) no Hoare annotation was computed. [2022-11-03 02:42:21,538 INFO L899 garLoopResultBuilder]: For program point L1376(lines 1376 2833) no Hoare annotation was computed. [2022-11-03 02:42:21,539 INFO L899 garLoopResultBuilder]: For program point L1310(lines 1310 2843) no Hoare annotation was computed. [2022-11-03 02:42:21,539 INFO L899 garLoopResultBuilder]: For program point L253(lines 253 275) no Hoare annotation was computed. [2022-11-03 02:42:21,539 INFO L899 garLoopResultBuilder]: For program point L1641(lines 1641 2792) no Hoare annotation was computed. [2022-11-03 02:42:21,539 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 2965) no Hoare annotation was computed. [2022-11-03 02:42:21,539 INFO L899 garLoopResultBuilder]: For program point L452(lines 452 2975) no Hoare annotation was computed. [2022-11-03 02:42:21,539 INFO L899 garLoopResultBuilder]: For program point L1906(lines 1906 2751) no Hoare annotation was computed. [2022-11-03 02:42:21,540 INFO L899 garLoopResultBuilder]: For program point L783(lines 783 2924) no Hoare annotation was computed. [2022-11-03 02:42:21,540 INFO L899 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2022-11-03 02:42:21,540 INFO L899 garLoopResultBuilder]: For program point L1048(lines 1048 2883) no Hoare annotation was computed. [2022-11-03 02:42:21,540 INFO L899 garLoopResultBuilder]: For program point L2039(lines 2039 2731) no Hoare annotation was computed. [2022-11-03 02:42:21,540 INFO L899 garLoopResultBuilder]: For program point L1973(lines 1973 2741) no Hoare annotation was computed. [2022-11-03 02:42:21,541 INFO L895 garLoopResultBuilder]: At program point L2634(lines 64 3001) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|))) (or (and (= |ULTIMATE.start_main_~main__t~0#1| 0) .cse0) (and (<= 1 |ULTIMATE.start_main_~main__t~0#1|) .cse0))) [2022-11-03 02:42:21,541 INFO L899 garLoopResultBuilder]: For program point L2304(lines 2304 2690) no Hoare annotation was computed. [2022-11-03 02:42:21,541 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 02:42:21,541 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-11-03 02:42:21,541 INFO L899 garLoopResultBuilder]: For program point L1181(lines 1181 2863) no Hoare annotation was computed. [2022-11-03 02:42:21,541 INFO L899 garLoopResultBuilder]: For program point L1115(lines 1115 2873) no Hoare annotation was computed. [2022-11-03 02:42:21,542 INFO L899 garLoopResultBuilder]: For program point L2569(lines 2569 2649) no Hoare annotation was computed. [2022-11-03 02:42:21,542 INFO L899 garLoopResultBuilder]: For program point L1446(lines 1446 2822) no Hoare annotation was computed. [2022-11-03 02:42:21,542 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 2995) no Hoare annotation was computed. [2022-11-03 02:42:21,542 INFO L899 garLoopResultBuilder]: For program point L1711(lines 1711 2781) no Hoare annotation was computed. [2022-11-03 02:42:21,542 INFO L899 garLoopResultBuilder]: For program point L588(lines 588 2954) no Hoare annotation was computed. [2022-11-03 02:42:21,542 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2022-11-03 02:42:21,543 INFO L899 garLoopResultBuilder]: For program point L853(lines 853 2913) no Hoare annotation was computed. [2022-11-03 02:42:21,543 INFO L899 garLoopResultBuilder]: For program point L1844(lines 1844 2761) no Hoare annotation was computed. [2022-11-03 02:42:21,543 INFO L899 garLoopResultBuilder]: For program point L1778(lines 1778 2771) no Hoare annotation was computed. [2022-11-03 02:42:21,543 INFO L899 garLoopResultBuilder]: For program point L2109(lines 2109 2720) no Hoare annotation was computed. [2022-11-03 02:42:21,543 INFO L899 garLoopResultBuilder]: For program point L986(lines 986 2893) no Hoare annotation was computed. [2022-11-03 02:42:21,543 INFO L899 garLoopResultBuilder]: For program point L920(lines 920 2903) no Hoare annotation was computed. [2022-11-03 02:42:21,544 INFO L899 garLoopResultBuilder]: For program point L2374(lines 2374 2679) no Hoare annotation was computed. [2022-11-03 02:42:21,544 INFO L899 garLoopResultBuilder]: For program point L1251(lines 1251 2852) no Hoare annotation was computed. [2022-11-03 02:42:21,544 INFO L899 garLoopResultBuilder]: For program point L1516(lines 1516 2811) no Hoare annotation was computed. [2022-11-03 02:42:21,544 INFO L899 garLoopResultBuilder]: For program point L2507(lines 2507 2659) no Hoare annotation was computed. [2022-11-03 02:42:21,544 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 2984) no Hoare annotation was computed. [2022-11-03 02:42:21,545 INFO L899 garLoopResultBuilder]: For program point L2441(lines 2441 2669) no Hoare annotation was computed. [2022-11-03 02:42:21,545 INFO L899 garLoopResultBuilder]: For program point L658(lines 658 2943) no Hoare annotation was computed. [2022-11-03 02:42:21,545 INFO L899 garLoopResultBuilder]: For program point L1649(lines 1649 2791) no Hoare annotation was computed. [2022-11-03 02:42:21,546 INFO L895 garLoopResultBuilder]: At program point L2640(lines 2591 2647) the Hoare annotation is: (and (not (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| |ULTIMATE.start_main_~main__t~0#1|)) (<= 59 |ULTIMATE.start_main_~main__t~0#1|)) [2022-11-03 02:42:21,546 INFO L899 garLoopResultBuilder]: For program point L1583(lines 1583 2801) no Hoare annotation was computed. [2022-11-03 02:42:21,547 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 3001) no Hoare annotation was computed. [2022-11-03 02:42:21,547 INFO L899 garLoopResultBuilder]: For program point L1914(lines 1914 2750) no Hoare annotation was computed. [2022-11-03 02:42:21,547 INFO L899 garLoopResultBuilder]: For program point L791(lines 791 2923) no Hoare annotation was computed. [2022-11-03 02:42:21,547 INFO L899 garLoopResultBuilder]: For program point L725(lines 725 2933) no Hoare annotation was computed. [2022-11-03 02:42:21,547 INFO L899 garLoopResultBuilder]: For program point L2179(lines 2179 2709) no Hoare annotation was computed. [2022-11-03 02:42:21,547 INFO L899 garLoopResultBuilder]: For program point L1056(lines 1056 2882) no Hoare annotation was computed. [2022-11-03 02:42:21,548 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) no Hoare annotation was computed. [2022-11-03 02:42:21,548 INFO L899 garLoopResultBuilder]: For program point L1321(lines 1321 2841) no Hoare annotation was computed. [2022-11-03 02:42:21,548 INFO L899 garLoopResultBuilder]: For program point L2312(lines 2312 2689) no Hoare annotation was computed. [2022-11-03 02:42:21,548 INFO L899 garLoopResultBuilder]: For program point L2246(lines 2246 2699) no Hoare annotation was computed. [2022-11-03 02:42:21,548 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 282) no Hoare annotation was computed. [2022-11-03 02:42:21,548 INFO L899 garLoopResultBuilder]: For program point L2577(lines 2577 2648) no Hoare annotation was computed. [2022-11-03 02:42:21,549 INFO L899 garLoopResultBuilder]: For program point L463(lines 463 2973) no Hoare annotation was computed. [2022-11-03 02:42:21,549 INFO L899 garLoopResultBuilder]: For program point L1454(lines 1454 2821) no Hoare annotation was computed. [2022-11-03 02:42:21,549 INFO L899 garLoopResultBuilder]: For program point L1388(lines 1388 2831) no Hoare annotation was computed. [2022-11-03 02:42:21,549 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 273) no Hoare annotation was computed. [2022-11-03 02:42:21,549 INFO L899 garLoopResultBuilder]: For program point L1719(lines 1719 2780) no Hoare annotation was computed. [2022-11-03 02:42:21,549 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 2953) no Hoare annotation was computed. [2022-11-03 02:42:21,550 INFO L899 garLoopResultBuilder]: For program point L530(lines 530 2963) no Hoare annotation was computed. [2022-11-03 02:42:21,550 INFO L899 garLoopResultBuilder]: For program point L1984(lines 1984 2739) no Hoare annotation was computed. [2022-11-03 02:42:21,550 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 2912) no Hoare annotation was computed. [2022-11-03 02:42:21,550 INFO L899 garLoopResultBuilder]: For program point L267(line 267) no Hoare annotation was computed. [2022-11-03 02:42:21,550 INFO L899 garLoopResultBuilder]: For program point L1126(lines 1126 2871) no Hoare annotation was computed. [2022-11-03 02:42:21,550 INFO L899 garLoopResultBuilder]: For program point L2117(lines 2117 2719) no Hoare annotation was computed. [2022-11-03 02:42:21,551 INFO L899 garLoopResultBuilder]: For program point L2051(lines 2051 2729) no Hoare annotation was computed. [2022-11-03 02:42:21,551 INFO L899 garLoopResultBuilder]: For program point L2382(lines 2382 2678) no Hoare annotation was computed. [2022-11-03 02:42:21,551 INFO L899 garLoopResultBuilder]: For program point L1259(lines 1259 2851) no Hoare annotation was computed. [2022-11-03 02:42:21,551 INFO L899 garLoopResultBuilder]: For program point L1193(lines 1193 2861) no Hoare annotation was computed. [2022-11-03 02:42:21,551 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 240) no Hoare annotation was computed. [2022-11-03 02:42:21,551 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2022-11-03 02:42:21,552 INFO L899 garLoopResultBuilder]: For program point L1524(lines 1524 2810) no Hoare annotation was computed. [2022-11-03 02:42:21,552 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 2983) no Hoare annotation was computed. [2022-11-03 02:42:21,552 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 2993) no Hoare annotation was computed. [2022-11-03 02:42:21,552 INFO L899 garLoopResultBuilder]: For program point L1789(lines 1789 2769) no Hoare annotation was computed. [2022-11-03 02:42:21,552 INFO L899 garLoopResultBuilder]: For program point L666(lines 666 2942) no Hoare annotation was computed. [2022-11-03 02:42:21,552 INFO L899 garLoopResultBuilder]: For program point L931(lines 931 2901) no Hoare annotation was computed. [2022-11-03 02:42:21,553 INFO L899 garLoopResultBuilder]: For program point L1922(lines 1922 2749) no Hoare annotation was computed. [2022-11-03 02:42:21,553 INFO L899 garLoopResultBuilder]: For program point L1856(lines 1856 2759) no Hoare annotation was computed. [2022-11-03 02:42:21,553 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 229) no Hoare annotation was computed. [2022-11-03 02:42:21,553 INFO L899 garLoopResultBuilder]: For program point L2187(lines 2187 2708) no Hoare annotation was computed. [2022-11-03 02:42:21,553 INFO L899 garLoopResultBuilder]: For program point L1064(lines 1064 2881) no Hoare annotation was computed. [2022-11-03 02:42:21,553 INFO L899 garLoopResultBuilder]: For program point L998(lines 998 2891) no Hoare annotation was computed. [2022-11-03 02:42:21,554 INFO L899 garLoopResultBuilder]: For program point L2452(lines 2452 2667) no Hoare annotation was computed. [2022-11-03 02:42:21,554 INFO L899 garLoopResultBuilder]: For program point L1329(lines 1329 2840) no Hoare annotation was computed. [2022-11-03 02:42:21,554 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 286) no Hoare annotation was computed. [2022-11-03 02:42:21,554 INFO L899 garLoopResultBuilder]: For program point L1594(lines 1594 2799) no Hoare annotation was computed. [2022-11-03 02:42:21,554 INFO L899 garLoopResultBuilder]: For program point L2585(lines 2585 2647) no Hoare annotation was computed. [2022-11-03 02:42:21,554 INFO L899 garLoopResultBuilder]: For program point L471(lines 471 2972) no Hoare annotation was computed. [2022-11-03 02:42:21,555 INFO L899 garLoopResultBuilder]: For program point L2519(lines 2519 2657) no Hoare annotation was computed. [2022-11-03 02:42:21,555 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-11-03 02:42:21,555 INFO L899 garLoopResultBuilder]: For program point L736(lines 736 2931) no Hoare annotation was computed. [2022-11-03 02:42:21,555 INFO L899 garLoopResultBuilder]: For program point L1727(lines 1727 2779) no Hoare annotation was computed. [2022-11-03 02:42:21,555 INFO L899 garLoopResultBuilder]: For program point L1661(lines 1661 2789) no Hoare annotation was computed. [2022-11-03 02:42:21,555 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2022-11-03 02:42:21,556 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-11-03 02:42:21,556 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2022-11-03 02:42:21,556 INFO L899 garLoopResultBuilder]: For program point L1992(lines 1992 2738) no Hoare annotation was computed. [2022-11-03 02:42:21,556 INFO L899 garLoopResultBuilder]: For program point L869(lines 869 2911) no Hoare annotation was computed. [2022-11-03 02:42:21,556 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 2921) no Hoare annotation was computed. [2022-11-03 02:42:21,557 INFO L899 garLoopResultBuilder]: For program point L2257(lines 2257 2697) no Hoare annotation was computed. [2022-11-03 02:42:21,557 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 234) no Hoare annotation was computed. [2022-11-03 02:42:21,557 INFO L899 garLoopResultBuilder]: For program point L1134(lines 1134 2870) no Hoare annotation was computed. [2022-11-03 02:42:21,557 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2022-11-03 02:42:21,557 INFO L899 garLoopResultBuilder]: For program point L1399(lines 1399 2829) no Hoare annotation was computed. [2022-11-03 02:42:21,557 INFO L899 garLoopResultBuilder]: For program point L2390(lines 2390 2677) no Hoare annotation was computed. [2022-11-03 02:42:21,558 INFO L899 garLoopResultBuilder]: For program point L2324(lines 2324 2687) no Hoare annotation was computed. [2022-11-03 02:42:21,558 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 2616) no Hoare annotation was computed. [2022-11-03 02:42:21,558 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 2961) no Hoare annotation was computed. [2022-11-03 02:42:21,558 INFO L899 garLoopResultBuilder]: For program point L1532(lines 1532 2809) no Hoare annotation was computed. [2022-11-03 02:42:21,558 INFO L899 garLoopResultBuilder]: For program point L1466(lines 1466 2819) no Hoare annotation was computed. [2022-11-03 02:42:21,558 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-11-03 02:42:21,559 INFO L899 garLoopResultBuilder]: For program point L1797(lines 1797 2768) no Hoare annotation was computed. [2022-11-03 02:42:21,559 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 2941) no Hoare annotation was computed. [2022-11-03 02:42:21,559 INFO L899 garLoopResultBuilder]: For program point L608(lines 608 2951) no Hoare annotation was computed. [2022-11-03 02:42:21,559 INFO L899 garLoopResultBuilder]: For program point L2062(lines 2062 2727) no Hoare annotation was computed. [2022-11-03 02:42:21,559 INFO L899 garLoopResultBuilder]: For program point L939(lines 939 2900) no Hoare annotation was computed. [2022-11-03 02:42:21,559 INFO L899 garLoopResultBuilder]: For program point L1204(lines 1204 2859) no Hoare annotation was computed. [2022-11-03 02:42:21,560 INFO L899 garLoopResultBuilder]: For program point L2195(lines 2195 2707) no Hoare annotation was computed. [2022-11-03 02:42:21,560 INFO L899 garLoopResultBuilder]: For program point L2129(lines 2129 2717) no Hoare annotation was computed. [2022-11-03 02:42:21,560 INFO L899 garLoopResultBuilder]: For program point L2460(lines 2460 2666) no Hoare annotation was computed. [2022-11-03 02:42:21,560 INFO L899 garLoopResultBuilder]: For program point L346(lines 346 2991) no Hoare annotation was computed. [2022-11-03 02:42:21,560 INFO L899 garLoopResultBuilder]: For program point L1337(lines 1337 2839) no Hoare annotation was computed. [2022-11-03 02:42:21,561 INFO L895 garLoopResultBuilder]: At program point L280(lines 132 282) the Hoare annotation is: (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 0)) (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0)) (not (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| |ULTIMATE.start_main_~main__t~0#1|))) [2022-11-03 02:42:21,561 INFO L899 garLoopResultBuilder]: For program point L1271(lines 1271 2849) no Hoare annotation was computed. [2022-11-03 02:42:21,561 INFO L899 garLoopResultBuilder]: For program point L1602(lines 1602 2798) no Hoare annotation was computed. [2022-11-03 02:42:21,561 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 2971) no Hoare annotation was computed. [2022-11-03 02:42:21,562 INFO L899 garLoopResultBuilder]: For program point L413(lines 413 2981) no Hoare annotation was computed. [2022-11-03 02:42:21,562 INFO L899 garLoopResultBuilder]: For program point L1867(lines 1867 2757) no Hoare annotation was computed. [2022-11-03 02:42:21,562 INFO L899 garLoopResultBuilder]: For program point L744(lines 744 2930) no Hoare annotation was computed. [2022-11-03 02:42:21,562 INFO L899 garLoopResultBuilder]: For program point L1009(lines 1009 2889) no Hoare annotation was computed. [2022-11-03 02:42:21,562 INFO L899 garLoopResultBuilder]: For program point L2000(lines 2000 2737) no Hoare annotation was computed. [2022-11-03 02:42:21,562 INFO L899 garLoopResultBuilder]: For program point L1934(lines 1934 2747) no Hoare annotation was computed. [2022-11-03 02:42:21,563 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 227) no Hoare annotation was computed. [2022-11-03 02:42:21,563 INFO L899 garLoopResultBuilder]: For program point L2265(lines 2265 2696) no Hoare annotation was computed. [2022-11-03 02:42:21,563 INFO L899 garLoopResultBuilder]: For program point L1142(lines 1142 2869) no Hoare annotation was computed. [2022-11-03 02:42:21,563 INFO L899 garLoopResultBuilder]: For program point L1076(lines 1076 2879) no Hoare annotation was computed. [2022-11-03 02:42:21,563 INFO L899 garLoopResultBuilder]: For program point L2530(lines 2530 2655) no Hoare annotation was computed. [2022-11-03 02:42:21,563 INFO L899 garLoopResultBuilder]: For program point L1407(lines 1407 2828) no Hoare annotation was computed. [2022-11-03 02:42:21,564 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-03 02:42:21,564 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 284) no Hoare annotation was computed. [2022-11-03 02:42:21,564 INFO L899 garLoopResultBuilder]: For program point L1672(lines 1672 2787) no Hoare annotation was computed. [2022-11-03 02:42:21,564 INFO L899 garLoopResultBuilder]: For program point L549(lines 549 2960) no Hoare annotation was computed. [2022-11-03 02:42:21,564 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-11-03 02:42:21,564 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 3007) no Hoare annotation was computed. [2022-11-03 02:42:21,564 INFO L899 garLoopResultBuilder]: For program point L814(lines 814 2919) no Hoare annotation was computed. [2022-11-03 02:42:21,565 INFO L899 garLoopResultBuilder]: For program point L1805(lines 1805 2767) no Hoare annotation was computed. [2022-11-03 02:42:21,565 INFO L899 garLoopResultBuilder]: For program point L1739(lines 1739 2777) no Hoare annotation was computed. [2022-11-03 02:42:21,565 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-11-03 02:42:21,565 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2022-11-03 02:42:21,565 INFO L899 garLoopResultBuilder]: For program point L2070(lines 2070 2726) no Hoare annotation was computed. [2022-11-03 02:42:21,565 INFO L899 garLoopResultBuilder]: For program point L947(lines 947 2899) no Hoare annotation was computed. [2022-11-03 02:42:21,566 INFO L899 garLoopResultBuilder]: For program point L881(lines 881 2909) no Hoare annotation was computed. [2022-11-03 02:42:21,566 INFO L899 garLoopResultBuilder]: For program point L2335(lines 2335 2685) no Hoare annotation was computed. [2022-11-03 02:42:21,566 INFO L899 garLoopResultBuilder]: For program point L1212(lines 1212 2858) no Hoare annotation was computed. [2022-11-03 02:42:21,566 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 232) no Hoare annotation was computed. [2022-11-03 02:42:21,567 INFO L899 garLoopResultBuilder]: For program point L1477(lines 1477 2817) no Hoare annotation was computed. [2022-11-03 02:42:21,567 INFO L899 garLoopResultBuilder]: For program point L2468(lines 2468 2665) no Hoare annotation was computed. [2022-11-03 02:42:21,567 INFO L899 garLoopResultBuilder]: For program point L2402(lines 2402 2675) no Hoare annotation was computed. [2022-11-03 02:42:21,568 INFO L899 garLoopResultBuilder]: For program point L354(lines 354 2990) no Hoare annotation was computed. [2022-11-03 02:42:21,568 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2022-11-03 02:42:21,568 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 2949) no Hoare annotation was computed. [2022-11-03 02:42:21,569 INFO L899 garLoopResultBuilder]: For program point L1610(lines 1610 2797) no Hoare annotation was computed. [2022-11-03 02:42:21,571 INFO L899 garLoopResultBuilder]: For program point L1544(lines 1544 2807) no Hoare annotation was computed. [2022-11-03 02:42:21,571 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-11-03 02:42:21,571 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 3002) no Hoare annotation was computed. [2022-11-03 02:42:21,571 INFO L899 garLoopResultBuilder]: For program point L1875(lines 1875 2756) no Hoare annotation was computed. [2022-11-03 02:42:21,571 INFO L899 garLoopResultBuilder]: For program point L752(lines 752 2929) no Hoare annotation was computed. [2022-11-03 02:42:21,571 INFO L899 garLoopResultBuilder]: For program point L686(lines 686 2939) no Hoare annotation was computed. [2022-11-03 02:42:21,572 INFO L899 garLoopResultBuilder]: For program point L2602(lines 2602 2645) no Hoare annotation was computed. [2022-11-03 02:42:21,572 INFO L899 garLoopResultBuilder]: For program point L2140(lines 2140 2715) no Hoare annotation was computed. [2022-11-03 02:42:21,572 INFO L899 garLoopResultBuilder]: For program point L1017(lines 1017 2888) no Hoare annotation was computed. [2022-11-03 02:42:21,572 INFO L899 garLoopResultBuilder]: For program point L1282(lines 1282 2847) no Hoare annotation was computed. [2022-11-03 02:42:21,572 INFO L899 garLoopResultBuilder]: For program point L2273(lines 2273 2695) no Hoare annotation was computed. [2022-11-03 02:42:21,572 INFO L899 garLoopResultBuilder]: For program point L2207(lines 2207 2705) no Hoare annotation was computed. [2022-11-03 02:42:21,573 INFO L899 garLoopResultBuilder]: For program point L2604(line 2604) no Hoare annotation was computed. [2022-11-03 02:42:21,573 INFO L899 garLoopResultBuilder]: For program point L2538(lines 2538 2654) no Hoare annotation was computed. [2022-11-03 02:42:21,573 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 2979) no Hoare annotation was computed. [2022-11-03 02:42:21,573 INFO L899 garLoopResultBuilder]: For program point L1415(lines 1415 2827) no Hoare annotation was computed. [2022-11-03 02:42:21,573 INFO L899 garLoopResultBuilder]: For program point L1349(lines 1349 2837) no Hoare annotation was computed. [2022-11-03 02:42:21,573 INFO L895 garLoopResultBuilder]: At program point L226(lines 92 284) the Hoare annotation is: (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 0)) (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0)) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) [2022-11-03 02:42:21,574 INFO L899 garLoopResultBuilder]: For program point L1680(lines 1680 2786) no Hoare annotation was computed. [2022-11-03 02:42:21,574 INFO L899 garLoopResultBuilder]: For program point L557(lines 557 2959) no Hoare annotation was computed. [2022-11-03 02:42:21,574 INFO L899 garLoopResultBuilder]: For program point L491(lines 491 2969) no Hoare annotation was computed. [2022-11-03 02:42:21,574 INFO L899 garLoopResultBuilder]: For program point L1945(lines 1945 2745) no Hoare annotation was computed. [2022-11-03 02:42:21,574 INFO L899 garLoopResultBuilder]: For program point L822(lines 822 2918) no Hoare annotation was computed. [2022-11-03 02:42:21,574 INFO L899 garLoopResultBuilder]: For program point L1087(lines 1087 2877) no Hoare annotation was computed. [2022-11-03 02:42:21,575 INFO L899 garLoopResultBuilder]: For program point L2078(lines 2078 2725) no Hoare annotation was computed. [2022-11-03 02:42:21,575 INFO L899 garLoopResultBuilder]: For program point L2012(lines 2012 2735) no Hoare annotation was computed. [2022-11-03 02:42:21,575 INFO L899 garLoopResultBuilder]: For program point L2343(lines 2343 2684) no Hoare annotation was computed. [2022-11-03 02:42:21,575 INFO L899 garLoopResultBuilder]: For program point L1220(lines 1220 2857) no Hoare annotation was computed. [2022-11-03 02:42:21,575 INFO L899 garLoopResultBuilder]: For program point L1154(lines 1154 2867) no Hoare annotation was computed. [2022-11-03 02:42:21,575 INFO L899 garLoopResultBuilder]: For program point L1485(lines 1485 2816) no Hoare annotation was computed. [2022-11-03 02:42:21,575 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 2989) no Hoare annotation was computed. [2022-11-03 02:42:21,576 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 2999) no Hoare annotation was computed. [2022-11-03 02:42:21,576 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 231) no Hoare annotation was computed. [2022-11-03 02:42:21,576 INFO L899 garLoopResultBuilder]: For program point L1750(lines 1750 2775) no Hoare annotation was computed. [2022-11-03 02:42:21,576 INFO L899 garLoopResultBuilder]: For program point L627(lines 627 2948) no Hoare annotation was computed. [2022-11-03 02:42:21,576 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 57) no Hoare annotation was computed. [2022-11-03 02:42:21,576 INFO L902 garLoopResultBuilder]: At program point L3006(lines 21 3007) the Hoare annotation is: true [2022-11-03 02:42:21,577 INFO L899 garLoopResultBuilder]: For program point L892(lines 892 2907) no Hoare annotation was computed. [2022-11-03 02:42:21,577 INFO L899 garLoopResultBuilder]: For program point L1883(lines 1883 2755) no Hoare annotation was computed. [2022-11-03 02:42:21,577 INFO L899 garLoopResultBuilder]: For program point L1817(lines 1817 2765) no Hoare annotation was computed. [2022-11-03 02:42:21,577 INFO L899 garLoopResultBuilder]: For program point L2148(lines 2148 2714) no Hoare annotation was computed. [2022-11-03 02:42:21,577 INFO L899 garLoopResultBuilder]: For program point L1025(lines 1025 2887) no Hoare annotation was computed. [2022-11-03 02:42:21,577 INFO L899 garLoopResultBuilder]: For program point L959(lines 959 2897) no Hoare annotation was computed. [2022-11-03 02:42:21,578 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2022-11-03 02:42:21,578 INFO L899 garLoopResultBuilder]: For program point L2413(lines 2413 2673) no Hoare annotation was computed. [2022-11-03 02:42:21,578 INFO L899 garLoopResultBuilder]: For program point L1290(lines 1290 2846) no Hoare annotation was computed. [2022-11-03 02:42:21,578 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-11-03 02:42:21,583 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] [2022-11-03 02:42:21,588 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:42:21,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:42:21 BoogieIcfgContainer [2022-11-03 02:42:21,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:42:21,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:42:21,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:42:21,629 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:42:21,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:41:58" (3/4) ... [2022-11-03 02:42:21,633 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 02:42:21,671 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-03 02:42:21,674 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-03 02:42:21,676 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-03 02:42:21,678 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 02:42:21,942 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:42:21,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:42:21,943 INFO L158 Benchmark]: Toolchain (without parser) took 26245.18ms. Allocated memory was 104.9MB in the beginning and 310.4MB in the end (delta: 205.5MB). Free memory was 71.9MB in the beginning and 163.8MB in the end (delta: -91.9MB). Peak memory consumption was 112.7MB. Max. memory is 16.1GB. [2022-11-03 02:42:21,943 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 77.6MB. Free memory is still 35.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:42:21,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 998.52ms. Allocated memory is still 104.9MB. Free memory was 71.6MB in the beginning and 51.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-03 02:42:21,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 131.62ms. Allocated memory is still 104.9MB. Free memory was 51.7MB in the beginning and 44.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-03 02:42:21,944 INFO L158 Benchmark]: Boogie Preprocessor took 101.85ms. Allocated memory is still 104.9MB. Free memory was 44.4MB in the beginning and 39.7MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 02:42:21,945 INFO L158 Benchmark]: RCFGBuilder took 1706.40ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 39.7MB in the beginning and 41.3MB in the end (delta: -1.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2022-11-03 02:42:21,945 INFO L158 Benchmark]: TraceAbstraction took 22968.06ms. Allocated memory was 130.0MB in the beginning and 310.4MB in the end (delta: 180.4MB). Free memory was 98.9MB in the beginning and 187.9MB in the end (delta: -89.0MB). Peak memory consumption was 190.3MB. Max. memory is 16.1GB. [2022-11-03 02:42:21,945 INFO L158 Benchmark]: Witness Printer took 314.26ms. Allocated memory is still 310.4MB. Free memory was 187.9MB in the beginning and 163.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-03 02:42:21,947 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.29ms. Allocated memory is still 77.6MB. Free memory is still 35.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 998.52ms. Allocated memory is still 104.9MB. Free memory was 71.6MB in the beginning and 51.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 131.62ms. Allocated memory is still 104.9MB. Free memory was 51.7MB in the beginning and 44.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.85ms. Allocated memory is still 104.9MB. Free memory was 44.4MB in the beginning and 39.7MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1706.40ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 39.7MB in the beginning and 41.3MB in the end (delta: -1.6MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22968.06ms. Allocated memory was 130.0MB in the beginning and 310.4MB in the end (delta: 180.4MB). Free memory was 98.9MB in the beginning and 187.9MB in the end (delta: -89.0MB). Peak memory consumption was 190.3MB. Max. memory is 16.1GB. * Witness Printer took 314.26ms. Allocated memory is still 310.4MB. Free memory was 187.9MB in the beginning and 163.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. 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: 35]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 88]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 105]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 117]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 173]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 185]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 207]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 219]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 267]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2604]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2616]: 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, 302 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 22.8s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5872 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5872 mSDsluCounter, 9323 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5360 mSDsCounter, 1467 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13111 IncrementalHoareTripleChecker+Invalid, 14578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1467 mSolverCounterUnsat, 3966 mSDtfsCounter, 13111 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=0, InterpolantAutomatonStates: 169, 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, 21 MinimizatonAttempts, 150 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 18 NumberOfFragments, 63 HoareAnnotationTreeSize, 7 FomulaSimplifications, 2025 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14554 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 723 NumberOfCodeBlocks, 723 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 702 ConstructedInterpolants, 0 QuantifiedInterpolants, 1932 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) && main__t <= main__tagbuf_len - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (main__t == 0 && main__t < main__tagbuf_len) || (1 <= main__t && main__t < main__tagbuf_len) - InvariantResult [Line: 2591]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && 59 <= main__t RESULT: Ultimate proved your program to be correct! [2022-11-03 02:42:22,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab0540b6-21cd-4530-96e1-514e2569a96e/bin/utaipan-7li7fVZpFI/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