/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/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-06 11:33:54,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 11:33:54,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 11:33:54,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 11:33:54,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 11:33:54,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 11:33:54,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 11:33:54,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 11:33:54,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 11:33:54,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 11:33:54,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 11:33:54,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 11:33:54,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 11:33:54,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 11:33:54,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 11:33:54,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 11:33:54,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 11:33:54,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 11:33:54,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 11:33:54,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 11:33:54,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 11:33:54,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 11:33:54,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 11:33:54,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 11:33:54,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 11:33:54,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 11:33:54,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 11:33:54,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 11:33:54,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 11:33:54,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 11:33:54,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 11:33:54,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 11:33:54,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 11:33:54,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 11:33:54,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 11:33:54,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 11:33:54,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 11:33:54,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 11:33:54,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 11:33:54,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 11:33:54,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 11:33:54,109 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-06 11:33:54,124 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 11:33:54,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 11:33:54,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 11:33:54,127 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 11:33:54,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 11:33:54,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 11:33:54,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 11:33:54,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 11:33:54,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 11:33:54,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 11:33:54,129 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 11:33:54,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 11:33:54,130 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 11:33:54,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 11:33:54,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 11:33:54,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 11:33:54,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 11:33:54,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 11:33:54,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 11:33:54,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 11:33:54,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-06 11:33:54,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-06 11:33:54,131 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-06 11:33:54,131 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-06 11:33:54,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 11:33:54,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 11:33:54,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 11:33:54,470 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 11:33:54,475 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 11:33:54,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-05-06 11:33:54,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095601db9/ae95bd3828ab4d8989b7b9716bc97e07/FLAGd132a31b2 [2021-05-06 11:33:54,917 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 11:33:54,918 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-05-06 11:33:54,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095601db9/ae95bd3828ab4d8989b7b9716bc97e07/FLAGd132a31b2 [2021-05-06 11:33:54,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095601db9/ae95bd3828ab4d8989b7b9716bc97e07 [2021-05-06 11:33:54,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 11:33:54,939 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-06 11:33:54,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 11:33:54,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 11:33:54,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 11:33:54,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:33:54" (1/1) ... [2021-05-06 11:33:54,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e61aec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:54, skipping insertion in model container [2021-05-06 11:33:54,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:33:54" (1/1) ... [2021-05-06 11:33:54,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 11:33:54,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 11:33:55,097 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-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2021-05-06 11:33:55,100 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-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2021-05-06 11:33:55,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-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2021-05-06 11:33:55,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-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2021-05-06 11:33:55,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-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2021-05-06 11:33:55,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-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2021-05-06 11:33:55,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-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2021-05-06 11:33:55,117 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-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2021-05-06 11:33:55,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-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2021-05-06 11:33:55,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-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2021-05-06 11:33:55,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-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2021-05-06 11:33:55,133 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-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2021-05-06 11:33:55,141 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-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2021-05-06 11:33:55,145 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-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2021-05-06 11:33:55,153 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-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2021-05-06 11:33:55,159 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-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2021-05-06 11:33:55,163 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-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2021-05-06 11:33:55,164 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-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2021-05-06 11:33:55,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:33:55,215 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 11:33:55,228 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-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2021-05-06 11:33:55,229 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-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2021-05-06 11:33:55,231 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-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2021-05-06 11:33:55,231 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-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2021-05-06 11:33:55,233 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-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2021-05-06 11:33:55,234 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-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2021-05-06 11:33:55,235 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-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2021-05-06 11:33:55,236 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-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2021-05-06 11:33:55,238 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-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2021-05-06 11:33:55,239 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-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2021-05-06 11:33:55,240 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-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2021-05-06 11:33:55,241 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-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2021-05-06 11:33:55,242 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-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2021-05-06 11:33:55,243 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-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2021-05-06 11:33:55,244 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-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2021-05-06 11:33:55,245 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-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2021-05-06 11:33:55,247 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-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2021-05-06 11:33:55,248 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-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2021-05-06 11:33:55,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:33:55,260 INFO L208 MainTranslator]: Completed translation [2021-05-06 11:33:55,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:55 WrapperNode [2021-05-06 11:33:55,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 11:33:55,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 11:33:55,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 11:33:55,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 11:33:55,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:55" (1/1) ... [2021-05-06 11:33:55,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:55" (1/1) ... [2021-05-06 11:33:55,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:55" (1/1) ... [2021-05-06 11:33:55,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:55" (1/1) ... [2021-05-06 11:33:55,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:55" (1/1) ... [2021-05-06 11:33:55,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:55" (1/1) ... [2021-05-06 11:33:55,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:55" (1/1) ... [2021-05-06 11:33:55,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 11:33:55,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 11:33:55,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 11:33:55,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 11:33:55,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:55" (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-06 11:33:55,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 11:33:55,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 11:33:55,393 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 11:33:55,393 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-06 11:33:55,393 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 11:33:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 11:33:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 11:33:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 11:33:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 11:33:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-06 11:33:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 11:33:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-06 11:33:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 11:33:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 11:33:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 11:33:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 11:33:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 11:33:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 11:33:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 11:33:55,891 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 11:33:55,892 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-06 11:33:55,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:33:55 BoogieIcfgContainer [2021-05-06 11:33:55,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 11:33:55,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 11:33:55,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 11:33:55,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 11:33:55,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 11:33:54" (1/3) ... [2021-05-06 11:33:55,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704c884f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:33:55, skipping insertion in model container [2021-05-06 11:33:55,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:55" (2/3) ... [2021-05-06 11:33:55,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704c884f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:33:55, skipping insertion in model container [2021-05-06 11:33:55,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:33:55" (3/3) ... [2021-05-06 11:33:55,904 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2021-05-06 11:33:55,908 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-06 11:33:55,910 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2021-05-06 11:33:55,922 INFO L253 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-05-06 11:33:55,936 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 11:33:55,937 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-06 11:33:55,937 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-06 11:33:55,937 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 11:33:55,937 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 11:33:55,937 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 11:33:55,937 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 11:33:55,937 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 11:33:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 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-06 11:33:55,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-06 11:33:55,961 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:55,962 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-06 11:33:55,963 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:55,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:55,967 INFO L82 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 1 times [2021-05-06 11:33:55,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:55,974 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1052725300] [2021-05-06 11:33:55,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:56,020 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:56,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 11:33:56,202 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:56,202 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1052725300] [2021-05-06 11:33:56,203 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1052725300] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:56,203 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:56,204 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 11:33:56,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161802773] [2021-05-06 11:33:56,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 11:33:56,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:56,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 11:33:56,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:56,217 INFO L87 Difference]: Start difference. First operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 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 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-06 11:33:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:56,345 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2021-05-06 11:33:56,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 11:33:56,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-06 11:33:56,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:56,353 INFO L225 Difference]: With dead ends: 93 [2021-05-06 11:33:56,353 INFO L226 Difference]: Without dead ends: 80 [2021-05-06 11:33:56,356 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 80.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-06 11:33:56,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-05-06 11:33:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-05-06 11:33:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 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-06 11:33:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2021-05-06 11:33:56,419 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2021-05-06 11:33:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:56,419 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2021-05-06 11:33:56,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-06 11:33:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2021-05-06 11:33:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-06 11:33:56,421 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:56,421 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-06 11:33:56,422 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 11:33:56,422 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:56,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:56,423 INFO L82 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 1 times [2021-05-06 11:33:56,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:56,424 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [237532805] [2021-05-06 11:33:56,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:56,433 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:56,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:56,560 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-06 11:33:56,560 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:56,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [237532805] [2021-05-06 11:33:56,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [237532805] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:56,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:56,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:33:56,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522775963] [2021-05-06 11:33:56,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:33:56,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:56,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:33:56,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:33:56,562 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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-06 11:33:56,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:56,868 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2021-05-06 11:33:56,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:33:56,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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-06 11:33:56,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:56,869 INFO L225 Difference]: With dead ends: 80 [2021-05-06 11:33:56,870 INFO L226 Difference]: Without dead ends: 78 [2021-05-06 11:33:56,871 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 177.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-06 11:33:56,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-05-06 11:33:56,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-05-06 11:33:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 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-06 11:33:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2021-05-06 11:33:56,889 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2021-05-06 11:33:56,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:56,889 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2021-05-06 11:33:56,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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-06 11:33:56,889 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2021-05-06 11:33:56,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-06 11:33:56,890 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:56,890 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-06 11:33:56,890 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 11:33:56,890 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:56,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:56,891 INFO L82 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 1 times [2021-05-06 11:33:56,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:56,891 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [856101817] [2021-05-06 11:33:56,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:56,893 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:56,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:56,964 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-06 11:33:56,964 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:56,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [856101817] [2021-05-06 11:33:56,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [856101817] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:56,964 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:56,964 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 11:33:56,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731728166] [2021-05-06 11:33:56,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 11:33:56,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:56,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 11:33:56,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 11:33:56,966 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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-06 11:33:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:57,270 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2021-05-06 11:33:57,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:33:57,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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-06 11:33:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:57,276 INFO L225 Difference]: With dead ends: 101 [2021-05-06 11:33:57,277 INFO L226 Difference]: Without dead ends: 99 [2021-05-06 11:33:57,278 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 124.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-06 11:33:57,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-06 11:33:57,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2021-05-06 11:33:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 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-06 11:33:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2021-05-06 11:33:57,313 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2021-05-06 11:33:57,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:57,313 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2021-05-06 11:33:57,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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-06 11:33:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2021-05-06 11:33:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-06 11:33:57,314 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:57,314 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-06 11:33:57,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 11:33:57,315 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:57,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:57,317 INFO L82 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 1 times [2021-05-06 11:33:57,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:57,320 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1744731430] [2021-05-06 11:33:57,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:57,322 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:57,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:57,453 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-06 11:33:57,453 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:57,454 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1744731430] [2021-05-06 11:33:57,454 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1744731430] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:57,454 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:57,454 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:33:57,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877386336] [2021-05-06 11:33:57,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:33:57,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:57,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:33:57,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:57,456 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-06 11:33:57,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:57,680 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-05-06 11:33:57,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:33:57,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-06 11:33:57,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:57,681 INFO L225 Difference]: With dead ends: 76 [2021-05-06 11:33:57,681 INFO L226 Difference]: Without dead ends: 74 [2021-05-06 11:33:57,682 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 142.2ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-06 11:33:57,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-06 11:33:57,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-05-06 11:33:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 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-06 11:33:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-05-06 11:33:57,719 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2021-05-06 11:33:57,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:57,720 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-05-06 11:33:57,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-06 11:33:57,722 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-05-06 11:33:57,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-06 11:33:57,724 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:57,724 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, 1, 1, 1] [2021-05-06 11:33:57,724 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 11:33:57,724 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:57,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:57,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 1 times [2021-05-06 11:33:57,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:57,725 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1067841416] [2021-05-06 11:33:57,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:57,727 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:57,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:57,837 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-06 11:33:57,837 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:57,837 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1067841416] [2021-05-06 11:33:57,838 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1067841416] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:57,838 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:57,838 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:33:57,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879528436] [2021-05-06 11:33:57,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:33:57,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:57,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:33:57,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:57,843 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-06 11:33:58,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:58,384 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2021-05-06 11:33:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 11:33:58,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 26 [2021-05-06 11:33:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:58,385 INFO L225 Difference]: With dead ends: 141 [2021-05-06 11:33:58,385 INFO L226 Difference]: Without dead ends: 139 [2021-05-06 11:33:58,386 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 252.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-06 11:33:58,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-06 11:33:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2021-05-06 11:33:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 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-06 11:33:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2021-05-06 11:33:58,403 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2021-05-06 11:33:58,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:58,403 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2021-05-06 11:33:58,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-06 11:33:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2021-05-06 11:33:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-06 11:33:58,405 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:58,405 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, 1, 1, 1] [2021-05-06 11:33:58,405 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-06 11:33:58,405 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:58,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:58,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 1 times [2021-05-06 11:33:58,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:58,406 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [336655374] [2021-05-06 11:33:58,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:58,408 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:58,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:58,472 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-06 11:33:58,472 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:58,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [336655374] [2021-05-06 11:33:58,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [336655374] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:58,472 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:58,472 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:33:58,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513739280] [2021-05-06 11:33:58,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:33:58,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:58,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:33:58,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:58,474 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-06 11:33:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:58,887 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2021-05-06 11:33:58,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 11:33:58,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 26 [2021-05-06 11:33:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:58,888 INFO L225 Difference]: With dead ends: 108 [2021-05-06 11:33:58,889 INFO L226 Difference]: Without dead ends: 106 [2021-05-06 11:33:58,889 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 232.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-06 11:33:58,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-05-06 11:33:58,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2021-05-06 11:33:58,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 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-06 11:33:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2021-05-06 11:33:58,906 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2021-05-06 11:33:58,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:58,906 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2021-05-06 11:33:58,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-06 11:33:58,906 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2021-05-06 11:33:58,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-06 11:33:58,907 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:58,907 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, 1, 1, 1, 1] [2021-05-06 11:33:58,907 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-06 11:33:58,907 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:58,908 INFO L82 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 1 times [2021-05-06 11:33:58,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:58,908 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [145209325] [2021-05-06 11:33:58,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:58,909 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:58,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:58,976 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-06 11:33:58,976 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:58,977 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [145209325] [2021-05-06 11:33:58,977 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [145209325] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:58,977 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:58,977 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:33:58,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687596008] [2021-05-06 11:33:58,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:33:58,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:58,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:33:58,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:58,978 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-06 11:33:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:59,288 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2021-05-06 11:33:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:33:59,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 27 [2021-05-06 11:33:59,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:59,290 INFO L225 Difference]: With dead ends: 121 [2021-05-06 11:33:59,290 INFO L226 Difference]: Without dead ends: 119 [2021-05-06 11:33:59,291 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 171.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-06 11:33:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-06 11:33:59,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2021-05-06 11:33:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 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-06 11:33:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2021-05-06 11:33:59,307 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2021-05-06 11:33:59,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:59,307 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2021-05-06 11:33:59,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-06 11:33:59,307 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2021-05-06 11:33:59,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-06 11:33:59,310 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:59,310 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, 1, 1, 1, 1] [2021-05-06 11:33:59,310 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-06 11:33:59,310 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:59,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:59,311 INFO L82 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 1 times [2021-05-06 11:33:59,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:59,311 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [809727477] [2021-05-06 11:33:59,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:59,313 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:59,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:59,396 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-06 11:33:59,396 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:59,396 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [809727477] [2021-05-06 11:33:59,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [809727477] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:59,397 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:59,400 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:33:59,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251226157] [2021-05-06 11:33:59,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:33:59,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:59,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:33:59,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:59,401 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-06 11:33:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:59,637 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2021-05-06 11:33:59,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:33:59,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 27 [2021-05-06 11:33:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:59,638 INFO L225 Difference]: With dead ends: 77 [2021-05-06 11:33:59,638 INFO L226 Difference]: Without dead ends: 75 [2021-05-06 11:33:59,639 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 175.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-06 11:33:59,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-06 11:33:59,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-06 11:33:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 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-06 11:33:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2021-05-06 11:33:59,655 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2021-05-06 11:33:59,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:59,656 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2021-05-06 11:33:59,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-06 11:33:59,656 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2021-05-06 11:33:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-06 11:33:59,660 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:59,661 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, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:59,661 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-06 11:33:59,661 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:59,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 1 times [2021-05-06 11:33:59,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:59,661 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [788730071] [2021-05-06 11:33:59,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:59,663 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:59,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:59,710 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-06 11:33:59,710 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:59,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [788730071] [2021-05-06 11:33:59,710 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [788730071] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:59,710 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:59,710 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 11:33:59,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618781170] [2021-05-06 11:33:59,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 11:33:59,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:59,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 11:33:59,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:59,712 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-06 11:33:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:59,861 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2021-05-06 11:33:59,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 11:33:59,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2021-05-06 11:33:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:59,862 INFO L225 Difference]: With dead ends: 115 [2021-05-06 11:33:59,862 INFO L226 Difference]: Without dead ends: 75 [2021-05-06 11:33:59,862 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-06 11:33:59,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-06 11:33:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-06 11:33:59,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 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-06 11:33:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-05-06 11:33:59,880 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2021-05-06 11:33:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:59,880 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-05-06 11:33:59,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-06 11:33:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-05-06 11:33:59,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-06 11:33:59,881 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:59,881 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, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:59,881 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-06 11:33:59,881 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:59,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:59,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 1 times [2021-05-06 11:33:59,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:59,882 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2112682746] [2021-05-06 11:33:59,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:59,883 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:59,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:59,947 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-06 11:33:59,947 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:59,947 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2112682746] [2021-05-06 11:33:59,947 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2112682746] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:59,948 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:59,948 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:33:59,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978494211] [2021-05-06 11:33:59,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:33:59,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:59,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:33:59,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:59,949 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-06 11:34:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:00,157 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-05-06 11:34:00,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:34:00,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 30 [2021-05-06 11:34:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:00,159 INFO L225 Difference]: With dead ends: 76 [2021-05-06 11:34:00,159 INFO L226 Difference]: Without dead ends: 74 [2021-05-06 11:34:00,159 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 142.2ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-06 11:34:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-06 11:34:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2021-05-06 11:34:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 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-06 11:34:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2021-05-06 11:34:00,174 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2021-05-06 11:34:00,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:00,174 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2021-05-06 11:34:00,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-06 11:34:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2021-05-06 11:34:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-06 11:34:00,175 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:00,175 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, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:00,175 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-06 11:34:00,175 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:00,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:00,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 1 times [2021-05-06 11:34:00,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:00,176 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [62139497] [2021-05-06 11:34:00,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:00,192 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2021-05-06 11:34:00,192 WARN L75 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-06 11:34:00,194 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:00,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:00,259 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-06 11:34:00,260 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:00,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [62139497] [2021-05-06 11:34:00,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [62139497] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:00,260 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:00,260 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:34:00,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078034056] [2021-05-06 11:34:00,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:34:00,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:00,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:34:00,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:34:00,261 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-06 11:34:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:00,532 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-05-06 11:34:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:34:00,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 30 [2021-05-06 11:34:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:00,533 INFO L225 Difference]: With dead ends: 111 [2021-05-06 11:34:00,533 INFO L226 Difference]: Without dead ends: 109 [2021-05-06 11:34:00,534 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 130.5ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-06 11:34:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-06 11:34:00,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2021-05-06 11:34:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 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-06 11:34:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-05-06 11:34:00,551 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2021-05-06 11:34:00,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:00,552 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-05-06 11:34:00,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-06 11:34:00,552 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-05-06 11:34:00,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-06 11:34:00,552 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:00,552 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:00,553 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-06 11:34:00,553 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:00,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:00,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 1 times [2021-05-06 11:34:00,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:00,553 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1600768752] [2021-05-06 11:34:00,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:00,555 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:00,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:00,607 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-06 11:34:00,607 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:00,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1600768752] [2021-05-06 11:34:00,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1600768752] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:00,608 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:00,608 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:34:00,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860846531] [2021-05-06 11:34:00,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:34:00,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:00,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:34:00,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:34:00,609 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-06 11:34:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:00,778 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2021-05-06 11:34:00,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:34:00,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 31 [2021-05-06 11:34:00,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:00,779 INFO L225 Difference]: With dead ends: 70 [2021-05-06 11:34:00,779 INFO L226 Difference]: Without dead ends: 68 [2021-05-06 11:34:00,779 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 112.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-06 11:34:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-06 11:34:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-05-06 11:34:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 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-06 11:34:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-05-06 11:34:00,794 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2021-05-06 11:34:00,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:00,794 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-05-06 11:34:00,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-06 11:34:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-05-06 11:34:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-06 11:34:00,794 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:00,795 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 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-06 11:34:00,795 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-06 11:34:00,795 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:00,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:00,795 INFO L82 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 1 times [2021-05-06 11:34:00,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:00,796 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1407285778] [2021-05-06 11:34:00,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:00,799 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2021-05-06 11:34:00,799 WARN L75 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-06 11:34:00,800 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:00,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:00,857 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-06 11:34:00,858 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:00,858 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1407285778] [2021-05-06 11:34:00,858 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1407285778] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:00,858 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:00,858 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:34:00,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504333037] [2021-05-06 11:34:00,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:34:00,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:00,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:34:00,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:34:00,859 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-06 11:34:01,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:01,038 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2021-05-06 11:34:01,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:34:01,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 31 [2021-05-06 11:34:01,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:01,039 INFO L225 Difference]: With dead ends: 69 [2021-05-06 11:34:01,039 INFO L226 Difference]: Without dead ends: 67 [2021-05-06 11:34:01,040 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 131.7ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-06 11:34:01,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-06 11:34:01,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2021-05-06 11:34:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 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-06 11:34:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2021-05-06 11:34:01,053 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2021-05-06 11:34:01,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:01,053 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2021-05-06 11:34:01,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-06 11:34:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2021-05-06 11:34:01,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-06 11:34:01,054 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:01,054 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:01,054 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-06 11:34:01,054 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:01,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:01,054 INFO L82 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 1 times [2021-05-06 11:34:01,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:01,055 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1298742607] [2021-05-06 11:34:01,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:01,056 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:01,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:01,137 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-06 11:34:01,137 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:01,137 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1298742607] [2021-05-06 11:34:01,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1298742607] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:01,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:01,138 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:34:01,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695009443] [2021-05-06 11:34:01,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:34:01,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:01,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:34:01,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:34:01,139 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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-06 11:34:01,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:01,318 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2021-05-06 11:34:01,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:34:01,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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 34 [2021-05-06 11:34:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:01,319 INFO L225 Difference]: With dead ends: 63 [2021-05-06 11:34:01,319 INFO L226 Difference]: Without dead ends: 61 [2021-05-06 11:34:01,320 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 151.4ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-06 11:34:01,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-06 11:34:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2021-05-06 11:34:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 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-06 11:34:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2021-05-06 11:34:01,331 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2021-05-06 11:34:01,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:01,331 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-05-06 11:34:01,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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-06 11:34:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2021-05-06 11:34:01,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-06 11:34:01,332 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:01,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:01,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-06 11:34:01,332 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:01,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:01,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 1 times [2021-05-06 11:34:01,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:01,333 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2019990367] [2021-05-06 11:34:01,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:01,334 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:01,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:01,394 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-06 11:34:01,394 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:01,395 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2019990367] [2021-05-06 11:34:01,395 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2019990367] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:01,395 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:01,395 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:34:01,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240602733] [2021-05-06 11:34:01,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:34:01,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:01,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:34:01,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:34:01,396 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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-06 11:34:01,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:01,608 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2021-05-06 11:34:01,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:34:01,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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 35 [2021-05-06 11:34:01,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:01,610 INFO L225 Difference]: With dead ends: 71 [2021-05-06 11:34:01,610 INFO L226 Difference]: Without dead ends: 69 [2021-05-06 11:34:01,610 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 135.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-06 11:34:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-06 11:34:01,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2021-05-06 11:34:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 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-06 11:34:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2021-05-06 11:34:01,622 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2021-05-06 11:34:01,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:01,622 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2021-05-06 11:34:01,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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-06 11:34:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2021-05-06 11:34:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-05-06 11:34:01,623 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:01,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:01,623 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-06 11:34:01,623 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:01,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:01,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 1 times [2021-05-06 11:34:01,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:01,624 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [280823780] [2021-05-06 11:34:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:01,625 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:01,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:01,687 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-06 11:34:01,687 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:01,687 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [280823780] [2021-05-06 11:34:01,687 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [280823780] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:01,687 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:01,687 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:34:01,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37420646] [2021-05-06 11:34:01,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:34:01,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:01,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:34:01,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:34:01,688 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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-06 11:34:02,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:02,068 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2021-05-06 11:34:02,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 11:34:02,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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 38 [2021-05-06 11:34:02,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:02,069 INFO L225 Difference]: With dead ends: 91 [2021-05-06 11:34:02,069 INFO L226 Difference]: Without dead ends: 89 [2021-05-06 11:34:02,070 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 264.0ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-05-06 11:34:02,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-06 11:34:02,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2021-05-06 11:34:02,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 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-06 11:34:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2021-05-06 11:34:02,083 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2021-05-06 11:34:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:02,083 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2021-05-06 11:34:02,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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-06 11:34:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2021-05-06 11:34:02,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-06 11:34:02,084 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:02,084 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:02,084 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-06 11:34:02,084 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:02,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:02,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 1 times [2021-05-06 11:34:02,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:02,085 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [494868703] [2021-05-06 11:34:02,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:02,086 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:02,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:02,143 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-06 11:34:02,143 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:02,143 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [494868703] [2021-05-06 11:34:02,144 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [494868703] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:02,144 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:02,144 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:34:02,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621564651] [2021-05-06 11:34:02,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:34:02,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:02,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:34:02,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:34:02,145 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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-06 11:34:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:02,377 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2021-05-06 11:34:02,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:34:02,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 39 [2021-05-06 11:34:02,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:02,378 INFO L225 Difference]: With dead ends: 61 [2021-05-06 11:34:02,378 INFO L226 Difference]: Without dead ends: 59 [2021-05-06 11:34:02,378 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 169.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-06 11:34:02,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-06 11:34:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-06 11:34:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 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-06 11:34:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2021-05-06 11:34:02,401 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2021-05-06 11:34:02,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:02,401 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2021-05-06 11:34:02,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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-06 11:34:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2021-05-06 11:34:02,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-06 11:34:02,401 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:02,401 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:02,402 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-06 11:34:02,402 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:02,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:02,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 1 times [2021-05-06 11:34:02,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:02,402 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1197753780] [2021-05-06 11:34:02,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:02,404 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:02,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:02,455 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-06 11:34:02,455 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:02,455 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1197753780] [2021-05-06 11:34:02,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1197753780] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:02,455 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:02,455 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 11:34:02,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045585310] [2021-05-06 11:34:02,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 11:34:02,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:02,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 11:34:02,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 11:34:02,456 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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-06 11:34:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:02,652 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2021-05-06 11:34:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:34:02,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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 41 [2021-05-06 11:34:02,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:02,653 INFO L225 Difference]: With dead ends: 70 [2021-05-06 11:34:02,653 INFO L226 Difference]: Without dead ends: 68 [2021-05-06 11:34:02,654 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 106.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-06 11:34:02,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-06 11:34:02,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2021-05-06 11:34:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 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-06 11:34:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2021-05-06 11:34:02,666 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2021-05-06 11:34:02,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:02,667 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2021-05-06 11:34:02,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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-06 11:34:02,667 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2021-05-06 11:34:02,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-05-06 11:34:02,667 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:02,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:02,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-06 11:34:02,667 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:02,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:02,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 1 times [2021-05-06 11:34:02,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:02,668 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1939015629] [2021-05-06 11:34:02,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:02,669 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:02,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:02,724 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-06 11:34:02,724 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:02,724 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1939015629] [2021-05-06 11:34:02,724 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1939015629] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:02,724 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:02,725 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:34:02,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245318687] [2021-05-06 11:34:02,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:34:02,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:02,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:34:02,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:34:02,726 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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-06 11:34:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:02,934 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-05-06 11:34:02,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:34:02,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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 42 [2021-05-06 11:34:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:02,935 INFO L225 Difference]: With dead ends: 66 [2021-05-06 11:34:02,935 INFO L226 Difference]: Without dead ends: 64 [2021-05-06 11:34:02,936 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 108.7ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-06 11:34:02,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-06 11:34:02,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2021-05-06 11:34:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 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-06 11:34:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-05-06 11:34:02,948 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2021-05-06 11:34:02,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:02,948 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-05-06 11:34:02,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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-06 11:34:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2021-05-06 11:34:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-06 11:34:02,949 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:02,949 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:02,949 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-06 11:34:02,949 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:02,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:02,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 1 times [2021-05-06 11:34:02,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:02,950 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [268886935] [2021-05-06 11:34:02,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:02,953 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:03,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:03,018 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-06 11:34:03,018 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:03,018 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [268886935] [2021-05-06 11:34:03,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [268886935] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:03,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:03,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:34:03,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986449154] [2021-05-06 11:34:03,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:34:03,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:03,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:34:03,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:34:03,020 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 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-06 11:34:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:03,394 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2021-05-06 11:34:03,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-06 11:34:03,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 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 43 [2021-05-06 11:34:03,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:03,395 INFO L225 Difference]: With dead ends: 88 [2021-05-06 11:34:03,395 INFO L226 Difference]: Without dead ends: 86 [2021-05-06 11:34:03,395 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 236.2ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-05-06 11:34:03,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-05-06 11:34:03,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2021-05-06 11:34:03,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 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-06 11:34:03,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2021-05-06 11:34:03,410 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2021-05-06 11:34:03,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:03,410 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2021-05-06 11:34:03,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 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-06 11:34:03,410 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2021-05-06 11:34:03,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-06 11:34:03,411 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:03,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:03,411 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-06 11:34:03,411 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:03,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:03,412 INFO L82 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 1 times [2021-05-06 11:34:03,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:03,412 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1942790400] [2021-05-06 11:34:03,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:03,416 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2021-05-06 11:34:03,416 WARN L75 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-06 11:34:03,418 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:03,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:03,490 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-06 11:34:03,490 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:03,490 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1942790400] [2021-05-06 11:34:03,490 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1942790400] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:03,491 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:03,491 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:34:03,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579853794] [2021-05-06 11:34:03,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:34:03,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:03,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:34:03,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:34:03,492 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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-06 11:34:03,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:03,690 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2021-05-06 11:34:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:34:03,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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 44 [2021-05-06 11:34:03,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:03,691 INFO L225 Difference]: With dead ends: 60 [2021-05-06 11:34:03,691 INFO L226 Difference]: Without dead ends: 58 [2021-05-06 11:34:03,691 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 138.7ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-06 11:34:03,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-06 11:34:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-05-06 11:34:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 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-06 11:34:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2021-05-06 11:34:03,707 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2021-05-06 11:34:03,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:03,707 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2021-05-06 11:34:03,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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-06 11:34:03,707 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2021-05-06 11:34:03,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-06 11:34:03,707 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:03,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:34:03,708 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-06 11:34:03,708 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:03,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:03,708 INFO L82 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 1 times [2021-05-06 11:34:03,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:03,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2136064444] [2021-05-06 11:34:03,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:03,711 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:03,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:03,782 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-06 11:34:03,782 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:03,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2136064444] [2021-05-06 11:34:03,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2136064444] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:03,783 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:03,783 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:34:03,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900221709] [2021-05-06 11:34:03,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:34:03,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:03,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:34:03,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:34:03,784 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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-06 11:34:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:04,028 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-05-06 11:34:04,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:34:04,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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 44 [2021-05-06 11:34:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:04,030 INFO L225 Difference]: With dead ends: 69 [2021-05-06 11:34:04,030 INFO L226 Difference]: Without dead ends: 67 [2021-05-06 11:34:04,030 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 164.0ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-06 11:34:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-06 11:34:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2021-05-06 11:34:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 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-06 11:34:04,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-05-06 11:34:04,042 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2021-05-06 11:34:04,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:04,042 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-05-06 11:34:04,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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-06 11:34:04,042 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-05-06 11:34:04,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-06 11:34:04,042 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:34:04,042 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 11:34:04,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-06 11:34:04,043 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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:34:04,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:34:04,043 INFO L82 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 1 times [2021-05-06 11:34:04,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:34:04,043 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1387831430] [2021-05-06 11:34:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:34:04,046 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2021-05-06 11:34:04,046 WARN L75 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-06 11:34:04,047 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:34:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:04,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:34:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:34:04,106 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-06 11:34:04,106 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:34:04,106 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1387831430] [2021-05-06 11:34:04,106 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1387831430] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:34:04,107 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:34:04,107 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:34:04,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029328845] [2021-05-06 11:34:04,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:34:04,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:34:04,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:34:04,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:34:04,108 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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-06 11:34:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:34:04,454 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2021-05-06 11:34:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 11:34:04,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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 49 [2021-05-06 11:34:04,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:34:04,455 INFO L225 Difference]: With dead ends: 75 [2021-05-06 11:34:04,455 INFO L226 Difference]: Without dead ends: 0 [2021-05-06 11:34:04,456 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 244.0ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-05-06 11:34:04,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-06 11:34:04,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-06 11:34:04,456 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-06 11:34:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-06 11:34:04,456 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2021-05-06 11:34:04,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:34:04,456 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-06 11:34:04,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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-06 11:34:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-06 11:34:04,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-06 11:34:04,457 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-06 11:34:04,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-06 11:34:04,686 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 101 [2021-05-06 11:34:05,408 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 151 [2021-05-06 11:34:05,881 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 141 [2021-05-06 11:34:06,267 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 40 [2021-05-06 11:34:06,533 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 57 [2021-05-06 11:34:06,696 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 43 [2021-05-06 11:34:07,260 WARN L205 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2021-05-06 11:34:07,379 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2021-05-06 11:34:07,912 WARN L205 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 70 [2021-05-06 11:34:08,154 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-05-06 11:34:08,281 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 34 [2021-05-06 11:34:08,558 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-05-06 11:34:08,816 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 77 [2021-05-06 11:34:09,059 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 64 [2021-05-06 11:34:09,168 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2021-05-06 11:34:09,419 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 37 [2021-05-06 11:34:09,607 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 37 [2021-05-06 11:34:09,721 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2021-05-06 11:34:09,981 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 72 [2021-05-06 11:34:10,335 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 64 [2021-05-06 11:34:10,540 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2021-05-06 11:34:10,736 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2021-05-06 11:34:10,739 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-06 11:34:10,739 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-06 11:34:10,739 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-06 11:34:10,740 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:34:10,740 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= ~__return_375~0 |old(~__return_375~0)|)) [2021-05-06 11:34:10,740 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:34:10,740 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:34:10,740 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-06 11:34:10,740 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-06 11:34:10,740 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:34:10,740 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-05-06 11:34:10,740 INFO L198 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-05-06 11:34:10,740 INFO L198 CegarLoopUtils]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2021-05-06 11:34:10,740 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-05-06 11:34:10,740 INFO L194 CegarLoopUtils]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) the Hoare annotation is: false [2021-05-06 11:34:10,741 INFO L194 CegarLoopUtils]: At program point mainEXIT(lines 13 439) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-06 11:34:10,741 INFO L194 CegarLoopUtils]: At program point L374(line 374) the Hoare annotation is: false [2021-05-06 11:34:10,741 INFO L194 CegarLoopUtils]: At program point L85(line 85) the Hoare annotation is: false [2021-05-06 11:34:10,741 INFO L194 CegarLoopUtils]: At program point L308(line 308) the Hoare annotation is: false [2021-05-06 11:34:10,741 INFO L194 CegarLoopUtils]: At program point L143(lines 143 362) the Hoare annotation is: (and (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (let ((.cse0 (< 0 main_~main__scheme~0)) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~16 0)) .cse2 .cse3) (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3))) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-06 11:34:10,741 INFO L194 CegarLoopUtils]: At program point L234(lines 234 338) the Hoare annotation is: (let ((.cse2 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse3 (< main_~main__cp~0 main_~main__urilen~0)) (.cse4 (< 0 main_~main__scheme~0)) (.cse5 (not (= main_~main__urilen~0 (+ main_~main__cp~0 1)))) (.cse6 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse8 (= main_~__VERIFIER_assert__cond~3 1)) (.cse9 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse10 (= |old(~__return_375~0)| ~__return_375~0)) (.cse11 (= main_~__VERIFIER_assert__cond~9 1)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse14 (<= 1 main_~main__cp~0)) (.cse15 (not (= main_~__VERIFIER_assert__cond~1 0)))) (let ((.cse0 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse17 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse18 (not (= main_~__VERIFIER_assert__cond~10 0)))) (or (and .cse2 .cse3 .cse4 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11 .cse12 .cse13 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse14 .cse15)))) (.cse1 (= main_~main__c~0 0))) (or (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse0) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 (= main_~__VERIFIER_assert__cond~8 1) .cse14 .cse15)))) [2021-05-06 11:34:10,741 INFO L194 CegarLoopUtils]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) the Hoare annotation is: false [2021-05-06 11:34:10,741 INFO L194 CegarLoopUtils]: At program point L135(lines 135 397) the Hoare annotation is: (let ((.cse0 (< main_~main__cp~0 main_~main__urilen~0)) (.cse1 (< 0 main_~main__scheme~0)) (.cse2 (not (= main_~main__urilen~0 (+ main_~main__cp~0 1)))) (.cse3 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse4 (= main_~__VERIFIER_assert__cond~3 1)) (.cse5 (= |old(~__return_375~0)| ~__return_375~0)) (.cse6 (<= 1 main_~main__cp~0)) (.cse7 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse4 (not (= main_~__VERIFIER_assert__cond~16 0)) (not (= main_~__VERIFIER_assert__cond~17 0)) .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~__VERIFIER_assert__cond~2 1) .cse5 .cse6 .cse7))) [2021-05-06 11:34:10,741 INFO L194 CegarLoopUtils]: At program point L226(line 226) the Hoare annotation is: false [2021-05-06 11:34:10,742 INFO L194 CegarLoopUtils]: At program point L61(lines 61 427) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-06 11:34:10,742 INFO L194 CegarLoopUtils]: At program point L284(line 284) the Hoare annotation is: false [2021-05-06 11:34:10,742 INFO L194 CegarLoopUtils]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) the Hoare annotation is: false [2021-05-06 11:34:10,742 INFO L194 CegarLoopUtils]: At program point L53(lines 53 433) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-06 11:34:10,742 INFO L194 CegarLoopUtils]: At program point L243(line 243) the Hoare annotation is: false [2021-05-06 11:34:10,742 INFO L194 CegarLoopUtils]: At program point L177(line 177) the Hoare annotation is: false [2021-05-06 11:34:10,742 INFO L194 CegarLoopUtils]: At program point L111(lines 111 405) the Hoare annotation is: (and (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~2 1) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0)) [2021-05-06 11:34:10,742 INFO L194 CegarLoopUtils]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) the Hoare annotation is: false [2021-05-06 11:34:10,742 INFO L194 CegarLoopUtils]: At program point L392(lines 129 403) the Hoare annotation is: (let ((.cse0 (< main_~main__cp~0 main_~main__urilen~0)) (.cse1 (< 0 main_~main__scheme~0)) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (= |old(~__return_375~0)| ~__return_375~0)) (.cse5 (<= 1 main_~main__cp~0)) (.cse6 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse3 (not (= main_~__VERIFIER_assert__cond~16 0)) (not (= main_~__VERIFIER_assert__cond~17 0)) .cse4 .cse5 .cse6))) [2021-05-06 11:34:10,742 INFO L194 CegarLoopUtils]: At program point L194(lines 194 354) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (< 0 main_~main__scheme~0)) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~16 0)) .cse2 .cse3) (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3))) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-06 11:34:10,742 INFO L194 CegarLoopUtils]: At program point L384(lines 384 393) the Hoare annotation is: (and (< main_~main__cp~0 main_~main__urilen~0) (< 0 main_~main__scheme~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~16 0)) (not (= main_~__VERIFIER_assert__cond~17 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-06 11:34:10,743 INFO L194 CegarLoopUtils]: At program point L95(lines 95 412) the Hoare annotation is: (and (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0)) [2021-05-06 11:34:10,743 INFO L194 CegarLoopUtils]: At program point L29(lines 29 437) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-06 11:34:10,743 INFO L194 CegarLoopUtils]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) the Hoare annotation is: false [2021-05-06 11:34:10,743 INFO L194 CegarLoopUtils]: At program point L145(line 145) the Hoare annotation is: false [2021-05-06 11:34:10,743 INFO L194 CegarLoopUtils]: At program point L401(lines 131 402) the Hoare annotation is: (and (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (< 0 main_~main__scheme~0)) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~16 0)) .cse2 .cse3) (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3))) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-06 11:34:10,743 INFO L194 CegarLoopUtils]: At program point mainFINAL(lines 13 439) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-06 11:34:10,743 INFO L194 CegarLoopUtils]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) the Hoare annotation is: false [2021-05-06 11:34:10,743 INFO L194 CegarLoopUtils]: At program point L104(lines 104 411) the Hoare annotation is: (and (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0)) [2021-05-06 11:34:10,743 INFO L194 CegarLoopUtils]: At program point L71(lines 71 416) the Hoare annotation is: (and (< 0 main_~main__scheme~0) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-06 11:34:10,743 INFO L194 CegarLoopUtils]: At program point L327(lines 262 328) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (= main_~__VERIFIER_assert__cond~9 1) (= |old(~__return_375~0)| ~__return_375~0) (let ((.cse0 (let ((.cse1 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse2 (< main_~main__cp~0 main_~main__urilen~0)) (.cse3 (< 0 main_~main__scheme~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse6 (not (= main_~main__urilen~0 (+ main_~main__cp~0 1)))) (.cse7 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~9 0))) (.cse9 (= main_~__VERIFIER_assert__cond~3 1)) (.cse10 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse11 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse14 (<= 1 main_~main__cp~0)) (.cse15 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse14 .cse15) (and .cse1 .cse2 .cse3 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0)) (and .cse0 (= main_~main__c~0 0))))) [2021-05-06 11:34:10,744 INFO L194 CegarLoopUtils]: At program point L294(lines 294 318) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~10 1) (< 0 main_~main__scheme~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (not (= main_~__VERIFIER_assert__cond~12 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-06 11:34:10,744 INFO L194 CegarLoopUtils]: At program point L162(lines 162 359) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (< 0 main_~main__scheme~0)) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~16 0)) .cse2 .cse3) (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3))) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-06 11:34:10,744 INFO L194 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) the Hoare annotation is: false [2021-05-06 11:34:10,744 INFO L194 CegarLoopUtils]: At program point L63(lines 63 422) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-06 11:34:10,744 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-06 11:34:10,744 INFO L194 CegarLoopUtils]: At program point L253(lines 253 329) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse1 (< main_~main__cp~0 main_~main__urilen~0)) (.cse2 (< 0 main_~main__scheme~0)) (.cse3 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse6 (not (= main_~main__urilen~0 (+ main_~main__cp~0 1)))) (.cse7 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse8 (= main_~__VERIFIER_assert__cond~3 1)) (.cse9 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse10 (= |old(~__return_375~0)| ~__return_375~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse12 (= main_~__VERIFIER_assert__cond~9 1)) (.cse13 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse14 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse15 (<= 1 main_~main__cp~0)) (.cse16 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= main_~main__c~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 main_~main__c~0) .cse11 .cse12 .cse13 .cse14 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse15 .cse16)))) [2021-05-06 11:34:10,744 INFO L194 CegarLoopUtils]: At program point L187(lines 187 355) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (< 0 main_~main__scheme~0)) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~16 0)) .cse2 .cse3) (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3))) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-06 11:34:10,744 INFO L194 CegarLoopUtils]: At program point L410(lines 104 411) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-06 11:34:10,744 INFO L194 CegarLoopUtils]: At program point L212(lines 212 346) the Hoare annotation is: (and (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (= main_~main__c~0 0) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~8 1) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-06 11:34:10,745 INFO L194 CegarLoopUtils]: At program point L113(line 113) the Hoare annotation is: false [2021-05-06 11:34:10,745 INFO L194 CegarLoopUtils]: At program point L47(lines 47 434) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-06 11:34:10,745 INFO L194 CegarLoopUtils]: At program point L270(lines 270 322) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (= main_~__VERIFIER_assert__cond~10 1) (< main_~main__cp~0 main_~main__urilen~0) (< 0 main_~main__scheme~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~12 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-06 11:34:10,745 INFO L194 CegarLoopUtils]: At program point L204(lines 204 353) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-06 11:34:10,745 INFO L194 CegarLoopUtils]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) the Hoare annotation is: false [2021-05-06 11:34:10,745 INFO L194 CegarLoopUtils]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) the Hoare annotation is: false [2021-05-06 11:34:10,745 INFO L194 CegarLoopUtils]: At program point L262(lines 262 328) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse1 (< main_~main__cp~0 main_~main__urilen~0)) (.cse2 (< 0 main_~main__scheme~0)) (.cse3 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse6 (not (= main_~main__urilen~0 (+ main_~main__cp~0 1)))) (.cse7 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse8 (= main_~__VERIFIER_assert__cond~3 1)) (.cse9 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse10 (= |old(~__return_375~0)| ~__return_375~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse12 (= main_~__VERIFIER_assert__cond~9 1)) (.cse13 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse14 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse15 (<= 1 main_~main__cp~0)) (.cse16 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= main_~main__c~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 main_~main__c~0) .cse11 .cse12 .cse13 .cse14 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse15 .cse16)))) [2021-05-06 11:34:10,745 INFO L194 CegarLoopUtils]: At program point L386(line 386) the Hoare annotation is: false [2021-05-06 11:34:10,745 INFO L194 CegarLoopUtils]: At program point L97(line 97) the Hoare annotation is: false [2021-05-06 11:34:10,745 INFO L194 CegarLoopUtils]: At program point L155(lines 155 360) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (< 0 main_~main__scheme~0)) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~16 0)) .cse2 .cse3) (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3))) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-06 11:34:10,746 INFO L194 CegarLoopUtils]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) the Hoare annotation is: false [2021-05-06 11:34:10,746 INFO L194 CegarLoopUtils]: At program point L23(lines 23 438) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-06 11:34:10,746 INFO L194 CegarLoopUtils]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) the Hoare annotation is: false [2021-05-06 11:34:10,746 INFO L194 CegarLoopUtils]: At program point L296(line 296) the Hoare annotation is: false [2021-05-06 11:34:10,746 INFO L194 CegarLoopUtils]: At program point L65(lines 65 417) the Hoare annotation is: (and (<= 0 main_~main__scheme~0) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-06 11:34:10,746 INFO L194 CegarLoopUtils]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) the Hoare annotation is: false [2021-05-06 11:34:10,746 INFO L194 CegarLoopUtils]: At program point L255(line 255) the Hoare annotation is: false [2021-05-06 11:34:10,746 INFO L194 CegarLoopUtils]: At program point L189(line 189) the Hoare annotation is: false [2021-05-06 11:34:10,746 INFO L194 CegarLoopUtils]: At program point L123(lines 123 403) the Hoare annotation is: (and (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= main_~__VERIFIER_assert__cond~2 1) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0)) [2021-05-06 11:34:10,746 INFO L194 CegarLoopUtils]: At program point L214(line 214) the Hoare annotation is: false [2021-05-06 11:34:10,746 INFO L194 CegarLoopUtils]: At program point L272(line 272) the Hoare annotation is: false [2021-05-06 11:34:10,746 INFO L194 CegarLoopUtils]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) the Hoare annotation is: false [2021-05-06 11:34:10,746 INFO L194 CegarLoopUtils]: At program point L41(lines 41 435) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-06 11:34:10,746 INFO L194 CegarLoopUtils]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) the Hoare annotation is: false [2021-05-06 11:34:10,746 INFO L194 CegarLoopUtils]: At program point L157(line 157) the Hoare annotation is: false [2021-05-06 11:34:10,747 INFO L194 CegarLoopUtils]: At program point L372(lines 372 395) the Hoare annotation is: (let ((.cse0 (< main_~main__cp~0 main_~main__urilen~0)) (.cse1 (< 0 main_~main__scheme~0)) (.cse2 (not (= main_~main__urilen~0 (+ main_~main__cp~0 1)))) (.cse3 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse4 (= main_~__VERIFIER_assert__cond~3 1)) (.cse5 (not (= main_~__VERIFIER_assert__cond~16 0))) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (<= 1 main_~main__cp~0)) (.cse8 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse4 .cse5 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~__VERIFIER_assert__cond~2 1) .cse5 .cse6 .cse7 .cse8))) [2021-05-06 11:34:10,747 INFO L194 CegarLoopUtils]: At program point L83(lines 83 414) the Hoare annotation is: (and (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__cp~0) (<= (+ main_~main__cp~0 1) main_~main__urilen~0)) [2021-05-06 11:34:10,747 INFO L194 CegarLoopUtils]: At program point L306(lines 306 316) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~10 1) (< 0 main_~main__scheme~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~15 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-06 11:34:10,747 INFO L194 CegarLoopUtils]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) the Hoare annotation is: false [2021-05-06 11:34:10,747 INFO L194 CegarLoopUtils]: At program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) the Hoare annotation is: false [2021-05-06 11:34:10,747 INFO L194 CegarLoopUtils]: At program point L224(lines 224 344) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (< 0 main_~main__scheme~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (= main_~__VERIFIER_assert__cond~3 1) (= main_~main__c~0 0) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0) (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~8 1) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-06 11:34:10,747 INFO L194 CegarLoopUtils]: At program point L125(line 125) the Hoare annotation is: false [2021-05-06 11:34:10,747 INFO L194 CegarLoopUtils]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) the Hoare annotation is: false [2021-05-06 11:34:10,747 INFO L194 CegarLoopUtils]: At program point L59(lines 59 432) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-06 11:34:10,748 INFO L194 CegarLoopUtils]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse10 (= main_~__VERIFIER_assert__cond~9 1)) (.cse6 (= main_~main__c~0 0)) (.cse0 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse1 (< main_~main__cp~0 main_~main__urilen~0)) (.cse2 (< 0 main_~main__scheme~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse7 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse9 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse11 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse12 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse8 (= |old(~__return_375~0)| ~__return_375~0))) (or (and (< (+ main_~main__cp~0 1) main_~main__urilen~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= main_~__VERIFIER_assert__cond~8 1) .cse14) (and .cse10 (let ((.cse15 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~9 0))) (.cse17 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse18 (not (= main_~__VERIFIER_assert__cond~10 0)))) (or (and .cse0 .cse1 .cse2 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse3 .cse4 .cse16 .cse17 .cse5 .cse7 .cse9 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse17 .cse5 .cse7 .cse9 .cse18 .cse11 .cse12 .cse13 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse14))))) (or (and .cse15 (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0)) (and .cse15 .cse6))) .cse8))) [2021-05-06 11:34:10,748 INFO L194 CegarLoopUtils]: At program point L282(lines 282 320) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~10 1) (< 0 main_~main__scheme~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-06 11:34:10,748 INFO L194 CegarLoopUtils]: At program point L241(lines 241 331) the Hoare annotation is: (let ((.cse19 (= main_~__VERIFIER_assert__cond~10 0))) (let ((.cse1 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse2 (< 0 main_~main__scheme~0)) (.cse3 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0)) (.cse4 (not (= main_~main__urilen~0 (+ main_~main__cp~0 1)))) (.cse5 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse6 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse9 (= main_~__VERIFIER_assert__cond~3 1)) (.cse8 (= main_~main__c~0 0)) (.cse16 (or (and (= main_~__VERIFIER_assert__cond~10 1) (< main_~main__cp~0 main_~main__urilen~0)) (and (<= main_~main__urilen~0 main_~main__cp~0) .cse19))) (.cse10 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse17 (= |old(~__return_375~0)| ~__return_375~0)) (.cse18 (not .cse19)) (.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse14 (<= 1 main_~main__cp~0)) (.cse15 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 (let ((.cse7 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse11 (not (= main_~__VERIFIER_assert__cond~8 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 (<= 1 main_~main__c~0) .cse11 .cse12 .cse13 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse14 .cse15))) .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse8 .cse16 .cse10 .cse17 .cse18 .cse0 .cse12 .cse13 (= main_~__VERIFIER_assert__cond~8 1) .cse14 .cse15)))) [2021-05-06 11:34:10,748 INFO L194 CegarLoopUtils]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) the Hoare annotation is: false [2021-05-06 11:34:10,748 INFO L194 CegarLoopUtils]: At program point L175(lines 175 357) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~6 0)) (= main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (< 0 main_~main__scheme~0)) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~16 0)) .cse2 .cse3) (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3))) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-06 11:34:10,748 INFO L194 CegarLoopUtils]: At program point L35(lines 35 436) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-06 11:34:10,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 11:34:10 BoogieIcfgContainer [2021-05-06 11:34:10,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 11:34:10,771 INFO L168 Benchmark]: Toolchain (without parser) took 15832.45 ms. Allocated memory was 191.9 MB in the beginning and 418.4 MB in the end (delta: 226.5 MB). Free memory was 156.2 MB in the beginning and 206.1 MB in the end (delta: -49.9 MB). Peak memory consumption was 241.1 MB. Max. memory is 8.0 GB. [2021-05-06 11:34:10,771 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 191.9 MB. Free memory is still 173.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 11:34:10,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.65 ms. Allocated memory is still 191.9 MB. Free memory was 156.0 MB in the beginning and 169.5 MB in the end (delta: -13.5 MB). Peak memory consumption was 17.2 MB. Max. memory is 8.0 GB. [2021-05-06 11:34:10,772 INFO L168 Benchmark]: Boogie Preprocessor took 53.54 ms. Allocated memory is still 191.9 MB. Free memory was 169.5 MB in the beginning and 167.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-06 11:34:10,772 INFO L168 Benchmark]: RCFGBuilder took 577.24 ms. Allocated memory is still 191.9 MB. Free memory was 167.4 MB in the beginning and 138.0 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 8.0 GB. [2021-05-06 11:34:10,772 INFO L168 Benchmark]: TraceAbstraction took 14876.37 ms. Allocated memory was 191.9 MB in the beginning and 418.4 MB in the end (delta: 226.5 MB). Free memory was 137.5 MB in the beginning and 206.1 MB in the end (delta: -68.6 MB). Peak memory consumption was 221.8 MB. Max. memory is 8.0 GB. [2021-05-06 11:34:10,772 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.15 ms. Allocated memory is still 191.9 MB. Free memory is still 173.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 319.65 ms. Allocated memory is still 191.9 MB. Free memory was 156.0 MB in the beginning and 169.5 MB in the end (delta: -13.5 MB). Peak memory consumption was 17.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 53.54 ms. Allocated memory is still 191.9 MB. Free memory was 169.5 MB in the beginning and 167.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 577.24 ms. Allocated memory is still 191.9 MB. Free memory was 167.4 MB in the beginning and 138.0 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 14876.37 ms. Allocated memory was 191.9 MB in the beginning and 418.4 MB in the end (delta: 226.5 MB). Free memory was 137.5 MB in the beginning and 206.1 MB in the end (delta: -68.6 MB). Peak memory consumption was 221.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: 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: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: 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: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 97]: 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, 94 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8522.4ms, OverallIterations: 23, TraceHistogramMax: 2, EmptinessCheckTime: 26.7ms, AutomataDifference: 6085.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 6281.6ms, InitialAbstractionConstructionTime: 13.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1302 SDtfs, 3732 SDslu, 283 SDs, 0 SdLazy, 2563 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2033.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3638.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 409.6ms AutomataMinimizationTime, 23 MinimizatonAttempts, 296 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 87 LocationsWithAnnotation, 87 PreInvPairs, 139 NumberOfFragments, 2932 HoareAnnotationTreeSize, 87 FomulaSimplifications, 1809936 FormulaSimplificationTreeSizeReduction, 1681.4ms HoareSimplificationTime, 87 FomulaSimplificationsInter, 208876 FormulaSimplificationTreeSizeReductionInter, 4579.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 18 specifications checked. All of them hold - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((((((main__cp + 1 < main__urilen && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && main__c == 0) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) || ((__VERIFIER_assert__cond == 1 && (((((((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__c) || (((((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0))) && \old(__return_375) == __return_375) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((main__cp < main__urilen && __VERIFIER_assert__cond == 1) && ((((((0 < main__scheme && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((0 < main__scheme && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)))) && \old(__return_375) == __return_375 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && (((((((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__c) || (((((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && main__c == 0)) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((main__cp < main__urilen && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((main__cp < main__urilen && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) && \old(__return_375) == __return_375 - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: !(__VERIFIER_assert__cond == 0) || \old(__return_375) == __return_375 RESULT: Ultimate proved your program to be correct! Received shutdown request...