/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-c225d54 [2021-05-02 23:30:03,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:30:03,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:30:03,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:30:03,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:30:03,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:30:03,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:30:03,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:30:03,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:30:03,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:30:03,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:30:03,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:30:03,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:30:03,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:30:03,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:30:03,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:30:03,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:30:03,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:30:03,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:30:03,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:30:03,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:30:03,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:30:03,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:30:03,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:30:03,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:30:03,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:30:03,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:30:03,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:30:03,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:30:03,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:30:03,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:30:03,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:30:03,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:30:03,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:30:03,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:30:03,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:30:03,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:30:03,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:30:03,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:30:03,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:30:03,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:30:03,123 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-02 23:30:03,137 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:30:03,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:30:03,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:30:03,140 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:30:03,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:30:03,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:30:03,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:30:03,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:30:03,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:30:03,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:30:03,142 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:30:03,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:30:03,142 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:30:03,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:30:03,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:30:03,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:30:03,143 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:30:03,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:30:03,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:30:03,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:30:03,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:30:03,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:30:03,143 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:30:03,143 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-02 23:30:03,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:30:03,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:30:03,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:30:03,463 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:30:03,464 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:30:03,464 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-02 23:30:03,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1503a907c/598834d4461f4036a460d25db51c3277/FLAG29a47569a [2021-05-02 23:30:03,916 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:30:03,919 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-05-02 23:30:03,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1503a907c/598834d4461f4036a460d25db51c3277/FLAG29a47569a [2021-05-02 23:30:03,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1503a907c/598834d4461f4036a460d25db51c3277 [2021-05-02 23:30:03,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:30:03,951 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:30:03,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:30:03,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:30:03,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:30:03,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:30:03" (1/1) ... [2021-05-02 23:30:03,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33136ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:03, skipping insertion in model container [2021-05-02 23:30:03,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:30:03" (1/1) ... [2021-05-02 23:30:03,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:30:03,998 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:30:04,130 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-02 23:30:04,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[1758,1771] [2021-05-02 23:30:04,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[2095,2108] [2021-05-02 23:30:04,149 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-02 23:30:04,152 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-02 23:30:04,155 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-02 23:30:04,156 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-02 23:30:04,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[3435,3448] [2021-05-02 23:30:04,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[3914,3927] [2021-05-02 23:30:04,166 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-02 23:30:04,168 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-02 23:30:04,170 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-02 23:30:04,174 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-02 23:30:04,177 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-02 23:30:04,180 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-02 23:30:04,202 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-02 23:30:04,204 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-02 23:30:04,205 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-02 23:30:04,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:30:04,213 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:30:04,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[1551,1564] [2021-05-02 23:30:04,256 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-02 23:30:04,257 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-02 23:30:04,258 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-02 23:30:04,259 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-02 23:30:04,260 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-02 23:30:04,261 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-02 23:30:04,261 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-02 23:30:04,263 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-02 23:30:04,265 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-02 23:30:04,273 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-02 23:30:04,278 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-02 23:30:04,280 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-02 23:30:04,281 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-02 23:30:04,282 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-02 23:30:04,283 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-02 23:30:04,284 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-02 23:30:04,285 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-02 23:30:04,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:30:04,300 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:30:04,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:04 WrapperNode [2021-05-02 23:30:04,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:30:04,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:30:04,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:30:04,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:30:04,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:04" (1/1) ... [2021-05-02 23:30:04,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:04" (1/1) ... [2021-05-02 23:30:04,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:04" (1/1) ... [2021-05-02 23:30:04,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:04" (1/1) ... [2021-05-02 23:30:04,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:04" (1/1) ... [2021-05-02 23:30:04,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:04" (1/1) ... [2021-05-02 23:30:04,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:04" (1/1) ... [2021-05-02 23:30:04,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:30:04,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:30:04,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:30:04,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:30:04,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:30:04,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:30:04,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:30:04,408 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:30:04,408 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 23:30:04,408 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:30:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:30:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:30:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:30:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:30:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 23:30:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:30:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 23:30:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:30:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:30:04,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:30:04,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:30:04,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:30:04,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:30:04,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:30:04,864 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:30:04,864 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-02 23:30:04,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:30:04 BoogieIcfgContainer [2021-05-02 23:30:04,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:30:04,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:30:04,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:30:04,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:30:04,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:30:03" (1/3) ... [2021-05-02 23:30:04,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6207072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:30:04, skipping insertion in model container [2021-05-02 23:30:04,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:30:04" (2/3) ... [2021-05-02 23:30:04,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6207072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:30:04, skipping insertion in model container [2021-05-02 23:30:04,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:30:04" (3/3) ... [2021-05-02 23:30:04,873 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2021-05-02 23:30:04,878 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:30:04,881 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2021-05-02 23:30:04,893 INFO L253 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-05-02 23:30:04,917 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:30:04,917 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:30:04,917 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:30:04,917 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:30:04,917 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:30:04,917 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:30:04,917 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:30:04,918 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:30:04,938 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-02 23:30:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 23:30:04,953 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:04,953 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:04,954 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-02 23:30:04,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:04,958 INFO L82 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 1 times [2021-05-02 23:30:04,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:04,964 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1988097958] [2021-05-02 23:30:04,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:05,010 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:05,142 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:05,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1988097958] [2021-05-02 23:30:05,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1988097958] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:05,143 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:05,144 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 23:30:05,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201903066] [2021-05-02 23:30:05,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 23:30:05,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:05,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 23:30:05,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 23:30:05,156 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-02 23:30:05,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:05,388 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2021-05-02 23:30:05,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:30:05,393 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-02 23:30:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:05,398 INFO L225 Difference]: With dead ends: 93 [2021-05-02 23:30:05,398 INFO L226 Difference]: Without dead ends: 80 [2021-05-02 23:30:05,400 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 90.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:30:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-05-02 23:30:05,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-05-02 23:30:05,482 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-02 23:30:05,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2021-05-02 23:30:05,486 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2021-05-02 23:30:05,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:05,486 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2021-05-02 23:30:05,486 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-02 23:30:05,486 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2021-05-02 23:30:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 23:30:05,487 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:05,487 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:05,487 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:30:05,487 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-02 23:30:05,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:05,488 INFO L82 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 1 times [2021-05-02 23:30:05,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:05,488 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1100546549] [2021-05-02 23:30:05,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:05,490 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:05,667 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:05,667 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1100546549] [2021-05-02 23:30:05,667 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1100546549] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:05,668 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:05,668 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:30:05,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627392845] [2021-05-02 23:30:05,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:30:05,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:05,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:30:05,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:30:05,669 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-02 23:30:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:06,058 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2021-05-02 23:30:06,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:30:06,059 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-02 23:30:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:06,063 INFO L225 Difference]: With dead ends: 80 [2021-05-02 23:30:06,063 INFO L226 Difference]: Without dead ends: 78 [2021-05-02 23:30:06,064 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 294.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:30:06,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-05-02 23:30:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-05-02 23:30:06,087 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-02 23:30:06,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2021-05-02 23:30:06,094 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2021-05-02 23:30:06,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:06,094 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2021-05-02 23:30:06,095 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-02 23:30:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2021-05-02 23:30:06,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-02 23:30:06,095 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:06,095 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:06,095 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:30:06,095 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-02 23:30:06,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:06,096 INFO L82 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 1 times [2021-05-02 23:30:06,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:06,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [383480511] [2021-05-02 23:30:06,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:06,102 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:06,186 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:06,186 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [383480511] [2021-05-02 23:30:06,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [383480511] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:06,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:06,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:30:06,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580151219] [2021-05-02 23:30:06,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:30:06,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:06,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:30:06,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:30:06,187 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-02 23:30:06,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:06,418 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2021-05-02 23:30:06,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:30:06,418 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-02 23:30:06,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:06,423 INFO L225 Difference]: With dead ends: 101 [2021-05-02 23:30:06,423 INFO L226 Difference]: Without dead ends: 99 [2021-05-02 23:30:06,424 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 102.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:30:06,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-02 23:30:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2021-05-02 23:30:06,436 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-02 23:30:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2021-05-02 23:30:06,437 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2021-05-02 23:30:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:06,437 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2021-05-02 23:30:06,437 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-02 23:30:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2021-05-02 23:30:06,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 23:30:06,437 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:06,438 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:06,438 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:30:06,438 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-02 23:30:06,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:06,438 INFO L82 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 1 times [2021-05-02 23:30:06,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:06,439 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [251957882] [2021-05-02 23:30:06,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:06,440 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:06,495 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:06,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [251957882] [2021-05-02 23:30:06,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [251957882] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:06,495 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:06,495 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:06,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597706895] [2021-05-02 23:30:06,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:06,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:06,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:06,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:06,496 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-02 23:30:06,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:06,705 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-05-02 23:30:06,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:30:06,705 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-02 23:30:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:06,707 INFO L225 Difference]: With dead ends: 76 [2021-05-02 23:30:06,707 INFO L226 Difference]: Without dead ends: 74 [2021-05-02 23:30:06,707 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 128.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:30:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-02 23:30:06,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-05-02 23:30:06,730 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-02 23:30:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-05-02 23:30:06,732 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2021-05-02 23:30:06,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:06,732 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-05-02 23:30:06,732 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-02 23:30:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-05-02 23:30:06,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-02 23:30:06,733 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:06,733 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-02 23:30:06,733 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:30:06,733 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-02 23:30:06,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:06,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 1 times [2021-05-02 23:30:06,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:06,734 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [178026821] [2021-05-02 23:30:06,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:06,736 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:06,824 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:06,824 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [178026821] [2021-05-02 23:30:06,824 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [178026821] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:06,824 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:06,825 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:06,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184355004] [2021-05-02 23:30:06,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:06,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:06,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:06,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:06,830 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-02 23:30:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:07,241 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2021-05-02 23:30:07,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:30:07,241 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-02 23:30:07,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:07,243 INFO L225 Difference]: With dead ends: 141 [2021-05-02 23:30:07,244 INFO L226 Difference]: Without dead ends: 139 [2021-05-02 23:30:07,245 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 195.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:30:07,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-02 23:30:07,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2021-05-02 23:30:07,289 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-02 23:30:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2021-05-02 23:30:07,290 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2021-05-02 23:30:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:07,290 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2021-05-02 23:30:07,290 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-02 23:30:07,290 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2021-05-02 23:30:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-02 23:30:07,291 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:07,291 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-02 23:30:07,291 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:30:07,291 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-02 23:30:07,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:07,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 1 times [2021-05-02 23:30:07,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:07,292 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [878178258] [2021-05-02 23:30:07,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:07,293 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:07,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:07,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:07,369 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:07,369 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [878178258] [2021-05-02 23:30:07,370 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [878178258] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:07,370 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:07,370 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:07,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991086946] [2021-05-02 23:30:07,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:07,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:07,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:07,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:07,371 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-02 23:30:07,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:07,722 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2021-05-02 23:30:07,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:30:07,722 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-02 23:30:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:07,724 INFO L225 Difference]: With dead ends: 108 [2021-05-02 23:30:07,724 INFO L226 Difference]: Without dead ends: 106 [2021-05-02 23:30:07,724 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 192.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:30:07,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-05-02 23:30:07,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2021-05-02 23:30:07,737 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-02 23:30:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2021-05-02 23:30:07,737 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2021-05-02 23:30:07,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:07,739 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2021-05-02 23:30:07,739 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-02 23:30:07,739 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2021-05-02 23:30:07,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 23:30:07,740 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:07,740 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-02 23:30:07,740 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 23:30:07,740 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-02 23:30:07,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:07,741 INFO L82 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 1 times [2021-05-02 23:30:07,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:07,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1104934271] [2021-05-02 23:30:07,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:07,743 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:07,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:07,818 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:07,818 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1104934271] [2021-05-02 23:30:07,818 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1104934271] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:07,818 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:07,819 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:07,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97965703] [2021-05-02 23:30:07,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:07,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:07,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:07,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:07,820 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-02 23:30:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:08,102 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2021-05-02 23:30:08,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:30:08,103 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-02 23:30:08,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:08,104 INFO L225 Difference]: With dead ends: 121 [2021-05-02 23:30:08,104 INFO L226 Difference]: Without dead ends: 119 [2021-05-02 23:30:08,105 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 154.7ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:30:08,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-02 23:30:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2021-05-02 23:30:08,117 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-02 23:30:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2021-05-02 23:30:08,118 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2021-05-02 23:30:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:08,118 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2021-05-02 23:30:08,118 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-02 23:30:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2021-05-02 23:30:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 23:30:08,121 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:08,121 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-02 23:30:08,121 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:30:08,121 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-02 23:30:08,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:08,122 INFO L82 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 1 times [2021-05-02 23:30:08,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:08,122 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2016907610] [2021-05-02 23:30:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:08,124 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:08,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:08,201 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:08,204 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2016907610] [2021-05-02 23:30:08,205 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2016907610] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:08,206 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:08,207 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:08,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409146377] [2021-05-02 23:30:08,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:08,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:08,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:08,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:08,208 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-02 23:30:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:08,406 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2021-05-02 23:30:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:30:08,407 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-02 23:30:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:08,407 INFO L225 Difference]: With dead ends: 77 [2021-05-02 23:30:08,407 INFO L226 Difference]: Without dead ends: 75 [2021-05-02 23:30:08,408 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 149.1ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:30:08,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-02 23:30:08,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-02 23:30:08,417 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-02 23:30:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2021-05-02 23:30:08,418 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2021-05-02 23:30:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:08,418 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2021-05-02 23:30:08,418 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-02 23:30:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2021-05-02 23:30:08,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 23:30:08,418 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:08,419 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-02 23:30:08,419 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 23:30:08,419 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-02 23:30:08,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:08,419 INFO L82 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 1 times [2021-05-02 23:30:08,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:08,419 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1839117885] [2021-05-02 23:30:08,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:08,421 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:08,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:08,462 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:08,463 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1839117885] [2021-05-02 23:30:08,463 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1839117885] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:08,463 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:08,463 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 23:30:08,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089686578] [2021-05-02 23:30:08,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 23:30:08,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:08,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 23:30:08,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 23:30:08,465 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-02 23:30:08,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:08,607 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2021-05-02 23:30:08,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 23:30:08,608 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-02 23:30:08,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:08,608 INFO L225 Difference]: With dead ends: 115 [2021-05-02 23:30:08,609 INFO L226 Difference]: Without dead ends: 75 [2021-05-02 23:30:08,610 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:30:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-02 23:30:08,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-02 23:30:08,623 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-02 23:30:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-05-02 23:30:08,624 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2021-05-02 23:30:08,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:08,624 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-05-02 23:30:08,624 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-02 23:30:08,624 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-05-02 23:30:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-02 23:30:08,625 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:08,625 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-02 23:30:08,625 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 23:30:08,625 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-02 23:30:08,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:08,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 1 times [2021-05-02 23:30:08,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:08,626 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [835745061] [2021-05-02 23:30:08,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:08,628 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:08,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:08,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:08,706 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:08,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [835745061] [2021-05-02 23:30:08,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [835745061] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:08,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:08,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:08,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62468905] [2021-05-02 23:30:08,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:08,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:08,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:08,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:08,707 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-02 23:30:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:08,893 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-05-02 23:30:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:30:08,894 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-02 23:30:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:08,894 INFO L225 Difference]: With dead ends: 76 [2021-05-02 23:30:08,894 INFO L226 Difference]: Without dead ends: 74 [2021-05-02 23:30:08,895 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 128.7ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:30:08,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-02 23:30:08,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2021-05-02 23:30:08,908 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-02 23:30:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2021-05-02 23:30:08,909 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2021-05-02 23:30:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:08,909 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2021-05-02 23:30:08,909 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-02 23:30:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2021-05-02 23:30:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-02 23:30:08,910 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:08,910 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-02 23:30:08,910 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 23:30:08,910 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-02 23:30:08,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:08,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 1 times [2021-05-02 23:30:08,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:08,911 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1113507699] [2021-05-02 23:30:08,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:08,927 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:30:08,928 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:08,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:08,980 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:08,981 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1113507699] [2021-05-02 23:30:08,981 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1113507699] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:08,981 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:08,981 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:08,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620571907] [2021-05-02 23:30:08,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:08,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:08,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:08,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:08,982 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-02 23:30:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:09,170 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-05-02 23:30:09,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:30:09,170 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-02 23:30:09,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:09,171 INFO L225 Difference]: With dead ends: 111 [2021-05-02 23:30:09,171 INFO L226 Difference]: Without dead ends: 109 [2021-05-02 23:30:09,172 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 98.3ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:30:09,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-02 23:30:09,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2021-05-02 23:30:09,182 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-02 23:30:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-05-02 23:30:09,183 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2021-05-02 23:30:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:09,183 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-05-02 23:30:09,183 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-02 23:30:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-05-02 23:30:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-02 23:30:09,183 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:09,183 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-02 23:30:09,184 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 23:30:09,184 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-02 23:30:09,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:09,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 1 times [2021-05-02 23:30:09,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:09,184 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [68413298] [2021-05-02 23:30:09,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:09,186 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:09,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:09,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:09,247 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:09,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [68413298] [2021-05-02 23:30:09,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [68413298] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:09,248 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:09,248 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:09,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955900272] [2021-05-02 23:30:09,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:09,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:09,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:09,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:09,249 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-02 23:30:09,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:09,398 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2021-05-02 23:30:09,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:30:09,398 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-02 23:30:09,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:09,400 INFO L225 Difference]: With dead ends: 70 [2021-05-02 23:30:09,400 INFO L226 Difference]: Without dead ends: 68 [2021-05-02 23:30:09,400 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 108.0ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:30:09,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-02 23:30:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-05-02 23:30:09,411 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-02 23:30:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-05-02 23:30:09,412 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2021-05-02 23:30:09,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:09,413 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-05-02 23:30:09,413 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-02 23:30:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-05-02 23:30:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-02 23:30:09,416 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:09,416 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-02 23:30:09,417 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 23:30:09,417 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-02 23:30:09,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:09,417 INFO L82 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 1 times [2021-05-02 23:30:09,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:09,418 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [238015124] [2021-05-02 23:30:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:09,422 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:30:09,423 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:09,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:09,476 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:09,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [238015124] [2021-05-02 23:30:09,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [238015124] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:09,476 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:09,476 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:09,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300280793] [2021-05-02 23:30:09,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:09,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:09,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:09,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:09,477 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-02 23:30:09,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:09,636 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2021-05-02 23:30:09,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:30:09,641 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-02 23:30:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:09,641 INFO L225 Difference]: With dead ends: 69 [2021-05-02 23:30:09,642 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 23:30:09,642 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 105.8ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:30:09,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 23:30:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2021-05-02 23:30:09,652 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-02 23:30:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2021-05-02 23:30:09,653 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2021-05-02 23:30:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:09,653 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2021-05-02 23:30:09,653 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-02 23:30:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2021-05-02 23:30:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-02 23:30:09,653 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:09,654 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-02 23:30:09,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 23:30:09,654 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-02 23:30:09,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:09,654 INFO L82 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 1 times [2021-05-02 23:30:09,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:09,654 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1541249728] [2021-05-02 23:30:09,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:09,656 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:09,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:09,725 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:09,725 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1541249728] [2021-05-02 23:30:09,725 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1541249728] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:09,725 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:09,725 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:09,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617323435] [2021-05-02 23:30:09,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:09,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:09,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:09,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:09,726 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-02 23:30:09,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:09,891 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2021-05-02 23:30:09,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:30:09,891 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-02 23:30:09,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:09,892 INFO L225 Difference]: With dead ends: 63 [2021-05-02 23:30:09,892 INFO L226 Difference]: Without dead ends: 61 [2021-05-02 23:30:09,892 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 113.0ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:30:09,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-02 23:30:09,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2021-05-02 23:30:09,902 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-02 23:30:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2021-05-02 23:30:09,902 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2021-05-02 23:30:09,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:09,903 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-05-02 23:30:09,903 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-02 23:30:09,903 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2021-05-02 23:30:09,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 23:30:09,904 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:09,904 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-02 23:30:09,904 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 23:30:09,905 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-02 23:30:09,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:09,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 1 times [2021-05-02 23:30:09,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:09,905 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1629097437] [2021-05-02 23:30:09,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:09,907 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:09,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:09,985 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:09,985 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1629097437] [2021-05-02 23:30:09,985 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1629097437] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:09,985 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:09,985 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:30:09,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016174782] [2021-05-02 23:30:09,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:30:09,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:09,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:30:09,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:30:09,986 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-02 23:30:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:10,170 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2021-05-02 23:30:10,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:30:10,171 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-02 23:30:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:10,171 INFO L225 Difference]: With dead ends: 71 [2021-05-02 23:30:10,171 INFO L226 Difference]: Without dead ends: 69 [2021-05-02 23:30:10,173 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 120.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:30:10,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-02 23:30:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2021-05-02 23:30:10,182 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-02 23:30:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2021-05-02 23:30:10,182 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2021-05-02 23:30:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:10,182 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2021-05-02 23:30:10,182 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-02 23:30:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2021-05-02 23:30:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-05-02 23:30:10,183 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:10,183 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-02 23:30:10,184 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 23:30:10,184 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-02 23:30:10,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:10,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 1 times [2021-05-02 23:30:10,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:10,184 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [602647873] [2021-05-02 23:30:10,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:10,186 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:10,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:10,246 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:10,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [602647873] [2021-05-02 23:30:10,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [602647873] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:10,246 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:10,246 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:10,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801678225] [2021-05-02 23:30:10,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:10,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:10,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:10,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:10,247 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-02 23:30:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:10,562 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2021-05-02 23:30:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:30:10,562 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-02 23:30:10,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:10,563 INFO L225 Difference]: With dead ends: 91 [2021-05-02 23:30:10,563 INFO L226 Difference]: Without dead ends: 89 [2021-05-02 23:30:10,563 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 193.1ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:30:10,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-02 23:30:10,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2021-05-02 23:30:10,574 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-02 23:30:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2021-05-02 23:30:10,574 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2021-05-02 23:30:10,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:10,574 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2021-05-02 23:30:10,574 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-02 23:30:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2021-05-02 23:30:10,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-02 23:30:10,575 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:10,575 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-02 23:30:10,575 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 23:30:10,575 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-02 23:30:10,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:10,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 1 times [2021-05-02 23:30:10,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:10,576 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1793164870] [2021-05-02 23:30:10,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:10,577 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:10,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:10,633 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:10,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1793164870] [2021-05-02 23:30:10,633 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1793164870] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:10,633 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:10,633 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:10,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128789138] [2021-05-02 23:30:10,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:10,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:10,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:10,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:10,634 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-02 23:30:10,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:10,838 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2021-05-02 23:30:10,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:30:10,838 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-02 23:30:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:10,839 INFO L225 Difference]: With dead ends: 61 [2021-05-02 23:30:10,839 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 23:30:10,839 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 143.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:30:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 23:30:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-02 23:30:10,848 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-02 23:30:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2021-05-02 23:30:10,849 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2021-05-02 23:30:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:10,849 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2021-05-02 23:30:10,849 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-02 23:30:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2021-05-02 23:30:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-02 23:30:10,849 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:10,850 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-02 23:30:10,850 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 23:30:10,850 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-02 23:30:10,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:10,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 1 times [2021-05-02 23:30:10,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:10,850 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [32934010] [2021-05-02 23:30:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:10,852 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:10,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:10,890 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:10,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [32934010] [2021-05-02 23:30:10,891 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [32934010] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:10,891 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:10,891 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:30:10,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029180631] [2021-05-02 23:30:10,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:30:10,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:10,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:30:10,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:30:10,891 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-02 23:30:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:11,054 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2021-05-02 23:30:11,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:30:11,054 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-02 23:30:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:11,055 INFO L225 Difference]: With dead ends: 70 [2021-05-02 23:30:11,055 INFO L226 Difference]: Without dead ends: 68 [2021-05-02 23:30:11,055 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 86.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:30:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-02 23:30:11,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2021-05-02 23:30:11,064 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-02 23:30:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2021-05-02 23:30:11,065 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2021-05-02 23:30:11,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:11,065 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2021-05-02 23:30:11,065 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-02 23:30:11,065 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2021-05-02 23:30:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-05-02 23:30:11,065 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:11,065 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-02 23:30:11,065 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-02 23:30:11,066 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-02 23:30:11,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:11,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 1 times [2021-05-02 23:30:11,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:11,066 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [770115819] [2021-05-02 23:30:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:11,067 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:11,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:11,116 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:11,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [770115819] [2021-05-02 23:30:11,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [770115819] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:11,116 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:11,116 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:11,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349724057] [2021-05-02 23:30:11,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:11,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:11,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:11,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:11,117 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-02 23:30:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:11,264 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-05-02 23:30:11,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:30:11,264 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-02 23:30:11,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:11,265 INFO L225 Difference]: With dead ends: 66 [2021-05-02 23:30:11,265 INFO L226 Difference]: Without dead ends: 64 [2021-05-02 23:30:11,265 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 79.0ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:30:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-02 23:30:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2021-05-02 23:30:11,274 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-02 23:30:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-05-02 23:30:11,275 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2021-05-02 23:30:11,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:11,275 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-05-02 23:30:11,275 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-02 23:30:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2021-05-02 23:30:11,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-02 23:30:11,275 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:11,275 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-02 23:30:11,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 23:30:11,275 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-02 23:30:11,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:11,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 1 times [2021-05-02 23:30:11,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:11,276 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [931871481] [2021-05-02 23:30:11,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:11,277 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:11,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:11,326 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:11,326 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [931871481] [2021-05-02 23:30:11,326 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [931871481] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:11,326 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:11,326 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:11,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878343324] [2021-05-02 23:30:11,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:11,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:11,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:11,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:11,327 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-02 23:30:11,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:11,611 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2021-05-02 23:30:11,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:30:11,611 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-02 23:30:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:11,612 INFO L225 Difference]: With dead ends: 88 [2021-05-02 23:30:11,612 INFO L226 Difference]: Without dead ends: 86 [2021-05-02 23:30:11,613 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 174.8ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:30:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-05-02 23:30:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2021-05-02 23:30:11,626 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-02 23:30:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2021-05-02 23:30:11,627 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2021-05-02 23:30:11,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:11,627 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2021-05-02 23:30:11,627 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-02 23:30:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2021-05-02 23:30:11,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-02 23:30:11,628 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:11,628 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-02 23:30:11,628 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-02 23:30:11,628 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-02 23:30:11,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:11,628 INFO L82 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 1 times [2021-05-02 23:30:11,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:11,628 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [9058961] [2021-05-02 23:30:11,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:11,631 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:30:11,632 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:11,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:11,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-02 23:30:11,687 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:11,687 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [9058961] [2021-05-02 23:30:11,687 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [9058961] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:11,687 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:11,687 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:11,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649233825] [2021-05-02 23:30:11,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:11,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:11,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:11,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:11,688 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-02 23:30:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:11,840 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2021-05-02 23:30:11,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:30:11,841 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-02 23:30:11,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:11,841 INFO L225 Difference]: With dead ends: 60 [2021-05-02 23:30:11,841 INFO L226 Difference]: Without dead ends: 58 [2021-05-02 23:30:11,842 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 108.2ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:30:11,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-02 23:30:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-05-02 23:30:11,853 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-02 23:30:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2021-05-02 23:30:11,853 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2021-05-02 23:30:11,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:11,853 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2021-05-02 23:30:11,853 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-02 23:30:11,853 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2021-05-02 23:30:11,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-02 23:30:11,854 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:11,854 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-02 23:30:11,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-02 23:30:11,854 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-02 23:30:11,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:11,854 INFO L82 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 1 times [2021-05-02 23:30:11,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:11,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [67699226] [2021-05-02 23:30:11,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:11,856 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:11,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:11,907 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:11,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [67699226] [2021-05-02 23:30:11,907 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [67699226] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:11,907 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:11,907 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:11,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554938917] [2021-05-02 23:30:11,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:11,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:11,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:11,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:11,908 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-02 23:30:12,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:12,125 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-05-02 23:30:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:30:12,127 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-02 23:30:12,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:12,127 INFO L225 Difference]: With dead ends: 69 [2021-05-02 23:30:12,127 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 23:30:12,127 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 152.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:30:12,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 23:30:12,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2021-05-02 23:30:12,137 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-02 23:30:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-05-02 23:30:12,138 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2021-05-02 23:30:12,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:12,138 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-05-02 23:30:12,138 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-02 23:30:12,138 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-05-02 23:30:12,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-02 23:30:12,138 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:12,138 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-02 23:30:12,138 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-02 23:30:12,139 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-02 23:30:12,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:12,139 INFO L82 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 1 times [2021-05-02 23:30:12,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:12,139 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [357673543] [2021-05-02 23:30:12,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:12,143 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-02 23:30:12,144 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:30:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:12,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:12,193 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:12,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [357673543] [2021-05-02 23:30:12,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [357673543] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:12,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:12,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:30:12,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319829262] [2021-05-02 23:30:12,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:30:12,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:12,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:30:12,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:30:12,194 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-02 23:30:12,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:12,512 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2021-05-02 23:30:12,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:30:12,513 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-02 23:30:12,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:12,513 INFO L225 Difference]: With dead ends: 75 [2021-05-02 23:30:12,513 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 23:30:12,514 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 237.9ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:30:12,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 23:30:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 23:30:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-02 23:30:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 23:30:12,514 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2021-05-02 23:30:12,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:12,514 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 23:30:12,514 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-02 23:30:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 23:30:12,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 23:30:12,515 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-02 23:30:12,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 23:30:13,651 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 141 [2021-05-02 23:30:13,785 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 133 [2021-05-02 23:30:14,283 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 57 [2021-05-02 23:30:14,420 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 43 [2021-05-02 23:30:14,952 WARN L205 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2021-05-02 23:30:15,068 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2021-05-02 23:30:15,187 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 42 [2021-05-02 23:30:15,625 WARN L205 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 70 [2021-05-02 23:30:15,872 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-05-02 23:30:15,996 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 34 [2021-05-02 23:30:16,258 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-05-02 23:30:16,521 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 77 [2021-05-02 23:30:16,759 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 64 [2021-05-02 23:30:16,863 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2021-05-02 23:30:17,102 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 37 [2021-05-02 23:30:17,279 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 37 [2021-05-02 23:30:17,396 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2021-05-02 23:30:17,643 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 72 [2021-05-02 23:30:18,006 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 64 [2021-05-02 23:30:18,112 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 30 [2021-05-02 23:30:18,220 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2021-05-02 23:30:18,375 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2021-05-02 23:30:18,379 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-02 23:30:18,379 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-02 23:30:18,379 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-02 23:30:18,379 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:30:18,379 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-02 23:30:18,379 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:30:18,379 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:30:18,379 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 23:30:18,379 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 23:30:18,379 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:30:18,379 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-05-02 23:30:18,379 INFO L198 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-05-02 23:30:18,379 INFO L198 CegarLoopUtils]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2021-05-02 23:30:18,379 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-05-02 23:30:18,380 INFO L194 CegarLoopUtils]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) the Hoare annotation is: false [2021-05-02 23:30:18,380 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-02 23:30:18,380 INFO L194 CegarLoopUtils]: At program point L374(line 374) the Hoare annotation is: false [2021-05-02 23:30:18,380 INFO L194 CegarLoopUtils]: At program point L85(line 85) the Hoare annotation is: false [2021-05-02 23:30:18,380 INFO L194 CegarLoopUtils]: At program point L308(line 308) the Hoare annotation is: false [2021-05-02 23:30:18,380 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-02 23:30:18,380 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-02 23:30:18,380 INFO L194 CegarLoopUtils]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) the Hoare annotation is: false [2021-05-02 23:30:18,380 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-02 23:30:18,380 INFO L194 CegarLoopUtils]: At program point L226(line 226) the Hoare annotation is: false [2021-05-02 23:30:18,380 INFO L194 CegarLoopUtils]: At program point L61(lines 61 427) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-02 23:30:18,380 INFO L194 CegarLoopUtils]: At program point L284(line 284) the Hoare annotation is: false [2021-05-02 23:30:18,380 INFO L194 CegarLoopUtils]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) the Hoare annotation is: false [2021-05-02 23:30:18,380 INFO L194 CegarLoopUtils]: At program point L53(lines 53 433) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-02 23:30:18,381 INFO L194 CegarLoopUtils]: At program point L243(line 243) the Hoare annotation is: false [2021-05-02 23:30:18,381 INFO L194 CegarLoopUtils]: At program point L177(line 177) the Hoare annotation is: false [2021-05-02 23:30:18,381 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-02 23:30:18,381 INFO L194 CegarLoopUtils]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) the Hoare annotation is: false [2021-05-02 23:30:18,381 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-02 23:30:18,381 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-02 23:30:18,381 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-02 23:30:18,381 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-02 23:30:18,381 INFO L194 CegarLoopUtils]: At program point L29(lines 29 437) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-02 23:30:18,381 INFO L194 CegarLoopUtils]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) the Hoare annotation is: false [2021-05-02 23:30:18,381 INFO L194 CegarLoopUtils]: At program point L145(line 145) the Hoare annotation is: false [2021-05-02 23:30:18,381 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-02 23:30:18,381 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-02 23:30:18,381 INFO L194 CegarLoopUtils]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) the Hoare annotation is: false [2021-05-02 23:30:18,382 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-02 23:30:18,382 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-02 23:30:18,382 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-02 23:30:18,382 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-02 23:30:18,382 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-02 23:30:18,382 INFO L194 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) the Hoare annotation is: false [2021-05-02 23:30:18,382 INFO L194 CegarLoopUtils]: At program point L63(lines 63 422) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-02 23:30:18,382 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-02 23:30:18,382 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-02 23:30:18,382 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-02 23:30:18,382 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-02 23:30:18,383 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-02 23:30:18,383 INFO L194 CegarLoopUtils]: At program point L113(line 113) the Hoare annotation is: false [2021-05-02 23:30:18,383 INFO L194 CegarLoopUtils]: At program point L47(lines 47 434) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-02 23:30:18,383 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-02 23:30:18,383 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-02 23:30:18,383 INFO L194 CegarLoopUtils]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) the Hoare annotation is: false [2021-05-02 23:30:18,383 INFO L194 CegarLoopUtils]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) the Hoare annotation is: false [2021-05-02 23:30:18,383 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-02 23:30:18,383 INFO L194 CegarLoopUtils]: At program point L386(line 386) the Hoare annotation is: false [2021-05-02 23:30:18,383 INFO L194 CegarLoopUtils]: At program point L97(line 97) the Hoare annotation is: false [2021-05-02 23:30:18,383 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-02 23:30:18,383 INFO L194 CegarLoopUtils]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) the Hoare annotation is: false [2021-05-02 23:30:18,383 INFO L194 CegarLoopUtils]: At program point L23(lines 23 438) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-02 23:30:18,383 INFO L194 CegarLoopUtils]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) the Hoare annotation is: false [2021-05-02 23:30:18,383 INFO L194 CegarLoopUtils]: At program point L296(line 296) the Hoare annotation is: false [2021-05-02 23:30:18,384 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-02 23:30:18,384 INFO L194 CegarLoopUtils]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) the Hoare annotation is: false [2021-05-02 23:30:18,384 INFO L194 CegarLoopUtils]: At program point L255(line 255) the Hoare annotation is: false [2021-05-02 23:30:18,384 INFO L194 CegarLoopUtils]: At program point L189(line 189) the Hoare annotation is: false [2021-05-02 23:30:18,384 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-02 23:30:18,384 INFO L194 CegarLoopUtils]: At program point L214(line 214) the Hoare annotation is: false [2021-05-02 23:30:18,384 INFO L194 CegarLoopUtils]: At program point L272(line 272) the Hoare annotation is: false [2021-05-02 23:30:18,384 INFO L194 CegarLoopUtils]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) the Hoare annotation is: false [2021-05-02 23:30:18,384 INFO L194 CegarLoopUtils]: At program point L41(lines 41 435) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-02 23:30:18,384 INFO L194 CegarLoopUtils]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) the Hoare annotation is: false [2021-05-02 23:30:18,384 INFO L194 CegarLoopUtils]: At program point L157(line 157) the Hoare annotation is: false [2021-05-02 23:30:18,384 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-02 23:30:18,384 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-02 23:30:18,384 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-02 23:30:18,384 INFO L194 CegarLoopUtils]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) the Hoare annotation is: false [2021-05-02 23:30:18,384 INFO L194 CegarLoopUtils]: At program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) the Hoare annotation is: false [2021-05-02 23:30:18,385 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-02 23:30:18,385 INFO L194 CegarLoopUtils]: At program point L125(line 125) the Hoare annotation is: false [2021-05-02 23:30:18,385 INFO L194 CegarLoopUtils]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) the Hoare annotation is: false [2021-05-02 23:30:18,385 INFO L194 CegarLoopUtils]: At program point L59(lines 59 432) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-02 23:30:18,385 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-02 23:30:18,385 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-02 23:30:18,385 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-02 23:30:18,385 INFO L194 CegarLoopUtils]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) the Hoare annotation is: false [2021-05-02 23:30:18,385 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-02 23:30:18,385 INFO L194 CegarLoopUtils]: At program point L35(lines 35 436) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-02 23:30:18,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:30:18 BoogieIcfgContainer [2021-05-02 23:30:18,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 23:30:18,404 INFO L168 Benchmark]: Toolchain (without parser) took 14452.66 ms. Allocated memory was 204.5 MB in the beginning and 555.7 MB in the end (delta: 351.3 MB). Free memory was 168.7 MB in the beginning and 334.8 MB in the end (delta: -166.1 MB). Peak memory consumption was 319.9 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:18,404 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 204.5 MB. Free memory is still 185.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 23:30:18,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.60 ms. Allocated memory is still 204.5 MB. Free memory was 168.5 MB in the beginning and 182.2 MB in the end (delta: -13.7 MB). Peak memory consumption was 16.2 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:18,404 INFO L168 Benchmark]: Boogie Preprocessor took 43.30 ms. Allocated memory is still 204.5 MB. Free memory was 182.2 MB in the beginning and 180.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:18,404 INFO L168 Benchmark]: RCFGBuilder took 518.76 ms. Allocated memory is still 204.5 MB. Free memory was 180.7 MB in the beginning and 150.8 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.4 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:18,404 INFO L168 Benchmark]: TraceAbstraction took 13535.65 ms. Allocated memory was 204.5 MB in the beginning and 555.7 MB in the end (delta: 351.3 MB). Free memory was 150.8 MB in the beginning and 334.8 MB in the end (delta: -184.0 MB). Peak memory consumption was 302.5 MB. Max. memory is 8.0 GB. [2021-05-02 23:30:18,405 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.12 ms. Allocated memory is still 204.5 MB. Free memory is still 185.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 346.60 ms. Allocated memory is still 204.5 MB. Free memory was 168.5 MB in the beginning and 182.2 MB in the end (delta: -13.7 MB). Peak memory consumption was 16.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.30 ms. Allocated memory is still 204.5 MB. Free memory was 182.2 MB in the beginning and 180.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 518.76 ms. Allocated memory is still 204.5 MB. Free memory was 180.7 MB in the beginning and 150.8 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13535.65 ms. Allocated memory was 204.5 MB in the beginning and 555.7 MB in the end (delta: 351.3 MB). Free memory was 150.8 MB in the beginning and 334.8 MB in the end (delta: -184.0 MB). Peak memory consumption was 302.5 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: 7600.4ms, OverallIterations: 23, TraceHistogramMax: 2, EmptinessCheckTime: 32.2ms, AutomataDifference: 5361.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 5863.0ms, InitialAbstractionConstructionTime: 16.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1302 SDtfs, 3732 SDslu, 283 SDs, 0 SdLazy, 2563 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1738.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3194.4ms 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: 377.3ms AutomataMinimizationTime, 23 MinimizatonAttempts, 296 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 87 LocationsWithAnnotation, 87 PreInvPairs, 139 NumberOfFragments, 2932 HoareAnnotationTreeSize, 87 FomulaSimplifications, 1809936 FormulaSimplificationTreeSizeReduction, 1424.9ms HoareSimplificationTime, 87 FomulaSimplificationsInter, 208876 FormulaSimplificationTreeSizeReductionInter, 4413.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...