./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef15c4790969d8e640b2241771e44174daa41407 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 03:35:47,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 03:35:47,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 03:35:47,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 03:35:47,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 03:35:47,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 03:35:47,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 03:35:47,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 03:35:47,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 03:35:47,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 03:35:47,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 03:35:47,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 03:35:47,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 03:35:47,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 03:35:47,653 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 03:35:47,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 03:35:47,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 03:35:47,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 03:35:47,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 03:35:47,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 03:35:47,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 03:35:47,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 03:35:47,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 03:35:47,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 03:35:47,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 03:35:47,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 03:35:47,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 03:35:47,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 03:35:47,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 03:35:47,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 03:35:47,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 03:35:47,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 03:35:47,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 03:35:47,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 03:35:47,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 03:35:47,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 03:35:47,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 03:35:47,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 03:35:47,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 03:35:47,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 03:35:47,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 03:35:47,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 03:35:47,723 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 03:35:47,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 03:35:47,724 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 03:35:47,724 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 03:35:47,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 03:35:47,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 03:35:47,726 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 03:35:47,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 03:35:47,727 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 03:35:47,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 03:35:47,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 03:35:47,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 03:35:47,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 03:35:47,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 03:35:47,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 03:35:47,729 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 03:35:47,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 03:35:47,729 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 03:35:47,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 03:35:47,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 03:35:47,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 03:35:47,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 03:35:47,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:35:47,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 03:35:47,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 03:35:47,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 03:35:47,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 03:35:47,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 03:35:47,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 03:35:47,731 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 03:35:47,731 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef15c4790969d8e640b2241771e44174daa41407 [2021-08-26 03:35:48,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 03:35:48,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 03:35:48,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 03:35:48,050 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 03:35:48,050 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 03:35:48,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2021-08-26 03:35:48,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf677914d/894f9cf6091240a8ba73cb6dc3bddb6a/FLAGe42c18f31 [2021-08-26 03:35:48,456 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 03:35:48,457 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2021-08-26 03:35:48,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf677914d/894f9cf6091240a8ba73cb6dc3bddb6a/FLAGe42c18f31 [2021-08-26 03:35:48,478 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf677914d/894f9cf6091240a8ba73cb6dc3bddb6a [2021-08-26 03:35:48,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 03:35:48,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 03:35:48,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 03:35:48,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 03:35:48,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 03:35:48,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:35:48" (1/1) ... [2021-08-26 03:35:48,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8d8f0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:48, skipping insertion in model container [2021-08-26 03:35:48,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:35:48" (1/1) ... [2021-08-26 03:35:48,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 03:35:48,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 03:35:48,689 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2021-08-26 03:35:48,693 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2021-08-26 03:35:48,695 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2021-08-26 03:35:48,701 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2021-08-26 03:35:48,705 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2021-08-26 03:35:48,707 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2021-08-26 03:35:48,709 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2021-08-26 03:35:48,711 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2021-08-26 03:35:48,712 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2021-08-26 03:35:48,715 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2021-08-26 03:35:48,719 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2021-08-26 03:35:48,721 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2021-08-26 03:35:48,724 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2021-08-26 03:35:48,731 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2021-08-26 03:35:48,732 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2021-08-26 03:35:48,733 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2021-08-26 03:35:48,734 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2021-08-26 03:35:48,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:35:48,746 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 03:35:48,789 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2021-08-26 03:35:48,794 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2021-08-26 03:35:48,799 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2021-08-26 03:35:48,800 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2021-08-26 03:35:48,802 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2021-08-26 03:35:48,803 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2021-08-26 03:35:48,804 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2021-08-26 03:35:48,805 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2021-08-26 03:35:48,806 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2021-08-26 03:35:48,807 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2021-08-26 03:35:48,809 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2021-08-26 03:35:48,810 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2021-08-26 03:35:48,811 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2021-08-26 03:35:48,812 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2021-08-26 03:35:48,813 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2021-08-26 03:35:48,814 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2021-08-26 03:35:48,815 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2021-08-26 03:35:48,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 03:35:48,827 INFO L208 MainTranslator]: Completed translation [2021-08-26 03:35:48,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:48 WrapperNode [2021-08-26 03:35:48,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 03:35:48,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 03:35:48,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 03:35:48,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 03:35:48,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:48" (1/1) ... [2021-08-26 03:35:48,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:48" (1/1) ... [2021-08-26 03:35:48,870 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 03:35:48,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 03:35:48,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 03:35:48,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 03:35:48,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:48" (1/1) ... [2021-08-26 03:35:48,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:48" (1/1) ... [2021-08-26 03:35:48,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:48" (1/1) ... [2021-08-26 03:35:48,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:48" (1/1) ... [2021-08-26 03:35:48,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:48" (1/1) ... [2021-08-26 03:35:48,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:48" (1/1) ... [2021-08-26 03:35:48,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:48" (1/1) ... [2021-08-26 03:35:48,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 03:35:48,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 03:35:48,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 03:35:48,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 03:35:48,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:48" (1/1) ... [2021-08-26 03:35:48,931 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 03:35:48,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:35:48,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 03:35:48,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 03:35:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 03:35:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 03:35:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 03:35:49,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 03:35:49,487 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 03:35:49,487 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-26 03:35:49,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:35:49 BoogieIcfgContainer [2021-08-26 03:35:49,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 03:35:49,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 03:35:49,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 03:35:49,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 03:35:49,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:35:48" (1/3) ... [2021-08-26 03:35:49,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52345abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:35:49, skipping insertion in model container [2021-08-26 03:35:49,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:35:48" (2/3) ... [2021-08-26 03:35:49,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52345abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:35:49, skipping insertion in model container [2021-08-26 03:35:49,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:35:49" (3/3) ... [2021-08-26 03:35:49,496 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2021-08-26 03:35:49,503 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 03:35:49,503 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2021-08-26 03:35:49,563 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 03:35:49,570 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 03:35:49,570 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2021-08-26 03:35:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 53 states have (on average 1.849056603773585) internal successors, (98), 70 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:49,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-26 03:35:49,587 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:49,588 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:49,589 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:49,594 INFO L82 PathProgramCache]: Analyzing trace with hash 123971630, now seen corresponding path program 1 times [2021-08-26 03:35:49,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:49,600 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398321384] [2021-08-26 03:35:49,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:49,601 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:49,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:49,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398321384] [2021-08-26 03:35:49,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398321384] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:49,817 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:49,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:35:49,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677967376] [2021-08-26 03:35:49,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:35:49,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:49,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:35:49,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:35:49,832 INFO L87 Difference]: Start difference. First operand has 71 states, 53 states have (on average 1.849056603773585) internal successors, (98), 70 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:49,971 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2021-08-26 03:35:49,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:49,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-08-26 03:35:49,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:49,979 INFO L225 Difference]: With dead ends: 125 [2021-08-26 03:35:49,979 INFO L226 Difference]: Without dead ends: 109 [2021-08-26 03:35:49,981 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:49,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-08-26 03:35:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2021-08-26 03:35:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-08-26 03:35:50,008 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2021-08-26 03:35:50,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:50,008 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-08-26 03:35:50,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-08-26 03:35:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-26 03:35:50,009 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:50,009 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:50,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 03:35:50,010 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:50,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:50,010 INFO L82 PathProgramCache]: Analyzing trace with hash 120336139, now seen corresponding path program 1 times [2021-08-26 03:35:50,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:50,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724860764] [2021-08-26 03:35:50,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:50,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:50,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:50,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724860764] [2021-08-26 03:35:50,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724860764] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:50,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:50,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:35:50,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677461069] [2021-08-26 03:35:50,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:35:50,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:50,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:35:50,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:35:50,073 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:50,151 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2021-08-26 03:35:50,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:35:50,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-08-26 03:35:50,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:50,153 INFO L225 Difference]: With dead ends: 65 [2021-08-26 03:35:50,153 INFO L226 Difference]: Without dead ends: 63 [2021-08-26 03:35:50,154 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:50,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-08-26 03:35:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-08-26 03:35:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2021-08-26 03:35:50,160 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 8 [2021-08-26 03:35:50,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:50,161 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2021-08-26 03:35:50,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2021-08-26 03:35:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-26 03:35:50,162 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:50,162 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:50,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 03:35:50,162 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash -564542931, now seen corresponding path program 1 times [2021-08-26 03:35:50,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:50,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771295410] [2021-08-26 03:35:50,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:50,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:50,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:50,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771295410] [2021-08-26 03:35:50,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771295410] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:50,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:50,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:35:50,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793631424] [2021-08-26 03:35:50,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:35:50,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:50,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:35:50,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:35:50,223 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:50,301 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-08-26 03:35:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:50,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-08-26 03:35:50,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:50,302 INFO L225 Difference]: With dead ends: 69 [2021-08-26 03:35:50,303 INFO L226 Difference]: Without dead ends: 67 [2021-08-26 03:35:50,303 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-08-26 03:35:50,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2021-08-26 03:35:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2021-08-26 03:35:50,309 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 9 [2021-08-26 03:35:50,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:50,309 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-08-26 03:35:50,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2021-08-26 03:35:50,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 03:35:50,310 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:50,310 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:50,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 03:35:50,311 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:50,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:50,311 INFO L82 PathProgramCache]: Analyzing trace with hash -429055130, now seen corresponding path program 1 times [2021-08-26 03:35:50,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:50,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660904045] [2021-08-26 03:35:50,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:50,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:50,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:50,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:50,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660904045] [2021-08-26 03:35:50,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660904045] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:50,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:50,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:50,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060918393] [2021-08-26 03:35:50,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:50,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:50,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:50,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:50,392 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:50,518 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2021-08-26 03:35:50,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:50,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 03:35:50,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:50,522 INFO L225 Difference]: With dead ends: 67 [2021-08-26 03:35:50,522 INFO L226 Difference]: Without dead ends: 65 [2021-08-26 03:35:50,522 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-08-26 03:35:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2021-08-26 03:35:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.36) internal successors, (68), 63 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2021-08-26 03:35:50,534 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 11 [2021-08-26 03:35:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:50,534 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2021-08-26 03:35:50,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2021-08-26 03:35:50,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 03:35:50,535 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:50,535 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:50,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 03:35:50,535 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:50,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:50,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1359750351, now seen corresponding path program 1 times [2021-08-26 03:35:50,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:50,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408957847] [2021-08-26 03:35:50,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:50,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:50,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:50,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408957847] [2021-08-26 03:35:50,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408957847] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:50,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:50,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:50,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682011106] [2021-08-26 03:35:50,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:50,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:50,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:50,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:50,623 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:50,709 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2021-08-26 03:35:50,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:50,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 03:35:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:50,715 INFO L225 Difference]: With dead ends: 65 [2021-08-26 03:35:50,715 INFO L226 Difference]: Without dead ends: 63 [2021-08-26 03:35:50,715 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:50,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-08-26 03:35:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-08-26 03:35:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.346938775510204) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2021-08-26 03:35:50,722 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2021-08-26 03:35:50,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:50,722 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2021-08-26 03:35:50,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2021-08-26 03:35:50,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 03:35:50,723 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:50,723 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:50,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 03:35:50,723 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:50,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:50,724 INFO L82 PathProgramCache]: Analyzing trace with hash -415802953, now seen corresponding path program 1 times [2021-08-26 03:35:50,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:50,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738325385] [2021-08-26 03:35:50,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:50,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:50,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:50,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738325385] [2021-08-26 03:35:50,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738325385] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:50,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:50,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:35:50,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741577022] [2021-08-26 03:35:50,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:35:50,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:50,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:35:50,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:35:50,790 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:50,844 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2021-08-26 03:35:50,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:35:50,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 03:35:50,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:50,846 INFO L225 Difference]: With dead ends: 63 [2021-08-26 03:35:50,849 INFO L226 Difference]: Without dead ends: 59 [2021-08-26 03:35:50,851 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-08-26 03:35:50,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2021-08-26 03:35:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2021-08-26 03:35:50,859 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 12 [2021-08-26 03:35:50,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:50,859 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2021-08-26 03:35:50,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2021-08-26 03:35:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 03:35:50,860 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:50,860 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:50,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 03:35:50,861 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:50,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:50,862 INFO L82 PathProgramCache]: Analyzing trace with hash -415312395, now seen corresponding path program 1 times [2021-08-26 03:35:50,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:50,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904357263] [2021-08-26 03:35:50,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:50,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:50,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:50,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:50,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904357263] [2021-08-26 03:35:50,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904357263] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:50,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:50,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:50,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511115244] [2021-08-26 03:35:50,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:50,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:50,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:50,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:50,900 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:51,001 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2021-08-26 03:35:51,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:51,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 03:35:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:51,003 INFO L225 Difference]: With dead ends: 100 [2021-08-26 03:35:51,003 INFO L226 Difference]: Without dead ends: 98 [2021-08-26 03:35:51,004 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:51,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-26 03:35:51,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2021-08-26 03:35:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-08-26 03:35:51,007 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 12 [2021-08-26 03:35:51,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:51,008 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-08-26 03:35:51,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-08-26 03:35:51,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 03:35:51,008 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:51,008 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:51,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 03:35:51,008 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:51,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:51,009 INFO L82 PathProgramCache]: Analyzing trace with hash 797416153, now seen corresponding path program 1 times [2021-08-26 03:35:51,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:51,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692906481] [2021-08-26 03:35:51,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:51,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:51,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:51,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692906481] [2021-08-26 03:35:51,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692906481] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:51,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:51,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:35:51,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955508529] [2021-08-26 03:35:51,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:35:51,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:51,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:35:51,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:35:51,040 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:51,080 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2021-08-26 03:35:51,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:35:51,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 03:35:51,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:51,081 INFO L225 Difference]: With dead ends: 57 [2021-08-26 03:35:51,081 INFO L226 Difference]: Without dead ends: 53 [2021-08-26 03:35:51,082 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:51,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-08-26 03:35:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2021-08-26 03:35:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-08-26 03:35:51,085 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 12 [2021-08-26 03:35:51,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:51,085 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-08-26 03:35:51,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,085 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-08-26 03:35:51,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 03:35:51,086 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:51,086 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:51,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 03:35:51,086 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:51,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:51,087 INFO L82 PathProgramCache]: Analyzing trace with hash 10221853, now seen corresponding path program 1 times [2021-08-26 03:35:51,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:51,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506475098] [2021-08-26 03:35:51,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:51,087 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:51,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:51,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506475098] [2021-08-26 03:35:51,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506475098] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:51,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:51,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:35:51,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108991058] [2021-08-26 03:35:51,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:51,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:51,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:51,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:51,209 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:51,345 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2021-08-26 03:35:51,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 03:35:51,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 03:35:51,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:51,346 INFO L225 Difference]: With dead ends: 118 [2021-08-26 03:35:51,346 INFO L226 Difference]: Without dead ends: 116 [2021-08-26 03:35:51,347 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 45.6ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-08-26 03:35:51,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 57. [2021-08-26 03:35:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-08-26 03:35:51,353 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 13 [2021-08-26 03:35:51,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:51,353 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-08-26 03:35:51,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,353 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-08-26 03:35:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 03:35:51,354 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:51,354 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:51,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 03:35:51,354 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:51,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:51,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1032848570, now seen corresponding path program 1 times [2021-08-26 03:35:51,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:51,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085455343] [2021-08-26 03:35:51,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:51,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:51,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:51,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085455343] [2021-08-26 03:35:51,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085455343] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:51,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:51,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:51,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339928881] [2021-08-26 03:35:51,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:51,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:51,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:51,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:51,414 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:51,494 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2021-08-26 03:35:51,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:51,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 03:35:51,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:51,495 INFO L225 Difference]: With dead ends: 74 [2021-08-26 03:35:51,495 INFO L226 Difference]: Without dead ends: 72 [2021-08-26 03:35:51,495 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-08-26 03:35:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2021-08-26 03:35:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2021-08-26 03:35:51,499 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 13 [2021-08-26 03:35:51,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:51,499 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2021-08-26 03:35:51,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,500 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2021-08-26 03:35:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 03:35:51,502 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:51,502 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:51,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 03:35:51,503 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:51,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:51,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1031124666, now seen corresponding path program 1 times [2021-08-26 03:35:51,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:51,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32643123] [2021-08-26 03:35:51,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:51,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:51,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:51,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32643123] [2021-08-26 03:35:51,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32643123] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:51,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:51,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:51,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890117383] [2021-08-26 03:35:51,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:51,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:51,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:51,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:51,574 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:51,637 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2021-08-26 03:35:51,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:51,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 03:35:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:51,638 INFO L225 Difference]: With dead ends: 55 [2021-08-26 03:35:51,638 INFO L226 Difference]: Without dead ends: 53 [2021-08-26 03:35:51,638 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:51,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-08-26 03:35:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-08-26 03:35:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2021-08-26 03:35:51,644 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2021-08-26 03:35:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:51,644 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2021-08-26 03:35:51,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2021-08-26 03:35:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 03:35:51,645 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:51,645 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:51,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 03:35:51,646 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:51,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:51,647 INFO L82 PathProgramCache]: Analyzing trace with hash 310078394, now seen corresponding path program 1 times [2021-08-26 03:35:51,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:51,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836739620] [2021-08-26 03:35:51,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:51,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:51,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:51,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836739620] [2021-08-26 03:35:51,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836739620] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:51,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:51,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:35:51,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82743256] [2021-08-26 03:35:51,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:51,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:51,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:51,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:51,756 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:51,837 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2021-08-26 03:35:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 03:35:51,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 03:35:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:51,839 INFO L225 Difference]: With dead ends: 78 [2021-08-26 03:35:51,839 INFO L226 Difference]: Without dead ends: 76 [2021-08-26 03:35:51,840 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 47.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:35:51,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-08-26 03:35:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 53. [2021-08-26 03:35:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2021-08-26 03:35:51,843 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 14 [2021-08-26 03:35:51,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:51,843 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2021-08-26 03:35:51,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2021-08-26 03:35:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 03:35:51,844 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:51,844 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:51,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 03:35:51,844 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:51,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:51,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1953530500, now seen corresponding path program 1 times [2021-08-26 03:35:51,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:51,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137059358] [2021-08-26 03:35:51,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:51,845 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:51,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:51,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137059358] [2021-08-26 03:35:51,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137059358] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:51,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:51,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:35:51,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292614324] [2021-08-26 03:35:51,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:51,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:51,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:51,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:51,934 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:52,019 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2021-08-26 03:35:52,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 03:35:52,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 03:35:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:52,021 INFO L225 Difference]: With dead ends: 92 [2021-08-26 03:35:52,021 INFO L226 Difference]: Without dead ends: 90 [2021-08-26 03:35:52,021 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 39.6ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-08-26 03:35:52,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2021-08-26 03:35:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2021-08-26 03:35:52,025 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 14 [2021-08-26 03:35:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:52,025 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2021-08-26 03:35:52,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2021-08-26 03:35:52,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 03:35:52,028 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:52,028 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:52,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 03:35:52,028 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:52,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:52,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1951983355, now seen corresponding path program 1 times [2021-08-26 03:35:52,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:52,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626208152] [2021-08-26 03:35:52,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:52,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:52,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:52,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:52,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626208152] [2021-08-26 03:35:52,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626208152] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:52,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:52,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 03:35:52,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910483199] [2021-08-26 03:35:52,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 03:35:52,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:52,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 03:35:52,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:52,077 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:52,159 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2021-08-26 03:35:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:52,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 03:35:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:52,161 INFO L225 Difference]: With dead ends: 81 [2021-08-26 03:35:52,161 INFO L226 Difference]: Without dead ends: 79 [2021-08-26 03:35:52,161 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:52,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-08-26 03:35:52,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2021-08-26 03:35:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2021-08-26 03:35:52,165 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 14 [2021-08-26 03:35:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:52,165 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2021-08-26 03:35:52,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,165 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2021-08-26 03:35:52,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 03:35:52,165 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:52,166 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:52,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 03:35:52,166 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:52,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:52,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1900089420, now seen corresponding path program 1 times [2021-08-26 03:35:52,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:52,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274802305] [2021-08-26 03:35:52,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:52,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:52,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:52,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274802305] [2021-08-26 03:35:52,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274802305] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:52,258 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:52,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:35:52,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737941624] [2021-08-26 03:35:52,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:52,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:52,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:52,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:52,259 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:52,331 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2021-08-26 03:35:52,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:35:52,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 03:35:52,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:52,332 INFO L225 Difference]: With dead ends: 70 [2021-08-26 03:35:52,332 INFO L226 Difference]: Without dead ends: 66 [2021-08-26 03:35:52,332 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 35.0ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-08-26 03:35:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2021-08-26 03:35:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2021-08-26 03:35:52,335 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 14 [2021-08-26 03:35:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:52,335 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2021-08-26 03:35:52,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2021-08-26 03:35:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 03:35:52,336 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:52,336 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:52,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-26 03:35:52,336 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:52,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:52,337 INFO L82 PathProgramCache]: Analyzing trace with hash -381937728, now seen corresponding path program 1 times [2021-08-26 03:35:52,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:52,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936601840] [2021-08-26 03:35:52,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:52,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:52,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:52,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936601840] [2021-08-26 03:35:52,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936601840] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:52,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:52,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:35:52,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590421876] [2021-08-26 03:35:52,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:52,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:52,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:52,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:52,421 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:52,507 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2021-08-26 03:35:52,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 03:35:52,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-26 03:35:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:52,508 INFO L225 Difference]: With dead ends: 87 [2021-08-26 03:35:52,509 INFO L226 Difference]: Without dead ends: 85 [2021-08-26 03:35:52,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40.0ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 03:35:52,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-08-26 03:35:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2021-08-26 03:35:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.25) internal successors, (70), 62 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2021-08-26 03:35:52,512 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 15 [2021-08-26 03:35:52,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:52,512 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2021-08-26 03:35:52,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2021-08-26 03:35:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 03:35:52,513 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:52,513 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:52,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 03:35:52,513 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:52,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:52,514 INFO L82 PathProgramCache]: Analyzing trace with hash -441974753, now seen corresponding path program 1 times [2021-08-26 03:35:52,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:52,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617718260] [2021-08-26 03:35:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:52,514 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:52,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:52,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617718260] [2021-08-26 03:35:52,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617718260] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:52,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:52,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:35:52,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83266482] [2021-08-26 03:35:52,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:35:52,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:52,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:35:52,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:35:52,540 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:52,564 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2021-08-26 03:35:52,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:35:52,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-26 03:35:52,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:52,565 INFO L225 Difference]: With dead ends: 63 [2021-08-26 03:35:52,565 INFO L226 Difference]: Without dead ends: 61 [2021-08-26 03:35:52,565 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-26 03:35:52,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-08-26 03:35:52,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2021-08-26 03:35:52,568 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 16 [2021-08-26 03:35:52,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:52,568 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2021-08-26 03:35:52,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,569 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2021-08-26 03:35:52,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 03:35:52,569 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:52,569 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:52,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-26 03:35:52,569 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:52,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:52,570 INFO L82 PathProgramCache]: Analyzing trace with hash -816311340, now seen corresponding path program 1 times [2021-08-26 03:35:52,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:52,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478495878] [2021-08-26 03:35:52,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:52,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:52,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:52,597 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478495878] [2021-08-26 03:35:52,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478495878] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:52,598 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:52,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 03:35:52,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044142432] [2021-08-26 03:35:52,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 03:35:52,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:52,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 03:35:52,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 03:35:52,602 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:52,638 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2021-08-26 03:35:52,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 03:35:52,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 03:35:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:52,639 INFO L225 Difference]: With dead ends: 61 [2021-08-26 03:35:52,639 INFO L226 Difference]: Without dead ends: 57 [2021-08-26 03:35:52,640 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 03:35:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-08-26 03:35:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-08-26 03:35:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2021-08-26 03:35:52,643 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 17 [2021-08-26 03:35:52,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:52,643 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2021-08-26 03:35:52,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2021-08-26 03:35:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 03:35:52,643 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:52,644 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:52,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-26 03:35:52,644 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:52,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:52,644 INFO L82 PathProgramCache]: Analyzing trace with hash -508949322, now seen corresponding path program 1 times [2021-08-26 03:35:52,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:52,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207637793] [2021-08-26 03:35:52,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:52,645 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:52,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:52,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207637793] [2021-08-26 03:35:52,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207637793] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:35:52,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793422606] [2021-08-26 03:35:52,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:52,703 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:35:52,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:35:52,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:35:52,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 03:35:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:52,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 03:35:52,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:35:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:53,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793422606] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:35:53,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:35:53,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2021-08-26 03:35:53,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944177956] [2021-08-26 03:35:53,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 03:35:53,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:53,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 03:35:53,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-08-26 03:35:53,236 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:53,461 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2021-08-26 03:35:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 03:35:53,461 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-26 03:35:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:53,462 INFO L225 Difference]: With dead ends: 104 [2021-08-26 03:35:53,462 INFO L226 Difference]: Without dead ends: 102 [2021-08-26 03:35:53,462 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 154.6ms TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-08-26 03:35:53,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-08-26 03:35:53,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 53. [2021-08-26 03:35:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2021-08-26 03:35:53,467 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 18 [2021-08-26 03:35:53,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:53,467 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2021-08-26 03:35:53,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:53,467 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2021-08-26 03:35:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 03:35:53,469 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:53,470 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:53,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 03:35:53,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:35:53,683 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:53,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:53,683 INFO L82 PathProgramCache]: Analyzing trace with hash 479271318, now seen corresponding path program 1 times [2021-08-26 03:35:53,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:53,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696133792] [2021-08-26 03:35:53,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:53,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:53,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:53,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696133792] [2021-08-26 03:35:53,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696133792] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:53,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:53,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:35:53,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926689925] [2021-08-26 03:35:53,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:53,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:53,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:53,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:53,733 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:53,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:53,851 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2021-08-26 03:35:53,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:35:53,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-26 03:35:53,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:53,861 INFO L225 Difference]: With dead ends: 68 [2021-08-26 03:35:53,861 INFO L226 Difference]: Without dead ends: 66 [2021-08-26 03:35:53,862 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 64.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-26 03:35:53,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-08-26 03:35:53,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2021-08-26 03:35:53,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2021-08-26 03:35:53,865 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 18 [2021-08-26 03:35:53,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:53,865 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2021-08-26 03:35:53,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:53,865 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2021-08-26 03:35:53,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 03:35:53,866 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:53,866 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:53,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-26 03:35:53,866 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:53,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:53,867 INFO L82 PathProgramCache]: Analyzing trace with hash 397067279, now seen corresponding path program 1 times [2021-08-26 03:35:53,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:53,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034663613] [2021-08-26 03:35:53,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:53,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:53,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:53,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034663613] [2021-08-26 03:35:53,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034663613] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:53,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:53,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:35:53,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736740393] [2021-08-26 03:35:53,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:53,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:53,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:53,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:53,942 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:54,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:54,020 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2021-08-26 03:35:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 03:35:54,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-26 03:35:54,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:54,021 INFO L225 Difference]: With dead ends: 60 [2021-08-26 03:35:54,021 INFO L226 Difference]: Without dead ends: 58 [2021-08-26 03:35:54,021 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 45.0ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-26 03:35:54,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-08-26 03:35:54,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2021-08-26 03:35:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:54,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2021-08-26 03:35:54,024 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 19 [2021-08-26 03:35:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:54,025 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2021-08-26 03:35:54,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2021-08-26 03:35:54,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 03:35:54,025 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:54,026 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:54,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-26 03:35:54,026 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:54,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:54,026 INFO L82 PathProgramCache]: Analyzing trace with hash 450508359, now seen corresponding path program 1 times [2021-08-26 03:35:54,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:54,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822629830] [2021-08-26 03:35:54,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:54,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:54,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:54,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822629830] [2021-08-26 03:35:54,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822629830] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 03:35:54,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 03:35:54,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 03:35:54,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007290597] [2021-08-26 03:35:54,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 03:35:54,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:54,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 03:35:54,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 03:35:54,079 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:54,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:54,145 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2021-08-26 03:35:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 03:35:54,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-26 03:35:54,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:54,146 INFO L225 Difference]: With dead ends: 43 [2021-08-26 03:35:54,146 INFO L226 Difference]: Without dead ends: 20 [2021-08-26 03:35:54,146 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 40.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 03:35:54,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-08-26 03:35:54,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-08-26 03:35:54,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2021-08-26 03:35:54,148 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 19 [2021-08-26 03:35:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:54,148 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2021-08-26 03:35:54,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2021-08-26 03:35:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 03:35:54,149 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 03:35:54,149 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 03:35:54,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-26 03:35:54,149 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-08-26 03:35:54,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 03:35:54,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1395641153, now seen corresponding path program 1 times [2021-08-26 03:35:54,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 03:35:54,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566604787] [2021-08-26 03:35:54,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:54,151 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 03:35:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:54,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 03:35:54,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566604787] [2021-08-26 03:35:54,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566604787] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:35:54,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151228374] [2021-08-26 03:35:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 03:35:54,208 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 03:35:54,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 03:35:54,213 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 03:35:54,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 03:35:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 03:35:54,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 03:35:54,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 03:35:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 03:35:54,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151228374] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 03:35:54,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 03:35:54,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2021-08-26 03:35:54,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478956478] [2021-08-26 03:35:54,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 03:35:54,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 03:35:54,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 03:35:54,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-08-26 03:35:54,634 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 03:35:54,708 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2021-08-26 03:35:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 03:35:54,709 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-26 03:35:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 03:35:54,709 INFO L225 Difference]: With dead ends: 31 [2021-08-26 03:35:54,709 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 03:35:54,710 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 115.1ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-08-26 03:35:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 03:35:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 03:35:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 03:35:54,710 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2021-08-26 03:35:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 03:35:54,711 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 03:35:54,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 03:35:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 03:35:54,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 03:35:54,713 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,714 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,714 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,714 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,714 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,714 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,714 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,715 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,715 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,715 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,715 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,715 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,715 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,716 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,716 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,716 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,716 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 03:35:54,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 03:35:54,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-08-26 03:35:54,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 03:35:54,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:54,948 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:55,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:55,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:55,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:55,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 03:35:55,588 INFO L857 garLoopResultBuilder]: For program point L225(line 225) no Hoare annotation was computed. [2021-08-26 03:35:55,588 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2021-08-26 03:35:55,589 INFO L857 garLoopResultBuilder]: For program point L349(lines 349 358) no Hoare annotation was computed. [2021-08-26 03:35:55,589 INFO L853 garLoopResultBuilder]: At program point L250(lines 102 252) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) [2021-08-26 03:35:55,589 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-08-26 03:35:55,589 INFO L857 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2021-08-26 03:35:55,589 INFO L857 garLoopResultBuilder]: For program point L308(lines 308 316) no Hoare annotation was computed. [2021-08-26 03:35:55,589 INFO L857 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2021-08-26 03:35:55,590 INFO L857 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2021-08-26 03:35:55,590 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2021-08-26 03:35:55,590 INFO L857 garLoopResultBuilder]: For program point L102(lines 102 252) no Hoare annotation was computed. [2021-08-26 03:35:55,590 INFO L857 garLoopResultBuilder]: For program point L325(lines 325 362) no Hoare annotation was computed. [2021-08-26 03:35:55,590 INFO L857 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2021-08-26 03:35:55,590 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2021-08-26 03:35:55,590 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 03:35:55,590 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 03:35:55,591 INFO L857 garLoopResultBuilder]: For program point L20(lines 20 374) no Hoare annotation was computed. [2021-08-26 03:35:55,591 INFO L857 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2021-08-26 03:35:55,591 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) no Hoare annotation was computed. [2021-08-26 03:35:55,591 INFO L857 garLoopResultBuilder]: For program point L235(lines 235 243) no Hoare annotation was computed. [2021-08-26 03:35:55,591 INFO L857 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2021-08-26 03:35:55,591 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) no Hoare annotation was computed. [2021-08-26 03:35:55,591 INFO L857 garLoopResultBuilder]: For program point L153(lines 153 161) no Hoare annotation was computed. [2021-08-26 03:35:55,592 INFO L857 garLoopResultBuilder]: For program point L54(lines 54 254) no Hoare annotation was computed. [2021-08-26 03:35:55,592 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2021-08-26 03:35:55,592 INFO L857 garLoopResultBuilder]: For program point L310(line 310) no Hoare annotation was computed. [2021-08-26 03:35:55,592 INFO L857 garLoopResultBuilder]: For program point L277(lines 277 364) no Hoare annotation was computed. [2021-08-26 03:35:55,592 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) no Hoare annotation was computed. [2021-08-26 03:35:55,592 INFO L857 garLoopResultBuilder]: For program point L71(lines 71 95) no Hoare annotation was computed. [2021-08-26 03:35:55,592 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2021-08-26 03:35:55,592 INFO L857 garLoopResultBuilder]: For program point L187(lines 187 197) no Hoare annotation was computed. [2021-08-26 03:35:55,593 INFO L857 garLoopResultBuilder]: For program point L113(lines 113 204) no Hoare annotation was computed. [2021-08-26 03:35:55,593 INFO L857 garLoopResultBuilder]: For program point L237(line 237) no Hoare annotation was computed. [2021-08-26 03:35:55,593 INFO L853 garLoopResultBuilder]: At program point L328(lines 32 368) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_main_~main__t~0 1)) (.cse1 (+ ULTIMATE.start_main_~main__tagbuf_len~0 1))) (let ((.cse0 (let ((.cse3 (<= 1 ULTIMATE.start_main_~main__t~0)) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse3 (not (= ULTIMATE.start_main_~main__tagbuf_len~0 0)) .cse2 .cse4 (< 0 .cse1)) (and .cse3 .cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 0))))))) (or (and (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~17) (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse0) (and (not (= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) (< ULTIMATE.start_main_~main__t~0 .cse1) (or (and .cse2 .cse0) (= ULTIMATE.start_main_~main__t~0 0)))))) [2021-08-26 03:35:55,593 INFO L853 garLoopResultBuilder]: At program point L196(lines 60 254) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) [2021-08-26 03:35:55,593 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) no Hoare annotation was computed. [2021-08-26 03:35:55,593 INFO L857 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2021-08-26 03:35:55,594 INFO L857 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2021-08-26 03:35:55,594 INFO L857 garLoopResultBuilder]: For program point L279(line 279) no Hoare annotation was computed. [2021-08-26 03:35:55,594 INFO L857 garLoopResultBuilder]: For program point L337(lines 337 360) no Hoare annotation was computed. [2021-08-26 03:35:55,594 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) no Hoare annotation was computed. [2021-08-26 03:35:55,594 INFO L857 garLoopResultBuilder]: For program point L106(lines 106 210) no Hoare annotation was computed. [2021-08-26 03:35:55,594 INFO L857 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2021-08-26 03:35:55,594 INFO L857 garLoopResultBuilder]: For program point L296(lines 296 318) no Hoare annotation was computed. [2021-08-26 03:35:55,594 INFO L857 garLoopResultBuilder]: For program point L32(lines 32 368) no Hoare annotation was computed. [2021-08-26 03:35:55,595 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 03:35:55,595 INFO L857 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2021-08-26 03:35:55,595 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-08-26 03:35:55,595 INFO L857 garLoopResultBuilder]: For program point L24(lines 24 369) no Hoare annotation was computed. [2021-08-26 03:35:55,595 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2021-08-26 03:35:55,595 INFO L857 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2021-08-26 03:35:55,595 INFO L857 garLoopResultBuilder]: For program point L289(lines 289 363) no Hoare annotation was computed. [2021-08-26 03:35:55,595 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 03:35:55,596 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2021-08-26 03:35:55,596 INFO L857 garLoopResultBuilder]: For program point L223(lines 223 245) no Hoare annotation was computed. [2021-08-26 03:35:55,596 INFO L857 garLoopResultBuilder]: For program point L83(lines 83 93) no Hoare annotation was computed. [2021-08-26 03:35:55,596 INFO L857 garLoopResultBuilder]: For program point L339(line 339) no Hoare annotation was computed. [2021-08-26 03:35:55,596 INFO L857 garLoopResultBuilder]: For program point L141(lines 141 163) no Hoare annotation was computed. [2021-08-26 03:35:55,596 INFO L857 garLoopResultBuilder]: For program point L42(lines 42 256) no Hoare annotation was computed. [2021-08-26 03:35:55,596 INFO L857 garLoopResultBuilder]: For program point L298(line 298) no Hoare annotation was computed. [2021-08-26 03:35:55,596 INFO L857 garLoopResultBuilder]: For program point L125(lines 125 202) no Hoare annotation was computed. [2021-08-26 03:35:55,597 INFO L860 garLoopResultBuilder]: At program point L315(lines 32 368) the Hoare annotation is: true [2021-08-26 03:35:55,597 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) no Hoare annotation was computed. [2021-08-26 03:35:55,597 INFO L857 garLoopResultBuilder]: For program point L216(lines 216 251) no Hoare annotation was computed. [2021-08-26 03:35:55,597 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2021-08-26 03:35:55,597 INFO L860 garLoopResultBuilder]: At program point L373(lines 15 375) the Hoare annotation is: true [2021-08-26 03:35:55,597 INFO L857 garLoopResultBuilder]: For program point L175(lines 175 199) no Hoare annotation was computed. [2021-08-26 03:35:55,597 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) no Hoare annotation was computed. [2021-08-26 03:35:55,598 INFO L857 garLoopResultBuilder]: For program point L266(lines 266 366) no Hoare annotation was computed. [2021-08-26 03:35:55,598 INFO L857 garLoopResultBuilder]: For program point L134(lines 134 201) no Hoare annotation was computed. [2021-08-26 03:35:55,598 INFO L853 garLoopResultBuilder]: At program point L357(lines 283 364) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0))) (.cse3 (<= 0 ULTIMATE.start_main_~main__t~0))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0)) .cse2 .cse3) (and .cse2 .cse1 .cse3))))) (or (and (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~17) (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse0) (and (not (= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) (<= 0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse0 .cse1)))) [2021-08-26 03:35:55,601 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 03:35:55,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:35:55 BoogieIcfgContainer [2021-08-26 03:35:55,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 03:35:55,614 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 03:35:55,614 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 03:35:55,615 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 03:35:55,615 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:35:49" (3/4) ... [2021-08-26 03:35:55,617 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 03:35:55,626 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-26 03:35:55,626 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-26 03:35:55,627 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 03:35:55,627 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 03:35:55,670 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 03:35:55,670 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 03:35:55,671 INFO L168 Benchmark]: Toolchain (without parser) took 7189.15 ms. Allocated memory was 54.5 MB in the beginning and 146.8 MB in the end (delta: 92.3 MB). Free memory was 31.9 MB in the beginning and 77.2 MB in the end (delta: -45.3 MB). Peak memory consumption was 46.4 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:55,672 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 37.0 MB in the end (delta: 36.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 03:35:55,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.67 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 31.7 MB in the beginning and 50.3 MB in the end (delta: -18.6 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:55,672 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.49 ms. Allocated memory is still 69.2 MB. Free memory was 50.1 MB in the beginning and 48.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:55,673 INFO L168 Benchmark]: Boogie Preprocessor took 27.49 ms. Allocated memory is still 69.2 MB. Free memory was 48.2 MB in the beginning and 47.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:55,673 INFO L168 Benchmark]: RCFGBuilder took 589.73 ms. Allocated memory is still 69.2 MB. Free memory was 46.8 MB in the beginning and 37.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:55,673 INFO L168 Benchmark]: TraceAbstraction took 6123.25 ms. Allocated memory was 69.2 MB in the beginning and 146.8 MB in the end (delta: 77.6 MB). Free memory was 36.9 MB in the beginning and 83.5 MB in the end (delta: -46.5 MB). Peak memory consumption was 71.6 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:55,674 INFO L168 Benchmark]: Witness Printer took 55.91 ms. Allocated memory is still 146.8 MB. Free memory was 83.5 MB in the beginning and 77.2 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-26 03:35:55,675 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.17 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 37.0 MB in the end (delta: 36.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 343.67 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 31.7 MB in the beginning and 50.3 MB in the end (delta: -18.6 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.49 ms. Allocated memory is still 69.2 MB. Free memory was 50.1 MB in the beginning and 48.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.49 ms. Allocated memory is still 69.2 MB. Free memory was 48.2 MB in the beginning and 47.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 589.73 ms. Allocated memory is still 69.2 MB. Free memory was 46.8 MB in the beginning and 37.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6123.25 ms. Allocated memory was 69.2 MB in the beginning and 146.8 MB in the end (delta: 77.6 MB). Free memory was 36.9 MB in the beginning and 83.5 MB in the end (delta: -46.5 MB). Peak memory consumption was 71.6 MB. Max. memory is 16.1 GB. * Witness Printer took 55.91 ms. Allocated memory is still 146.8 MB. Free memory was 83.5 MB in the beginning and 77.2 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 44]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 127]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 143]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 155]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 225]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 237]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 279]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 298]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 310]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 339]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 351]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 6039.5ms, OverallIterations: 23, TraceHistogramMax: 2, EmptinessCheckTime: 21.8ms, AutomataDifference: 2104.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 647.3ms, InitialAbstractionConstructionTime: 10.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 954 SDtfs, 1404 SDslu, 1445 SDs, 0 SdLazy, 1729 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1125.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 841.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 110.1ms AutomataMinimizationTime, 23 MinimizatonAttempts, 349 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 17 NumberOfFragments, 191 HoareAnnotationTreeSize, 6 FomulaSimplifications, 665720 FormulaSimplificationTreeSizeReduction, 152.6ms HoareSimplificationTime, 6 FomulaSimplificationsInter, 78994 FormulaSimplificationTreeSizeReductionInter, 488.4ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 63.7ms SsaConstructionTime, 250.8ms SatisfiabilityAnalysisTime, 1998.2ms InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 1540 SizeOfPredicates, 6 NumberOfNonLiveVariables, 237 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 4/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((main__t < main__tagbuf_len && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((1 <= __VERIFIER_assert__cond && main__t < main__tagbuf_len) && (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t) || ((!(__VERIFIER_assert__cond == 0) && main__t == 0) && 0 <= main__t))) || (((!(main__t == main__tagbuf_len) && 0 <= main__tagbuf_len) && (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t) || ((!(__VERIFIER_assert__cond == 0) && main__t == 0) && 0 <= main__t))) && main__t == 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((1 <= __VERIFIER_assert__cond && main__t < main__tagbuf_len) && (((((1 <= main__t && !(main__tagbuf_len == 0)) && main__t <= 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__tagbuf_len + 1) || ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) || ((!(main__t == main__tagbuf_len) && main__t < main__tagbuf_len + 1) && ((main__t <= 1 && (((((1 <= main__t && !(main__tagbuf_len == 0)) && main__t <= 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__tagbuf_len + 1) || ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) || main__t == 0)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-08-26 03:35:55,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...