/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 12:23:13,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 12:23:13,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 12:23:13,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 12:23:13,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 12:23:13,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 12:23:13,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 12:23:13,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 12:23:13,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 12:23:13,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 12:23:13,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 12:23:13,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 12:23:13,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 12:23:13,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 12:23:13,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 12:23:13,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 12:23:13,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 12:23:13,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 12:23:13,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 12:23:13,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 12:23:13,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 12:23:13,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 12:23:13,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 12:23:13,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 12:23:13,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 12:23:13,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 12:23:13,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 12:23:13,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 12:23:13,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 12:23:13,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 12:23:13,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 12:23:13,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 12:23:13,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 12:23:13,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 12:23:13,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 12:23:13,734 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 12:23:13,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 12:23:13,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 12:23:13,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 12:23:13,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 12:23:13,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 12:23:13,736 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-02 12:23:13,766 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 12:23:13,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 12:23:13,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 12:23:13,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 12:23:13,769 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 12:23:13,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 12:23:13,769 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 12:23:13,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 12:23:13,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 12:23:13,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 12:23:13,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 12:23:13,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 12:23:13,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 12:23:13,770 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 12:23:13,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 12:23:13,771 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 12:23:13,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 12:23:13,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 12:23:13,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 12:23:13,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 12:23:13,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 12:23:13,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 12:23:13,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 12:23:13,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 12:23:13,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 12:23:13,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 12:23:13,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 12:23:13,772 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 12:23:13,772 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 12:23:14,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 12:23:14,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 12:23:14,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 12:23:14,075 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 12:23:14,076 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 12:23:14,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2021-05-02 12:23:14,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/661b7fa1c/f7551699754c4720b8947a00b542b2fe/FLAGdcdb34997 [2021-05-02 12:23:14,486 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 12:23:14,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2021-05-02 12:23:14,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/661b7fa1c/f7551699754c4720b8947a00b542b2fe/FLAGdcdb34997 [2021-05-02 12:23:14,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/661b7fa1c/f7551699754c4720b8947a00b542b2fe [2021-05-02 12:23:14,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 12:23:14,905 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 12:23:14,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 12:23:14,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 12:23:14,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 12:23:14,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 12:23:14" (1/1) ... [2021-05-02 12:23:14,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc0ac88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:14, skipping insertion in model container [2021-05-02 12:23:14,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 12:23:14" (1/1) ... [2021-05-02 12:23:14,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 12:23:14,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 12:23:15,068 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2021-05-02 12:23:15,076 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2021-05-02 12:23:15,078 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2021-05-02 12:23:15,079 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2021-05-02 12:23:15,081 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2021-05-02 12:23:15,081 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2021-05-02 12:23:15,083 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2021-05-02 12:23:15,084 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2021-05-02 12:23:15,085 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2021-05-02 12:23:15,085 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2021-05-02 12:23:15,087 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2021-05-02 12:23:15,088 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2021-05-02 12:23:15,090 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2021-05-02 12:23:15,091 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2021-05-02 12:23:15,092 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2021-05-02 12:23:15,093 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2021-05-02 12:23:15,094 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2021-05-02 12:23:15,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 12:23:15,100 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 12:23:15,109 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2021-05-02 12:23:15,110 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2021-05-02 12:23:15,110 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2021-05-02 12:23:15,111 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2021-05-02 12:23:15,112 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2021-05-02 12:23:15,113 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2021-05-02 12:23:15,114 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2021-05-02 12:23:15,115 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2021-05-02 12:23:15,116 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2021-05-02 12:23:15,116 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2021-05-02 12:23:15,118 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2021-05-02 12:23:15,118 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2021-05-02 12:23:15,119 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2021-05-02 12:23:15,120 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2021-05-02 12:23:15,121 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2021-05-02 12:23:15,122 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2021-05-02 12:23:15,123 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2021-05-02 12:23:15,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 12:23:15,132 INFO L208 MainTranslator]: Completed translation [2021-05-02 12:23:15,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:15 WrapperNode [2021-05-02 12:23:15,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 12:23:15,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 12:23:15,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 12:23:15,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 12:23:15,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:15" (1/1) ... [2021-05-02 12:23:15,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:15" (1/1) ... [2021-05-02 12:23:15,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:15" (1/1) ... [2021-05-02 12:23:15,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:15" (1/1) ... [2021-05-02 12:23:15,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:15" (1/1) ... [2021-05-02 12:23:15,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:15" (1/1) ... [2021-05-02 12:23:15,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:15" (1/1) ... [2021-05-02 12:23:15,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 12:23:15,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 12:23:15,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 12:23:15,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 12:23:15,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 12:23:15,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 12:23:15,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 12:23:15,214 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 12:23:15,215 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 12:23:15,215 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 12:23:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 12:23:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 12:23:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 12:23:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 12:23:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 12:23:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 12:23:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 12:23:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 12:23:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 12:23:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 12:23:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 12:23:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 12:23:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 12:23:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 12:23:15,571 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 12:23:15,571 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-02 12:23:15,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 12:23:15 BoogieIcfgContainer [2021-05-02 12:23:15,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 12:23:15,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 12:23:15,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 12:23:15,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 12:23:15,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 12:23:14" (1/3) ... [2021-05-02 12:23:15,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f25ecce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 12:23:15, skipping insertion in model container [2021-05-02 12:23:15,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:15" (2/3) ... [2021-05-02 12:23:15,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f25ecce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 12:23:15, skipping insertion in model container [2021-05-02 12:23:15,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 12:23:15" (3/3) ... [2021-05-02 12:23:15,581 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2021-05-02 12:23:15,586 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 12:23:15,589 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2021-05-02 12:23:15,599 INFO L253 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2021-05-02 12:23:15,614 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 12:23:15,615 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 12:23:15,615 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 12:23:15,615 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 12:23:15,615 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 12:23:15,615 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 12:23:15,615 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 12:23:15,615 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 12:23:15,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 71 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 12:23:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-02 12:23:15,630 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:15,631 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:15,631 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:15,635 INFO L82 PathProgramCache]: Analyzing trace with hash -388107236, now seen corresponding path program 1 times [2021-05-02 12:23:15,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:15,640 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387737045] [2021-05-02 12:23:15,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:15,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:15,839 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:15,839 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387737045] [2021-05-02 12:23:15,839 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387737045] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:15,839 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:15,839 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:23:15,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090397176] [2021-05-02 12:23:15,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:23:15,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:15,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:23:15,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:23:15,852 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 71 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:16,153 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2021-05-02 12:23:16,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:23:16,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-05-02 12:23:16,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:16,163 INFO L225 Difference]: With dead ends: 87 [2021-05-02 12:23:16,163 INFO L226 Difference]: Without dead ends: 69 [2021-05-02 12:23:16,165 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 118.3ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:16,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-02 12:23:16,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-05-02 12:23:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2021-05-02 12:23:16,199 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2021-05-02 12:23:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:16,199 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2021-05-02 12:23:16,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2021-05-02 12:23:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-02 12:23:16,200 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:16,200 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:16,200 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 12:23:16,200 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:16,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:16,202 INFO L82 PathProgramCache]: Analyzing trace with hash -384872930, now seen corresponding path program 1 times [2021-05-02 12:23:16,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:16,202 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580845752] [2021-05-02 12:23:16,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:16,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:16,328 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:16,328 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580845752] [2021-05-02 12:23:16,328 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580845752] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:16,328 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:16,328 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:23:16,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185469607] [2021-05-02 12:23:16,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:23:16,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:16,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:23:16,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:23:16,330 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:16,631 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2021-05-02 12:23:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:23:16,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-05-02 12:23:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:16,633 INFO L225 Difference]: With dead ends: 111 [2021-05-02 12:23:16,633 INFO L226 Difference]: Without dead ends: 109 [2021-05-02 12:23:16,634 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 182.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-02 12:23:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 67. [2021-05-02 12:23:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2021-05-02 12:23:16,639 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2021-05-02 12:23:16,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:16,639 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2021-05-02 12:23:16,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:16,639 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2021-05-02 12:23:16,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-02 12:23:16,640 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:16,640 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:16,640 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 12:23:16,640 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:16,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:16,640 INFO L82 PathProgramCache]: Analyzing trace with hash 853580642, now seen corresponding path program 1 times [2021-05-02 12:23:16,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:16,641 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006814759] [2021-05-02 12:23:16,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:16,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:16,695 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:16,695 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006814759] [2021-05-02 12:23:16,695 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006814759] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:16,695 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:16,695 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:23:16,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138163086] [2021-05-02 12:23:16,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:23:16,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:23:16,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:23:16,696 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:16,840 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2021-05-02 12:23:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:23:16,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-02 12:23:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:16,843 INFO L225 Difference]: With dead ends: 73 [2021-05-02 12:23:16,843 INFO L226 Difference]: Without dead ends: 71 [2021-05-02 12:23:16,844 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 57.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-02 12:23:16,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2021-05-02 12:23:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2021-05-02 12:23:16,863 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2021-05-02 12:23:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:16,863 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2021-05-02 12:23:16,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:16,863 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2021-05-02 12:23:16,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 12:23:16,864 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:16,864 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:16,864 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 12:23:16,864 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:16,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:16,864 INFO L82 PathProgramCache]: Analyzing trace with hash -47660122, now seen corresponding path program 1 times [2021-05-02 12:23:16,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:16,865 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785959987] [2021-05-02 12:23:16,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:16,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:16,936 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:16,936 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785959987] [2021-05-02 12:23:16,936 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785959987] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:16,936 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:16,936 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:23:16,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004395249] [2021-05-02 12:23:16,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:23:16,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:16,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:23:16,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:23:16,937 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:17,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:17,124 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2021-05-02 12:23:17,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:23:17,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-02 12:23:17,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:17,125 INFO L225 Difference]: With dead ends: 71 [2021-05-02 12:23:17,125 INFO L226 Difference]: Without dead ends: 69 [2021-05-02 12:23:17,126 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 73.7ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:17,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-02 12:23:17,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2021-05-02 12:23:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:17,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2021-05-02 12:23:17,129 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2021-05-02 12:23:17,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:17,130 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2021-05-02 12:23:17,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2021-05-02 12:23:17,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 12:23:17,130 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:17,130 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:17,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 12:23:17,131 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:17,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:17,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1816251534, now seen corresponding path program 1 times [2021-05-02 12:23:17,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:17,131 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294005924] [2021-05-02 12:23:17,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:17,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:17,199 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:17,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294005924] [2021-05-02 12:23:17,199 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294005924] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:17,199 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:17,199 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:23:17,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452771056] [2021-05-02 12:23:17,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:23:17,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:17,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:23:17,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:23:17,201 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:17,367 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-05-02 12:23:17,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:23:17,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-02 12:23:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:17,374 INFO L225 Difference]: With dead ends: 69 [2021-05-02 12:23:17,375 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 12:23:17,375 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 60.7ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:17,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 12:23:17,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2021-05-02 12:23:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2021-05-02 12:23:17,384 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2021-05-02 12:23:17,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:17,384 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-05-02 12:23:17,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2021-05-02 12:23:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 12:23:17,385 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:17,385 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:17,385 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 12:23:17,385 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:17,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:17,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1477460696, now seen corresponding path program 1 times [2021-05-02 12:23:17,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:17,386 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001000504] [2021-05-02 12:23:17,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:17,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:17,471 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:17,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001000504] [2021-05-02 12:23:17,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001000504] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:17,472 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:17,472 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:23:17,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130498715] [2021-05-02 12:23:17,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:23:17,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:17,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:23:17,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:23:17,474 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:17,577 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2021-05-02 12:23:17,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:23:17,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-02 12:23:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:17,579 INFO L225 Difference]: With dead ends: 67 [2021-05-02 12:23:17,579 INFO L226 Difference]: Without dead ends: 63 [2021-05-02 12:23:17,579 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 49.4ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-02 12:23:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-05-02 12:23:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2021-05-02 12:23:17,592 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 16 [2021-05-02 12:23:17,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:17,593 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2021-05-02 12:23:17,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:17,593 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2021-05-02 12:23:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 12:23:17,595 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:17,595 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:17,595 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 12:23:17,595 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:17,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:17,596 INFO L82 PathProgramCache]: Analyzing trace with hash 469655877, now seen corresponding path program 1 times [2021-05-02 12:23:17,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:17,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772300615] [2021-05-02 12:23:17,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:17,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:17,665 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:17,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772300615] [2021-05-02 12:23:17,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772300615] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:17,665 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:17,665 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:23:17,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235645009] [2021-05-02 12:23:17,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:23:17,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:17,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:23:17,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:23:17,666 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:17,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:17,846 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2021-05-02 12:23:17,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:23:17,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-02 12:23:17,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:17,847 INFO L225 Difference]: With dead ends: 104 [2021-05-02 12:23:17,847 INFO L226 Difference]: Without dead ends: 102 [2021-05-02 12:23:17,848 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 55.2ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:17,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-05-02 12:23:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 60. [2021-05-02 12:23:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2021-05-02 12:23:17,850 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2021-05-02 12:23:17,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:17,850 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2021-05-02 12:23:17,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2021-05-02 12:23:17,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 12:23:17,851 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:17,851 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:17,851 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 12:23:17,851 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:17,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:17,852 INFO L82 PathProgramCache]: Analyzing trace with hash 469225894, now seen corresponding path program 1 times [2021-05-02 12:23:17,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:17,852 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802466290] [2021-05-02 12:23:17,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:17,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:17,899 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:17,899 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802466290] [2021-05-02 12:23:17,899 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802466290] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:17,899 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:17,899 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:23:17,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661796899] [2021-05-02 12:23:17,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:23:17,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:17,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:23:17,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:23:17,900 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:17,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:17,985 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2021-05-02 12:23:17,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:23:17,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-02 12:23:17,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:17,987 INFO L225 Difference]: With dead ends: 61 [2021-05-02 12:23:17,987 INFO L226 Difference]: Without dead ends: 57 [2021-05-02 12:23:17,988 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 46.5ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:17,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-05-02 12:23:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2021-05-02 12:23:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-05-02 12:23:17,990 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2021-05-02 12:23:17,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:17,990 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-05-02 12:23:17,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-05-02 12:23:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 12:23:17,991 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:17,991 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:17,991 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 12:23:17,991 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:17,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:17,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1457581016, now seen corresponding path program 1 times [2021-05-02 12:23:17,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:17,992 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380370491] [2021-05-02 12:23:17,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:18,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:18,049 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:18,049 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380370491] [2021-05-02 12:23:18,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380370491] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:18,049 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:18,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:23:18,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088151290] [2021-05-02 12:23:18,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:23:18,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:18,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:23:18,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:23:18,051 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:18,191 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2021-05-02 12:23:18,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:23:18,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 12:23:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:18,192 INFO L225 Difference]: With dead ends: 74 [2021-05-02 12:23:18,192 INFO L226 Difference]: Without dead ends: 72 [2021-05-02 12:23:18,192 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 58.9ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:18,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-02 12:23:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2021-05-02 12:23:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2021-05-02 12:23:18,197 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2021-05-02 12:23:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:18,197 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-05-02 12:23:18,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2021-05-02 12:23:18,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 12:23:18,198 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:18,198 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:18,198 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 12:23:18,198 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:18,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:18,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1459120216, now seen corresponding path program 1 times [2021-05-02 12:23:18,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:18,198 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18680680] [2021-05-02 12:23:18,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:18,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:18,263 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:18,264 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18680680] [2021-05-02 12:23:18,264 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18680680] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:18,264 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:18,264 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:23:18,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946761068] [2021-05-02 12:23:18,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:23:18,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:18,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:23:18,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:23:18,265 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:18,386 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2021-05-02 12:23:18,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:23:18,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 12:23:18,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:18,387 INFO L225 Difference]: With dead ends: 55 [2021-05-02 12:23:18,387 INFO L226 Difference]: Without dead ends: 53 [2021-05-02 12:23:18,387 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 50.9ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-02 12:23:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2021-05-02 12:23:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-05-02 12:23:18,390 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2021-05-02 12:23:18,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:18,390 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-05-02 12:23:18,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:18,390 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-05-02 12:23:18,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 12:23:18,390 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:18,391 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:18,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 12:23:18,391 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:18,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:18,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1674433506, now seen corresponding path program 1 times [2021-05-02 12:23:18,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:18,391 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080880888] [2021-05-02 12:23:18,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:18,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:18,513 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:18,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080880888] [2021-05-02 12:23:18,513 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080880888] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:18,513 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:18,513 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:23:18,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833280442] [2021-05-02 12:23:18,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:23:18,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:18,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:23:18,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:18,514 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:18,710 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2021-05-02 12:23:18,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:23:18,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 12:23:18,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:18,711 INFO L225 Difference]: With dead ends: 110 [2021-05-02 12:23:18,711 INFO L226 Difference]: Without dead ends: 108 [2021-05-02 12:23:18,712 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 119.4ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:23:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-05-02 12:23:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 57. [2021-05-02 12:23:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-05-02 12:23:18,714 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 17 [2021-05-02 12:23:18,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:18,714 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-05-02 12:23:18,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-05-02 12:23:18,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 12:23:18,715 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:18,715 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:18,715 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 12:23:18,715 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:18,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:18,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2058260233, now seen corresponding path program 1 times [2021-05-02 12:23:18,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:18,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497294357] [2021-05-02 12:23:18,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:18,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:18,761 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:18,762 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497294357] [2021-05-02 12:23:18,762 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497294357] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:18,762 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:18,762 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:23:18,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436876518] [2021-05-02 12:23:18,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:23:18,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:18,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:23:18,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:23:18,763 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:18,891 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2021-05-02 12:23:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:23:18,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-05-02 12:23:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:18,892 INFO L225 Difference]: With dead ends: 77 [2021-05-02 12:23:18,892 INFO L226 Difference]: Without dead ends: 75 [2021-05-02 12:23:18,893 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 52.8ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-02 12:23:18,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2021-05-02 12:23:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2021-05-02 12:23:18,895 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 18 [2021-05-02 12:23:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:18,895 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2021-05-02 12:23:18,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2021-05-02 12:23:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 12:23:18,896 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:18,896 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:18,896 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 12:23:18,896 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:18,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:18,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2059625653, now seen corresponding path program 1 times [2021-05-02 12:23:18,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:18,897 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820883366] [2021-05-02 12:23:18,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:18,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:18,982 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:18,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820883366] [2021-05-02 12:23:18,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820883366] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:18,982 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:18,982 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:23:18,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773767769] [2021-05-02 12:23:18,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:23:18,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:18,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:23:18,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:18,983 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:19,143 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2021-05-02 12:23:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:23:19,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-05-02 12:23:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:19,145 INFO L225 Difference]: With dead ends: 92 [2021-05-02 12:23:19,145 INFO L226 Difference]: Without dead ends: 90 [2021-05-02 12:23:19,145 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 97.1ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:23:19,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-05-02 12:23:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2021-05-02 12:23:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2021-05-02 12:23:19,149 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 18 [2021-05-02 12:23:19,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:19,149 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2021-05-02 12:23:19,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:19,149 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2021-05-02 12:23:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 12:23:19,150 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:19,150 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:19,150 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 12:23:19,150 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:19,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:19,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2011910403, now seen corresponding path program 1 times [2021-05-02 12:23:19,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:19,151 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378180576] [2021-05-02 12:23:19,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:19,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:19,281 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:19,281 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378180576] [2021-05-02 12:23:19,281 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378180576] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:19,282 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:19,282 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:23:19,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33696037] [2021-05-02 12:23:19,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:23:19,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:19,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:23:19,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:19,282 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:19,416 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2021-05-02 12:23:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:23:19,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-05-02 12:23:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:19,418 INFO L225 Difference]: With dead ends: 76 [2021-05-02 12:23:19,418 INFO L226 Difference]: Without dead ends: 72 [2021-05-02 12:23:19,419 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 103.2ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:23:19,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-02 12:23:19,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2021-05-02 12:23:19,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:19,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2021-05-02 12:23:19,423 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 18 [2021-05-02 12:23:19,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:19,423 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2021-05-02 12:23:19,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:19,424 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2021-05-02 12:23:19,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 12:23:19,425 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:19,425 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:19,425 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 12:23:19,425 INFO L428 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:19,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:19,426 INFO L82 PathProgramCache]: Analyzing trace with hash 361585193, now seen corresponding path program 1 times [2021-05-02 12:23:19,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:19,426 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963844318] [2021-05-02 12:23:19,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:19,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:19,525 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:19,525 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963844318] [2021-05-02 12:23:19,525 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963844318] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:19,525 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:19,525 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:23:19,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420349453] [2021-05-02 12:23:19,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:23:19,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:19,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:23:19,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:19,526 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:19,661 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2021-05-02 12:23:19,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 12:23:19,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-05-02 12:23:19,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:19,663 INFO L225 Difference]: With dead ends: 72 [2021-05-02 12:23:19,663 INFO L226 Difference]: Without dead ends: 70 [2021-05-02 12:23:19,664 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 112.5ms TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-05-02 12:23:19,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-05-02 12:23:19,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2021-05-02 12:23:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2021-05-02 12:23:19,668 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 18 [2021-05-02 12:23:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:19,668 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2021-05-02 12:23:19,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2021-05-02 12:23:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 12:23:19,670 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:19,670 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:19,670 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 12:23:19,671 INFO L428 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:19,672 INFO L82 PathProgramCache]: Analyzing trace with hash 618445355, now seen corresponding path program 1 times [2021-05-02 12:23:19,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:19,672 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83136092] [2021-05-02 12:23:19,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:19,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:19,790 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:19,790 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83136092] [2021-05-02 12:23:19,790 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83136092] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:19,790 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:19,790 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:23:19,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227105466] [2021-05-02 12:23:19,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:23:19,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:19,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:23:19,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:19,791 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:19,960 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2021-05-02 12:23:19,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:23:19,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-05-02 12:23:19,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:19,961 INFO L225 Difference]: With dead ends: 91 [2021-05-02 12:23:19,961 INFO L226 Difference]: Without dead ends: 89 [2021-05-02 12:23:19,961 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 122.5ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:23:19,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-02 12:23:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2021-05-02 12:23:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2021-05-02 12:23:19,964 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 19 [2021-05-02 12:23:19,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:19,964 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2021-05-02 12:23:19,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:19,964 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2021-05-02 12:23:19,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 12:23:19,964 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:19,964 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:19,964 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 12:23:19,964 INFO L428 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:19,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:19,965 INFO L82 PathProgramCache]: Analyzing trace with hash 679767566, now seen corresponding path program 1 times [2021-05-02 12:23:19,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:19,965 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355266936] [2021-05-02 12:23:19,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:19,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:20,000 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:20,000 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355266936] [2021-05-02 12:23:20,000 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355266936] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:20,001 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:20,001 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:23:20,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190484085] [2021-05-02 12:23:20,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:23:20,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:20,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:23:20,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:23:20,001 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:20,075 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2021-05-02 12:23:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:23:20,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-02 12:23:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:20,076 INFO L225 Difference]: With dead ends: 67 [2021-05-02 12:23:20,076 INFO L226 Difference]: Without dead ends: 65 [2021-05-02 12:23:20,076 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 41.9ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-02 12:23:20,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-05-02 12:23:20,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2021-05-02 12:23:20,079 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 20 [2021-05-02 12:23:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:20,079 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2021-05-02 12:23:20,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2021-05-02 12:23:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 12:23:20,080 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:20,080 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:20,080 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 12:23:20,080 INFO L428 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:20,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:20,080 INFO L82 PathProgramCache]: Analyzing trace with hash -402038812, now seen corresponding path program 1 times [2021-05-02 12:23:20,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:20,080 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253531370] [2021-05-02 12:23:20,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:20,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:20,124 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:20,124 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253531370] [2021-05-02 12:23:20,124 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253531370] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:20,124 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:20,124 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:23:20,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248720689] [2021-05-02 12:23:20,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:23:20,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:20,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:23:20,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:23:20,126 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:20,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:20,200 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2021-05-02 12:23:20,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:23:20,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-02 12:23:20,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:20,201 INFO L225 Difference]: With dead ends: 65 [2021-05-02 12:23:20,201 INFO L226 Difference]: Without dead ends: 61 [2021-05-02 12:23:20,201 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 42.5ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-02 12:23:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-05-02 12:23:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2021-05-02 12:23:20,204 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 21 [2021-05-02 12:23:20,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:20,204 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2021-05-02 12:23:20,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2021-05-02 12:23:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-02 12:23:20,204 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:20,204 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:20,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-02 12:23:20,205 INFO L428 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:20,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:20,205 INFO L82 PathProgramCache]: Analyzing trace with hash 434938978, now seen corresponding path program 1 times [2021-05-02 12:23:20,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:20,205 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672129906] [2021-05-02 12:23:20,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:20,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:20,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:20,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672129906] [2021-05-02 12:23:20,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672129906] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:20,254 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:20,254 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:23:20,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571464157] [2021-05-02 12:23:20,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:23:20,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:20,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:23:20,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:20,255 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:20,430 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2021-05-02 12:23:20,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:23:20,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-05-02 12:23:20,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:20,431 INFO L225 Difference]: With dead ends: 76 [2021-05-02 12:23:20,431 INFO L226 Difference]: Without dead ends: 74 [2021-05-02 12:23:20,431 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 135.2ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:23:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-02 12:23:20,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2021-05-02 12:23:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2021-05-02 12:23:20,434 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 22 [2021-05-02 12:23:20,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:20,434 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2021-05-02 12:23:20,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:20,434 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2021-05-02 12:23:20,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-02 12:23:20,434 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:20,434 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:20,435 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 12:23:20,435 INFO L428 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:20,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:20,435 INFO L82 PathProgramCache]: Analyzing trace with hash -178138558, now seen corresponding path program 1 times [2021-05-02 12:23:20,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:20,435 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569782909] [2021-05-02 12:23:20,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:20,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:20,498 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:20,498 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569782909] [2021-05-02 12:23:20,498 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569782909] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:23:20,498 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089468145] [2021-05-02 12:23:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 12:23:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:20,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 19 conjunts are in the unsatisfiable core [2021-05-02 12:23:20,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 12:23:20,637 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:23:20,693 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:23:20,695 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:23:20,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:23:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:20,722 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089468145] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:23:20,722 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 12:23:20,722 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2021-05-02 12:23:20,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154173708] [2021-05-02 12:23:20,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 12:23:20,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:20,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 12:23:20,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:23:20,724 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:20,974 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2021-05-02 12:23:20,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 12:23:20,974 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-05-02 12:23:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:20,974 INFO L225 Difference]: With dead ends: 88 [2021-05-02 12:23:20,974 INFO L226 Difference]: Without dead ends: 86 [2021-05-02 12:23:20,975 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 200.5ms TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2021-05-02 12:23:20,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-05-02 12:23:20,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 52. [2021-05-02 12:23:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2021-05-02 12:23:20,979 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 22 [2021-05-02 12:23:20,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:20,979 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2021-05-02 12:23:20,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2021-05-02 12:23:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 12:23:20,980 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:20,980 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:21,198 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 12:23:21,199 INFO L428 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:21,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:21,199 INFO L82 PathProgramCache]: Analyzing trace with hash -93650716, now seen corresponding path program 1 times [2021-05-02 12:23:21,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:21,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274276206] [2021-05-02 12:23:21,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:21,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:21,262 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:21,262 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274276206] [2021-05-02 12:23:21,262 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274276206] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:21,262 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:21,262 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:23:21,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611277908] [2021-05-02 12:23:21,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:23:21,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:21,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:23:21,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:21,264 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:21,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:21,483 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2021-05-02 12:23:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:23:21,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-02 12:23:21,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:21,484 INFO L225 Difference]: With dead ends: 64 [2021-05-02 12:23:21,484 INFO L226 Difference]: Without dead ends: 62 [2021-05-02 12:23:21,487 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 171.3ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:23:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-05-02 12:23:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2021-05-02 12:23:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2021-05-02 12:23:21,489 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 23 [2021-05-02 12:23:21,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:21,490 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2021-05-02 12:23:21,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:21,490 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2021-05-02 12:23:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 12:23:21,490 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:21,490 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:21,490 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-02 12:23:21,490 INFO L428 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:21,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:21,490 INFO L82 PathProgramCache]: Analyzing trace with hash -45935466, now seen corresponding path program 1 times [2021-05-02 12:23:21,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:21,491 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769218928] [2021-05-02 12:23:21,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:21,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:21,542 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:21,542 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769218928] [2021-05-02 12:23:21,542 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769218928] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:21,542 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:21,542 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:23:21,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176676418] [2021-05-02 12:23:21,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:23:21,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:21,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:23:21,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:21,543 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:21,713 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2021-05-02 12:23:21,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:23:21,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-02 12:23:21,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:21,714 INFO L225 Difference]: With dead ends: 47 [2021-05-02 12:23:21,714 INFO L226 Difference]: Without dead ends: 24 [2021-05-02 12:23:21,715 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 148.2ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-05-02 12:23:21,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-05-02 12:23:21,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-05-02 12:23:21,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:21,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2021-05-02 12:23:21,717 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 23 [2021-05-02 12:23:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:21,717 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2021-05-02 12:23:21,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2021-05-02 12:23:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 12:23:21,717 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:21,718 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:21,718 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-02 12:23:21,718 INFO L428 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:21,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1233573943, now seen corresponding path program 1 times [2021-05-02 12:23:21,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:21,719 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523566223] [2021-05-02 12:23:21,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:21,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:21,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:21,776 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:21,776 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523566223] [2021-05-02 12:23:21,776 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523566223] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:23:21,776 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453595107] [2021-05-02 12:23:21,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 12:23:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:21,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjunts are in the unsatisfiable core [2021-05-02 12:23:21,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 12:23:21,846 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:23:21,883 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:23:21,886 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:23:21,897 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:23:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:21,907 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453595107] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:23:21,907 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 12:23:21,907 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2021-05-02 12:23:21,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57021860] [2021-05-02 12:23:21,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 12:23:21,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:21,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 12:23:21,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:23:21,908 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:22,049 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2021-05-02 12:23:22,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 12:23:22,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-02 12:23:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:22,050 INFO L225 Difference]: With dead ends: 24 [2021-05-02 12:23:22,050 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 12:23:22,050 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 168.1ms TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-05-02 12:23:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 12:23:22,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 12:23:22,050 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-05-02 12:23:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 12:23:22,051 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2021-05-02 12:23:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:22,051 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 12:23:22,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 12:23:22,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 12:23:22,264 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-05-02 12:23:22,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 12:23:22,590 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 14 [2021-05-02 12:23:22,703 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 27 [2021-05-02 12:23:22,704 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-02 12:23:22,705 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-02 12:23:22,705 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-02 12:23:22,705 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2021-05-02 12:23:22,705 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.offset| |old(#t~string5.offset)|) (= ~__tmp_383_0~0 |old(~__tmp_383_0~0)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |old(#valid)| |#valid|) (= ~__return_305~0 |old(~__return_305~0)|) (= |#t~string5.base| |old(#t~string5.base)|) (= ~__tmp_247_0~0 |old(~__tmp_247_0~0)|) (= |#t~string4.base| |old(#t~string4.base)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-05-02 12:23:22,706 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 12:23:22,706 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point L225(line 225) no Hoare annotation was computed. [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point L349(lines 349 358) no Hoare annotation was computed. [2021-05-02 12:23:22,706 INFO L194 CegarLoopUtils]: At program point L250(lines 102 252) the Hoare annotation is: (and (< main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point mainEXIT(lines 15 375) no Hoare annotation was computed. [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point L85(line 85) no Hoare annotation was computed. [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point L308(lines 308 316) no Hoare annotation was computed. [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point L143(line 143) no Hoare annotation was computed. [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point L44(line 44) no Hoare annotation was computed. [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) no Hoare annotation was computed. [2021-05-02 12:23:22,706 INFO L198 CegarLoopUtils]: For program point L102(lines 102 252) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point L325(lines 325 362) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point L127(line 127) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point L20(lines 20 374) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point L177(line 177) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point L235(lines 235 243) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point L351(line 351) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point L153(lines 153 161) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point L54(lines 54 254) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point L310(line 310) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point L277(lines 277 364) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point mainFINAL(lines 15 375) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point L71(lines 71 95) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 15 375) the Hoare annotation is: (and (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point L187(lines 187 197) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point L113(lines 113 204) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point L237(line 237) no Hoare annotation was computed. [2021-05-02 12:23:22,707 INFO L198 CegarLoopUtils]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L194 CegarLoopUtils]: At program point L328(lines 32 368) the Hoare annotation is: (let ((.cse5 (< 0 main_~main__tagbuf_len~0)) (.cse3 (<= main_~main__t~0 1)) (.cse4 (= main_~main__t~0 0))) (let ((.cse0 (let ((.cse6 (or .cse4 (not (= main_~__VERIFIER_assert__cond~13 0))))) (or (and (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~17 0)) .cse6) (and .cse6 .cse5 .cse3)))) (.cse1 (= main_~__VERIFIER_assert__cond~12 1)) (.cse2 (<= 0 main_~main__t~0))) (or (and (< main_~main__t~0 main_~main__tagbuf_len~0) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5) (and .cse0 (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) .cse1 (= main_~__VERIFIER_assert__cond~17 1) .cse2)))) [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L194 CegarLoopUtils]: At program point L196(lines 60 254) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point L155(line 155) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point L56(line 56) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point L279(line 279) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point L337(lines 337 360) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point L106(lines 106 210) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point L73(line 73) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point L296(lines 296 318) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point L32(lines 32 368) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point L189(line 189) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point L24(lines 24 369) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point L115(line 115) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-05-02 12:23:22,708 INFO L198 CegarLoopUtils]: For program point L289(lines 289 363) no Hoare annotation was computed. [2021-05-02 12:23:22,709 INFO L198 CegarLoopUtils]: For program point L223(lines 223 245) no Hoare annotation was computed. [2021-05-02 12:23:22,709 INFO L198 CegarLoopUtils]: For program point L83(lines 83 93) no Hoare annotation was computed. [2021-05-02 12:23:22,709 INFO L198 CegarLoopUtils]: For program point L339(line 339) no Hoare annotation was computed. [2021-05-02 12:23:22,709 INFO L198 CegarLoopUtils]: For program point L141(lines 141 163) no Hoare annotation was computed. [2021-05-02 12:23:22,709 INFO L198 CegarLoopUtils]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2021-05-02 12:23:22,709 INFO L198 CegarLoopUtils]: For program point L42(lines 42 256) no Hoare annotation was computed. [2021-05-02 12:23:22,709 INFO L198 CegarLoopUtils]: For program point L298(line 298) no Hoare annotation was computed. [2021-05-02 12:23:22,709 INFO L198 CegarLoopUtils]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2021-05-02 12:23:22,709 INFO L198 CegarLoopUtils]: For program point L125(lines 125 202) no Hoare annotation was computed. [2021-05-02 12:23:22,709 INFO L194 CegarLoopUtils]: At program point L315(lines 32 368) the Hoare annotation is: (<= 0 main_~main__t~0) [2021-05-02 12:23:22,709 INFO L198 CegarLoopUtils]: For program point L216(lines 216 251) no Hoare annotation was computed. [2021-05-02 12:23:22,709 INFO L198 CegarLoopUtils]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2021-05-02 12:23:22,709 INFO L198 CegarLoopUtils]: For program point L175(lines 175 199) no Hoare annotation was computed. [2021-05-02 12:23:22,709 INFO L198 CegarLoopUtils]: For program point L266(lines 266 366) no Hoare annotation was computed. [2021-05-02 12:23:22,709 INFO L198 CegarLoopUtils]: For program point L134(lines 134 201) no Hoare annotation was computed. [2021-05-02 12:23:22,709 INFO L194 CegarLoopUtils]: At program point L357(lines 283 364) the Hoare annotation is: (let ((.cse0 (= main_~main__t~0 0))) (let ((.cse1 (= main_~__VERIFIER_assert__cond~12 1)) (.cse2 (let ((.cse3 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3) (and .cse0 .cse3))))) (or (and .cse0 .cse1 .cse2 (< 0 main_~main__tagbuf_len~0)) (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) .cse1 .cse2 (= main_~__VERIFIER_assert__cond~17 1))))) [2021-05-02 12:23:22,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 12:23:22 BoogieIcfgContainer [2021-05-02 12:23:22,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 12:23:22,731 INFO L168 Benchmark]: Toolchain (without parser) took 7825.53 ms. Allocated memory was 213.9 MB in the beginning and 308.3 MB in the end (delta: 94.4 MB). Free memory was 177.5 MB in the beginning and 138.7 MB in the end (delta: 38.7 MB). Peak memory consumption was 134.0 MB. Max. memory is 8.0 GB. [2021-05-02 12:23:22,731 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 213.9 MB. Free memory is still 194.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 12:23:22,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.59 ms. Allocated memory is still 213.9 MB. Free memory was 177.1 MB in the beginning and 189.8 MB in the end (delta: -12.7 MB). Peak memory consumption was 11.8 MB. Max. memory is 8.0 GB. [2021-05-02 12:23:22,731 INFO L168 Benchmark]: Boogie Preprocessor took 20.87 ms. Allocated memory is still 213.9 MB. Free memory was 189.8 MB in the beginning and 188.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-02 12:23:22,731 INFO L168 Benchmark]: RCFGBuilder took 415.60 ms. Allocated memory is still 213.9 MB. Free memory was 188.0 MB in the beginning and 161.3 MB in the end (delta: 26.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. [2021-05-02 12:23:22,731 INFO L168 Benchmark]: TraceAbstraction took 7156.77 ms. Allocated memory was 213.9 MB in the beginning and 308.3 MB in the end (delta: 94.4 MB). Free memory was 160.8 MB in the beginning and 138.7 MB in the end (delta: 22.0 MB). Peak memory consumption was 116.9 MB. Max. memory is 8.0 GB. [2021-05-02 12:23:22,731 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.11 ms. Allocated memory is still 213.9 MB. Free memory is still 194.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 225.59 ms. Allocated memory is still 213.9 MB. Free memory was 177.1 MB in the beginning and 189.8 MB in the end (delta: -12.7 MB). Peak memory consumption was 11.8 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 20.87 ms. Allocated memory is still 213.9 MB. Free memory was 189.8 MB in the beginning and 188.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 415.60 ms. Allocated memory is still 213.9 MB. Free memory was 188.0 MB in the beginning and 161.3 MB in the end (delta: 26.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7156.77 ms. Allocated memory was 213.9 MB in the beginning and 308.3 MB in the end (delta: 94.4 MB). Free memory was 160.8 MB in the beginning and 138.7 MB in the end (delta: 22.0 MB). Peak memory consumption was 116.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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 - 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: 298]: 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: 310]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 279]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 237]: 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: 143]: 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: 85]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 83 locations, 17 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6651.4ms, OverallIterations: 23, TraceHistogramMax: 2, EmptinessCheckTime: 17.7ms, AutomataDifference: 3832.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 439.6ms, InitialAbstractionConstructionTime: 9.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1006 SDtfs, 1574 SDslu, 1477 SDs, 0 SdLazy, 3158 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1706.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 2269.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 121.9ms AutomataMinimizationTime, 23 MinimizatonAttempts, 315 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 257 HoareAnnotationTreeSize, 9 FomulaSimplifications, 602691 FormulaSimplificationTreeSizeReduction, 77.1ms HoareSimplificationTime, 9 FomulaSimplificationsInter, 26569 FormulaSimplificationTreeSizeReductionInter, 356.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 51.7ms SsaConstructionTime, 237.1ms SatisfiabilityAnalysisTime, 1735.3ms InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 2123 SizeOfPredicates, 16 NumberOfNonLiveVariables, 373 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 8/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((main__t < main__tagbuf_len && (((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && (main__t == 0 || !(__VERIFIER_assert__cond == 0))) || (((main__t == 0 || !(__VERIFIER_assert__cond == 0)) && 0 < main__tagbuf_len) && main__t <= 1))) && __VERIFIER_assert__cond == 1) && 0 <= main__t) && main__t <= 1) || (main__t == 0 && 0 < main__tagbuf_len)) || ((((((((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && (main__t == 0 || !(__VERIFIER_assert__cond == 0))) || (((main__t == 0 || !(__VERIFIER_assert__cond == 0)) && 0 < main__tagbuf_len) && main__t <= 1)) && main__t <= main__tagbuf_len) && !(main__tagbuf_len == main__t)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 0 <= main__t) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) && main__t <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((main__t < main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: (((main__t == 0 && __VERIFIER_assert__cond == 1) && (((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (main__t == 0 && !(__VERIFIER_assert__cond == 0)))) && 0 < main__tagbuf_len) || ((((main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && __VERIFIER_assert__cond == 1) && (((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (main__t == 0 && !(__VERIFIER_assert__cond == 0)))) && __VERIFIER_assert__cond == 1) RESULT: Ultimate proved your program to be correct! Received shutdown request...