/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.2-dev-5d317bd [2022-03-19 02:35:38,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 02:35:38,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 02:35:38,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 02:35:38,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 02:35:38,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 02:35:38,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 02:35:38,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 02:35:38,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 02:35:38,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 02:35:38,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 02:35:38,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 02:35:38,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 02:35:38,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 02:35:38,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 02:35:38,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 02:35:38,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 02:35:38,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 02:35:38,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 02:35:38,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 02:35:38,231 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 02:35:38,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 02:35:38,236 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 02:35:38,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 02:35:38,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 02:35:38,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 02:35:38,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 02:35:38,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 02:35:38,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 02:35:38,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 02:35:38,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 02:35:38,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 02:35:38,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 02:35:38,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 02:35:38,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 02:35:38,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 02:35:38,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 02:35:38,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 02:35:38,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 02:35:38,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 02:35:38,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 02:35:38,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 02:35:38,251 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-03-19 02:35:38,262 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 02:35:38,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 02:35:38,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 02:35:38,264 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-19 02:35:38,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 02:35:38,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-19 02:35:38,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 02:35:38,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 02:35:38,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 02:35:38,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 02:35:38,265 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-19 02:35:38,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 02:35:38,265 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 02:35:38,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 02:35:38,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 02:35:38,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 02:35:38,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-19 02:35:38,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 02:35:38,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 02:35:38,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 02:35:38,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-19 02:35:38,266 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-19 02:35:38,266 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-19 02:35:38,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 02:35:38,266 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-03-19 02:35:38,266 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; [2022-03-19 02:35:38,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 02:35:38,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 02:35:38,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 02:35:38,491 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 02:35:38,492 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 02:35:38,493 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 [2022-03-19 02:35:38,540 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c925437a3/b4c2178b4a2546a891292e256123ef70/FLAGd43b83d2b [2022-03-19 02:35:38,930 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 02:35:38,930 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-03-19 02:35:38,941 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c925437a3/b4c2178b4a2546a891292e256123ef70/FLAGd43b83d2b [2022-03-19 02:35:38,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c925437a3/b4c2178b4a2546a891292e256123ef70 [2022-03-19 02:35:38,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 02:35:38,961 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 02:35:38,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 02:35:38,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 02:35:38,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 02:35:38,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 02:35:38" (1/1) ... [2022-03-19 02:35:38,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2448fe1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:38, skipping insertion in model container [2022-03-19 02:35:38,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 02:35:38" (1/1) ... [2022-03-19 02:35:38,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 02:35:39,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 02:35:39,178 WARN L230 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] [2022-03-19 02:35:39,186 WARN L230 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] [2022-03-19 02:35:39,189 WARN L230 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] [2022-03-19 02:35:39,191 WARN L230 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] [2022-03-19 02:35:39,194 WARN L230 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] [2022-03-19 02:35:39,195 WARN L230 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] [2022-03-19 02:35:39,197 WARN L230 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] [2022-03-19 02:35:39,199 WARN L230 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] [2022-03-19 02:35:39,204 WARN L230 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] [2022-03-19 02:35:39,205 WARN L230 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] [2022-03-19 02:35:39,207 WARN L230 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] [2022-03-19 02:35:39,210 WARN L230 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] [2022-03-19 02:35:39,214 WARN L230 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] [2022-03-19 02:35:39,216 WARN L230 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] [2022-03-19 02:35:39,217 WARN L230 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] [2022-03-19 02:35:39,222 WARN L230 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] [2022-03-19 02:35:39,229 WARN L230 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] [2022-03-19 02:35:39,230 WARN L230 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] [2022-03-19 02:35:39,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 02:35:39,238 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 02:35:39,253 WARN L230 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] [2022-03-19 02:35:39,259 WARN L230 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] [2022-03-19 02:35:39,261 WARN L230 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] [2022-03-19 02:35:39,262 WARN L230 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] [2022-03-19 02:35:39,268 WARN L230 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] [2022-03-19 02:35:39,269 WARN L230 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] [2022-03-19 02:35:39,270 WARN L230 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] [2022-03-19 02:35:39,271 WARN L230 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] [2022-03-19 02:35:39,272 WARN L230 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] [2022-03-19 02:35:39,273 WARN L230 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] [2022-03-19 02:35:39,274 WARN L230 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] [2022-03-19 02:35:39,275 WARN L230 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] [2022-03-19 02:35:39,279 WARN L230 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] [2022-03-19 02:35:39,283 WARN L230 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] [2022-03-19 02:35:39,284 WARN L230 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] [2022-03-19 02:35:39,285 WARN L230 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] [2022-03-19 02:35:39,286 WARN L230 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] [2022-03-19 02:35:39,287 WARN L230 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] [2022-03-19 02:35:39,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 02:35:39,298 INFO L208 MainTranslator]: Completed translation [2022-03-19 02:35:39,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:39 WrapperNode [2022-03-19 02:35:39,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 02:35:39,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 02:35:39,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 02:35:39,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 02:35:39,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:39" (1/1) ... [2022-03-19 02:35:39,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:39" (1/1) ... [2022-03-19 02:35:39,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:39" (1/1) ... [2022-03-19 02:35:39,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:39" (1/1) ... [2022-03-19 02:35:39,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:39" (1/1) ... [2022-03-19 02:35:39,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:39" (1/1) ... [2022-03-19 02:35:39,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:39" (1/1) ... [2022-03-19 02:35:39,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 02:35:39,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 02:35:39,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 02:35:39,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 02:35:39,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:39" (1/1) ... [2022-03-19 02:35:39,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 02:35:39,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 02:35:39,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-19 02:35:39,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-19 02:35:39,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 02:35:39,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 02:35:39,409 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 02:35:39,409 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-19 02:35:39,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 02:35:39,409 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 02:35:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 02:35:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 02:35:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 02:35:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-19 02:35:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-19 02:35:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-19 02:35:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 02:35:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 02:35:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 02:35:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 02:35:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 02:35:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 02:35:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 02:35:39,488 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 02:35:39,489 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 02:35:39,725 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 02:35:39,730 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 02:35:39,730 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-19 02:35:39,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 02:35:39 BoogieIcfgContainer [2022-03-19 02:35:39,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 02:35:39,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 02:35:39,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 02:35:39,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 02:35:39,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 02:35:38" (1/3) ... [2022-03-19 02:35:39,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebef0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 02:35:39, skipping insertion in model container [2022-03-19 02:35:39,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:39" (2/3) ... [2022-03-19 02:35:39,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebef0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 02:35:39, skipping insertion in model container [2022-03-19 02:35:39,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 02:35:39" (3/3) ... [2022-03-19 02:35:39,737 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2022-03-19 02:35:39,741 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-19 02:35:39,741 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-03-19 02:35:39,769 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 02:35:39,773 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-19 02:35:39,773 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-03-19 02:35:39,783 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) [2022-03-19 02:35:39,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-19 02:35:39,788 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:39,788 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:35:39,788 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:39,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:39,792 INFO L85 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 1 times [2022-03-19 02:35:39,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:39,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1768632945] [2022-03-19 02:35:39,804 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:39,805 INFO L85 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 2 times [2022-03-19 02:35:39,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:39,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325665563] [2022-03-19 02:35:39,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:39,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:39,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:39,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:39,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325665563] [2022-03-19 02:35:39,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325665563] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:39,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:39,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 02:35:39,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:39,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1768632945] [2022-03-19 02:35:39,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1768632945] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:39,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:39,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 02:35:39,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109179092] [2022-03-19 02:35:39,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:39,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 02:35:39,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:39,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 02:35:39,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 02:35:39,968 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) [2022-03-19 02:35:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:40,045 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2022-03-19 02:35:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 02:35:40,047 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 [2022-03-19 02:35:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:40,052 INFO L225 Difference]: With dead ends: 93 [2022-03-19 02:35:40,052 INFO L226 Difference]: Without dead ends: 80 [2022-03-19 02:35:40,054 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 02:35:40,057 INFO L912 BasicCegarLoop]: 94 mSDtfsCounter, 170 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:40,057 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 105 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 02:35:40,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-03-19 02:35:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-03-19 02:35:40,086 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) [2022-03-19 02:35:40,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-03-19 02:35:40,088 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2022-03-19 02:35:40,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:40,089 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-03-19 02:35:40,089 INFO L479 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) [2022-03-19 02:35:40,089 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-03-19 02:35:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-19 02:35:40,089 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:40,090 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:35:40,090 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 02:35:40,090 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:40,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:40,091 INFO L85 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 1 times [2022-03-19 02:35:40,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:40,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1410358794] [2022-03-19 02:35:40,092 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:40,092 INFO L85 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 2 times [2022-03-19 02:35:40,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:40,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22666702] [2022-03-19 02:35:40,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:40,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:40,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:40,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22666702] [2022-03-19 02:35:40,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22666702] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:40,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:40,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:35:40,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:40,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1410358794] [2022-03-19 02:35:40,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1410358794] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:40,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:40,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:35:40,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679838433] [2022-03-19 02:35:40,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:40,159 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 02:35:40,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:40,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 02:35:40,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:35:40,160 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) [2022-03-19 02:35:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:40,266 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-03-19 02:35:40,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:35:40,267 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 [2022-03-19 02:35:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:40,268 INFO L225 Difference]: With dead ends: 80 [2022-03-19 02:35:40,268 INFO L226 Difference]: Without dead ends: 78 [2022-03-19 02:35:40,269 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-19 02:35:40,269 INFO L912 BasicCegarLoop]: 57 mSDtfsCounter, 319 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:40,270 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 74 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 02:35:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-03-19 02:35:40,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-03-19 02:35:40,282 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) [2022-03-19 02:35:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-03-19 02:35:40,283 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2022-03-19 02:35:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:40,283 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-03-19 02:35:40,283 INFO L479 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) [2022-03-19 02:35:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-03-19 02:35:40,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-19 02:35:40,284 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:40,284 INFO L500 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] [2022-03-19 02:35:40,284 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 02:35:40,284 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:40,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:40,295 INFO L85 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 1 times [2022-03-19 02:35:40,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:40,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1864370282] [2022-03-19 02:35:40,296 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:40,296 INFO L85 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 2 times [2022-03-19 02:35:40,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:40,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164725880] [2022-03-19 02:35:40,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:40,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:40,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:40,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:40,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164725880] [2022-03-19 02:35:40,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164725880] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:40,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:40,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:35:40,344 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:40,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1864370282] [2022-03-19 02:35:40,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1864370282] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:40,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:40,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:35:40,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421525545] [2022-03-19 02:35:40,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:40,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 02:35:40,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:40,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 02:35:40,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 02:35:40,346 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) [2022-03-19 02:35:40,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:40,471 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-03-19 02:35:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:35:40,471 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 [2022-03-19 02:35:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:40,472 INFO L225 Difference]: With dead ends: 101 [2022-03-19 02:35:40,472 INFO L226 Difference]: Without dead ends: 99 [2022-03-19 02:35:40,473 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-19 02:35:40,473 INFO L912 BasicCegarLoop]: 66 mSDtfsCounter, 207 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:40,474 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 78 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:35:40,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-03-19 02:35:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2022-03-19 02:35:40,489 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) [2022-03-19 02:35:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-03-19 02:35:40,490 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2022-03-19 02:35:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:40,490 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-03-19 02:35:40,490 INFO L479 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) [2022-03-19 02:35:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-03-19 02:35:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-19 02:35:40,491 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:40,491 INFO L500 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] [2022-03-19 02:35:40,491 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-19 02:35:40,491 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:40,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:40,492 INFO L85 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 1 times [2022-03-19 02:35:40,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:40,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2060150182] [2022-03-19 02:35:40,492 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:40,492 INFO L85 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 2 times [2022-03-19 02:35:40,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:40,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189620260] [2022-03-19 02:35:40,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:40,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:40,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:40,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189620260] [2022-03-19 02:35:40,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189620260] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:40,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:40,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:40,542 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:40,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2060150182] [2022-03-19 02:35:40,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2060150182] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:40,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:40,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:40,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236113463] [2022-03-19 02:35:40,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:40,543 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:40,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:40,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:40,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:40,544 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) [2022-03-19 02:35:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:40,628 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-03-19 02:35:40,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:35:40,629 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 [2022-03-19 02:35:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:40,630 INFO L225 Difference]: With dead ends: 76 [2022-03-19 02:35:40,630 INFO L226 Difference]: Without dead ends: 74 [2022-03-19 02:35:40,630 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-19 02:35:40,631 INFO L912 BasicCegarLoop]: 53 mSDtfsCounter, 234 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:40,631 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 70 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 02:35:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-03-19 02:35:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-03-19 02:35:40,642 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) [2022-03-19 02:35:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-03-19 02:35:40,643 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2022-03-19 02:35:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:40,643 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-03-19 02:35:40,643 INFO L479 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) [2022-03-19 02:35:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-03-19 02:35:40,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-19 02:35:40,644 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:40,644 INFO L500 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] [2022-03-19 02:35:40,644 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-19 02:35:40,644 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:40,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:40,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 1 times [2022-03-19 02:35:40,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:40,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1253519191] [2022-03-19 02:35:40,645 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:40,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 2 times [2022-03-19 02:35:40,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:40,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579993524] [2022-03-19 02:35:40,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:40,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:40,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:40,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:40,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579993524] [2022-03-19 02:35:40,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579993524] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:40,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:40,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:40,715 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:40,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1253519191] [2022-03-19 02:35:40,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1253519191] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:40,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:40,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:40,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548362995] [2022-03-19 02:35:40,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:40,723 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:40,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:40,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:40,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:40,724 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) [2022-03-19 02:35:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:40,969 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-03-19 02:35:40,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 02:35:40,970 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 [2022-03-19 02:35:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:40,972 INFO L225 Difference]: With dead ends: 141 [2022-03-19 02:35:40,972 INFO L226 Difference]: Without dead ends: 139 [2022-03-19 02:35:40,972 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-19 02:35:40,974 INFO L912 BasicCegarLoop]: 108 mSDtfsCounter, 235 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:40,975 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 125 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 02:35:40,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-03-19 02:35:41,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2022-03-19 02:35:41,003 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) [2022-03-19 02:35:41,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-03-19 02:35:41,004 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2022-03-19 02:35:41,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:41,005 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-03-19 02:35:41,005 INFO L479 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) [2022-03-19 02:35:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-03-19 02:35:41,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-19 02:35:41,006 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:41,006 INFO L500 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] [2022-03-19 02:35:41,006 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-19 02:35:41,006 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:41,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:41,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 1 times [2022-03-19 02:35:41,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:41,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2036757145] [2022-03-19 02:35:41,007 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:41,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 2 times [2022-03-19 02:35:41,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:41,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940227167] [2022-03-19 02:35:41,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:41,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:41,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:41,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:41,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940227167] [2022-03-19 02:35:41,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940227167] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:41,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:41,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:41,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:41,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2036757145] [2022-03-19 02:35:41,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2036757145] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:41,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:41,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:41,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944336162] [2022-03-19 02:35:41,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:41,094 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:41,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:41,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:41,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:41,094 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) [2022-03-19 02:35:41,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:41,295 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2022-03-19 02:35:41,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 02:35:41,296 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 [2022-03-19 02:35:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:41,297 INFO L225 Difference]: With dead ends: 108 [2022-03-19 02:35:41,297 INFO L226 Difference]: Without dead ends: 106 [2022-03-19 02:35:41,297 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-19 02:35:41,299 INFO L912 BasicCegarLoop]: 64 mSDtfsCounter, 220 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:41,300 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 81 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:35:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-03-19 02:35:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2022-03-19 02:35:41,320 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) [2022-03-19 02:35:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-03-19 02:35:41,323 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2022-03-19 02:35:41,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:41,324 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-03-19 02:35:41,325 INFO L479 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) [2022-03-19 02:35:41,325 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-03-19 02:35:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-19 02:35:41,325 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:41,325 INFO L500 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] [2022-03-19 02:35:41,325 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-19 02:35:41,326 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:41,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:41,326 INFO L85 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 1 times [2022-03-19 02:35:41,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:41,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1635369640] [2022-03-19 02:35:41,327 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:41,327 INFO L85 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 2 times [2022-03-19 02:35:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:41,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771741658] [2022-03-19 02:35:41,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:41,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:41,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:41,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:41,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771741658] [2022-03-19 02:35:41,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771741658] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:41,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:41,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:41,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:41,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1635369640] [2022-03-19 02:35:41,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1635369640] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:41,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:41,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:41,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336783298] [2022-03-19 02:35:41,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:41,414 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:41,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:41,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:41,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:41,415 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) [2022-03-19 02:35:41,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:41,558 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2022-03-19 02:35:41,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:35:41,559 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 [2022-03-19 02:35:41,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:41,560 INFO L225 Difference]: With dead ends: 121 [2022-03-19 02:35:41,560 INFO L226 Difference]: Without dead ends: 119 [2022-03-19 02:35:41,560 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-19 02:35:41,560 INFO L912 BasicCegarLoop]: 87 mSDtfsCounter, 215 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:41,561 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 104 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:35:41,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-03-19 02:35:41,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2022-03-19 02:35:41,574 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) [2022-03-19 02:35:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-03-19 02:35:41,574 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2022-03-19 02:35:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:41,575 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-03-19 02:35:41,575 INFO L479 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) [2022-03-19 02:35:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-03-19 02:35:41,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-19 02:35:41,575 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:41,575 INFO L500 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] [2022-03-19 02:35:41,576 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-19 02:35:41,576 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:41,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:41,576 INFO L85 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 1 times [2022-03-19 02:35:41,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:41,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [100850721] [2022-03-19 02:35:41,576 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:41,577 INFO L85 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 2 times [2022-03-19 02:35:41,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:41,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703772147] [2022-03-19 02:35:41,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:41,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:41,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:41,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:41,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:41,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703772147] [2022-03-19 02:35:41,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703772147] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:41,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:41,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:41,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:41,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [100850721] [2022-03-19 02:35:41,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [100850721] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:41,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:41,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:41,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183292993] [2022-03-19 02:35:41,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:41,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:41,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:41,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:41,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:41,645 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) [2022-03-19 02:35:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:41,747 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-03-19 02:35:41,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:35:41,747 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 [2022-03-19 02:35:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:41,748 INFO L225 Difference]: With dead ends: 77 [2022-03-19 02:35:41,748 INFO L226 Difference]: Without dead ends: 75 [2022-03-19 02:35:41,748 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-19 02:35:41,749 INFO L912 BasicCegarLoop]: 53 mSDtfsCounter, 197 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:41,749 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 70 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 02:35:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-03-19 02:35:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-03-19 02:35:41,759 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) [2022-03-19 02:35:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-03-19 02:35:41,760 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2022-03-19 02:35:41,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:41,761 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-03-19 02:35:41,761 INFO L479 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) [2022-03-19 02:35:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-03-19 02:35:41,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-19 02:35:41,765 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:41,765 INFO L500 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] [2022-03-19 02:35:41,765 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-19 02:35:41,766 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:41,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:41,766 INFO L85 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 1 times [2022-03-19 02:35:41,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:41,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [287760052] [2022-03-19 02:35:41,768 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:41,769 INFO L85 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 2 times [2022-03-19 02:35:41,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:41,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446789851] [2022-03-19 02:35:41,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:41,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:41,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:41,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:41,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446789851] [2022-03-19 02:35:41,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446789851] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:41,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:41,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 02:35:41,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:41,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [287760052] [2022-03-19 02:35:41,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [287760052] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:41,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:41,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 02:35:41,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558040773] [2022-03-19 02:35:41,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:41,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 02:35:41,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:41,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 02:35:41,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 02:35:41,803 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) [2022-03-19 02:35:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:41,883 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-03-19 02:35:41,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 02:35:41,883 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 [2022-03-19 02:35:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:41,884 INFO L225 Difference]: With dead ends: 115 [2022-03-19 02:35:41,884 INFO L226 Difference]: Without dead ends: 75 [2022-03-19 02:35:41,884 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 02:35:41,885 INFO L912 BasicCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:41,885 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 78 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:35:41,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-03-19 02:35:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-03-19 02:35:41,895 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) [2022-03-19 02:35:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-03-19 02:35:41,895 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2022-03-19 02:35:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:41,895 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-03-19 02:35:41,895 INFO L479 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) [2022-03-19 02:35:41,895 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-03-19 02:35:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-19 02:35:41,896 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:41,896 INFO L500 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] [2022-03-19 02:35:41,896 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-19 02:35:41,896 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:41,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 1 times [2022-03-19 02:35:41,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:41,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1548006696] [2022-03-19 02:35:41,897 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:41,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 2 times [2022-03-19 02:35:41,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:41,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140194256] [2022-03-19 02:35:41,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:41,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:41,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:41,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:41,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140194256] [2022-03-19 02:35:41,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140194256] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:41,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:41,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:41,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:41,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1548006696] [2022-03-19 02:35:41,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1548006696] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:41,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:41,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:41,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918953090] [2022-03-19 02:35:41,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:41,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:41,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:41,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:41,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:41,960 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) [2022-03-19 02:35:42,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:42,048 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-03-19 02:35:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:35:42,049 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 [2022-03-19 02:35:42,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:42,049 INFO L225 Difference]: With dead ends: 76 [2022-03-19 02:35:42,049 INFO L226 Difference]: Without dead ends: 74 [2022-03-19 02:35:42,049 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-03-19 02:35:42,050 INFO L912 BasicCegarLoop]: 50 mSDtfsCounter, 183 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:42,050 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 62 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 02:35:42,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-03-19 02:35:42,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-03-19 02:35:42,061 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) [2022-03-19 02:35:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-03-19 02:35:42,061 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2022-03-19 02:35:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:42,061 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-03-19 02:35:42,062 INFO L479 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) [2022-03-19 02:35:42,062 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-03-19 02:35:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-19 02:35:42,062 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:42,062 INFO L500 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] [2022-03-19 02:35:42,062 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-19 02:35:42,062 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:42,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:42,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 1 times [2022-03-19 02:35:42,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:42,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [8658172] [2022-03-19 02:35:42,063 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:42,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 2 times [2022-03-19 02:35:42,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:42,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140718286] [2022-03-19 02:35:42,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:42,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:42,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 02:35:42,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:42,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140718286] [2022-03-19 02:35:42,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140718286] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 02:35:42,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185390850] [2022-03-19 02:35:42,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 02:35:42,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 02:35:42,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 02:35:42,126 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 02:35:42,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-19 02:35:42,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 02:35:42,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 02:35:42,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-19 02:35:42,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 02:35:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 02:35:42,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 02:35:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 02:35:42,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185390850] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 02:35:42,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 02:35:42,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-03-19 02:35:42,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:42,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [8658172] [2022-03-19 02:35:42,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [8658172] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:42,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:42,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:42,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678213654] [2022-03-19 02:35:42,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:42,364 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:42,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:42,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:42,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:35:42,365 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) [2022-03-19 02:35:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:42,522 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-03-19 02:35:42,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:35:42,523 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 [2022-03-19 02:35:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:42,524 INFO L225 Difference]: With dead ends: 111 [2022-03-19 02:35:42,524 INFO L226 Difference]: Without dead ends: 109 [2022-03-19 02:35:42,525 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-03-19 02:35:42,525 INFO L912 BasicCegarLoop]: 75 mSDtfsCounter, 146 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:42,525 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 92 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:35:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-03-19 02:35:42,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2022-03-19 02:35:42,543 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) [2022-03-19 02:35:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-03-19 02:35:42,544 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2022-03-19 02:35:42,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:42,544 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-03-19 02:35:42,544 INFO L479 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) [2022-03-19 02:35:42,544 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-03-19 02:35:42,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-19 02:35:42,545 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:42,545 INFO L500 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] [2022-03-19 02:35:42,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-19 02:35:42,765 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-19 02:35:42,766 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:42,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:42,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 1 times [2022-03-19 02:35:42,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:42,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1272800169] [2022-03-19 02:35:42,767 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 2 times [2022-03-19 02:35:42,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:42,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289638371] [2022-03-19 02:35:42,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:42,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:42,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:42,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:42,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289638371] [2022-03-19 02:35:42,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289638371] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:42,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:42,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:42,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:42,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1272800169] [2022-03-19 02:35:42,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1272800169] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:42,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:42,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:42,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145581183] [2022-03-19 02:35:42,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:42,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:42,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:42,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:42,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:42,802 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) [2022-03-19 02:35:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:42,878 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-03-19 02:35:42,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:35:42,878 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 [2022-03-19 02:35:42,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:42,879 INFO L225 Difference]: With dead ends: 70 [2022-03-19 02:35:42,879 INFO L226 Difference]: Without dead ends: 68 [2022-03-19 02:35:42,879 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-19 02:35:42,879 INFO L912 BasicCegarLoop]: 43 mSDtfsCounter, 170 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:42,879 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 60 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 02:35:42,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-03-19 02:35:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-03-19 02:35:42,911 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) [2022-03-19 02:35:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-03-19 02:35:42,911 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2022-03-19 02:35:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:42,912 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-03-19 02:35:42,912 INFO L479 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) [2022-03-19 02:35:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-03-19 02:35:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-19 02:35:42,912 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:42,912 INFO L500 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] [2022-03-19 02:35:42,912 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-19 02:35:42,912 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:42,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 1 times [2022-03-19 02:35:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:42,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1199411411] [2022-03-19 02:35:42,913 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 2 times [2022-03-19 02:35:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:42,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159222745] [2022-03-19 02:35:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:42,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:42,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 02:35:42,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:42,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159222745] [2022-03-19 02:35:42,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159222745] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 02:35:42,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176628753] [2022-03-19 02:35:42,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 02:35:42,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 02:35:42,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 02:35:42,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 02:35:42,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-19 02:35:42,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 02:35:43,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 02:35:43,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-19 02:35:43,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 02:35:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 02:35:43,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 02:35:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 02:35:43,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176628753] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 02:35:43,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 02:35:43,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-03-19 02:35:43,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:43,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1199411411] [2022-03-19 02:35:43,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1199411411] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:43,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:43,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:43,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356611703] [2022-03-19 02:35:43,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:43,138 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:43,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:43,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:43,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:35:43,139 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) [2022-03-19 02:35:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:43,219 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-03-19 02:35:43,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:35:43,220 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 [2022-03-19 02:35:43,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:43,220 INFO L225 Difference]: With dead ends: 69 [2022-03-19 02:35:43,220 INFO L226 Difference]: Without dead ends: 67 [2022-03-19 02:35:43,221 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-03-19 02:35:43,221 INFO L912 BasicCegarLoop]: 44 mSDtfsCounter, 130 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:43,221 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 61 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 02:35:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-03-19 02:35:43,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-03-19 02:35:43,232 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) [2022-03-19 02:35:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-03-19 02:35:43,233 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2022-03-19 02:35:43,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:43,233 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-03-19 02:35:43,233 INFO L479 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) [2022-03-19 02:35:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-03-19 02:35:43,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-19 02:35:43,233 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:43,233 INFO L500 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] [2022-03-19 02:35:43,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-19 02:35:43,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-19 02:35:43,439 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:43,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:43,440 INFO L85 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 1 times [2022-03-19 02:35:43,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:43,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [307946852] [2022-03-19 02:35:43,440 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:43,440 INFO L85 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 2 times [2022-03-19 02:35:43,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:43,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204763814] [2022-03-19 02:35:43,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:43,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:43,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:43,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:43,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204763814] [2022-03-19 02:35:43,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204763814] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:43,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:43,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:43,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:43,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [307946852] [2022-03-19 02:35:43,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [307946852] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:43,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:43,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:43,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986204409] [2022-03-19 02:35:43,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:43,496 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:43,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:43,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:43,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:43,497 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) [2022-03-19 02:35:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:43,581 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-03-19 02:35:43,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:35:43,581 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 [2022-03-19 02:35:43,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:43,582 INFO L225 Difference]: With dead ends: 63 [2022-03-19 02:35:43,582 INFO L226 Difference]: Without dead ends: 61 [2022-03-19 02:35:43,582 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-03-19 02:35:43,582 INFO L912 BasicCegarLoop]: 42 mSDtfsCounter, 119 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:43,583 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 59 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 02:35:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-19 02:35:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-03-19 02:35:43,595 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) [2022-03-19 02:35:43,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-03-19 02:35:43,596 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2022-03-19 02:35:43,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:43,596 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-03-19 02:35:43,596 INFO L479 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) [2022-03-19 02:35:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-03-19 02:35:43,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-19 02:35:43,597 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:43,597 INFO L500 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] [2022-03-19 02:35:43,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-19 02:35:43,597 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:43,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:43,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 1 times [2022-03-19 02:35:43,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:43,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1783411241] [2022-03-19 02:35:43,598 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:43,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 2 times [2022-03-19 02:35:43,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:43,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837868592] [2022-03-19 02:35:43,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:43,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:43,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:43,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:43,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837868592] [2022-03-19 02:35:43,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837868592] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:43,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:43,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:35:43,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:43,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1783411241] [2022-03-19 02:35:43,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1783411241] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:43,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:43,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:35:43,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183393654] [2022-03-19 02:35:43,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:43,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 02:35:43,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:43,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 02:35:43,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:35:43,644 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) [2022-03-19 02:35:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:43,745 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-03-19 02:35:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:35:43,746 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 [2022-03-19 02:35:43,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:43,746 INFO L225 Difference]: With dead ends: 71 [2022-03-19 02:35:43,746 INFO L226 Difference]: Without dead ends: 69 [2022-03-19 02:35:43,748 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-19 02:35:43,748 INFO L912 BasicCegarLoop]: 40 mSDtfsCounter, 153 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:43,748 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 62 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:35:43,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-03-19 02:35:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-03-19 02:35:43,788 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) [2022-03-19 02:35:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-03-19 02:35:43,788 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2022-03-19 02:35:43,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:43,788 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-03-19 02:35:43,788 INFO L479 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) [2022-03-19 02:35:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-03-19 02:35:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-19 02:35:43,789 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:43,789 INFO L500 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] [2022-03-19 02:35:43,789 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-19 02:35:43,789 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:43,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:43,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 1 times [2022-03-19 02:35:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:43,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1992308261] [2022-03-19 02:35:43,790 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 2 times [2022-03-19 02:35:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:43,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372747358] [2022-03-19 02:35:43,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:43,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:43,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:43,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:43,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372747358] [2022-03-19 02:35:43,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372747358] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:43,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:43,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:43,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:43,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1992308261] [2022-03-19 02:35:43,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1992308261] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:43,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:43,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:43,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423010684] [2022-03-19 02:35:43,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:43,834 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:43,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:43,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:43,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:43,834 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) [2022-03-19 02:35:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:44,009 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-03-19 02:35:44,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 02:35:44,010 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 [2022-03-19 02:35:44,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:44,010 INFO L225 Difference]: With dead ends: 91 [2022-03-19 02:35:44,010 INFO L226 Difference]: Without dead ends: 89 [2022-03-19 02:35:44,011 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-03-19 02:35:44,011 INFO L912 BasicCegarLoop]: 43 mSDtfsCounter, 178 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:44,011 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 60 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:35:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-03-19 02:35:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-03-19 02:35:44,026 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) [2022-03-19 02:35:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-03-19 02:35:44,026 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2022-03-19 02:35:44,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:44,026 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-03-19 02:35:44,027 INFO L479 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) [2022-03-19 02:35:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-03-19 02:35:44,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-19 02:35:44,027 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:44,027 INFO L500 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] [2022-03-19 02:35:44,027 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-19 02:35:44,027 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:44,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:44,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 1 times [2022-03-19 02:35:44,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:44,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [363138142] [2022-03-19 02:35:44,028 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:44,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 2 times [2022-03-19 02:35:44,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:44,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347496294] [2022-03-19 02:35:44,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:44,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:44,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:44,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:44,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347496294] [2022-03-19 02:35:44,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347496294] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:44,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:44,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:44,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:44,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [363138142] [2022-03-19 02:35:44,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [363138142] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:44,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:44,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:44,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413992704] [2022-03-19 02:35:44,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:44,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:44,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:44,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:44,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:44,071 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) [2022-03-19 02:35:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:44,177 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-03-19 02:35:44,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:35:44,177 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 [2022-03-19 02:35:44,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:44,178 INFO L225 Difference]: With dead ends: 61 [2022-03-19 02:35:44,178 INFO L226 Difference]: Without dead ends: 59 [2022-03-19 02:35:44,178 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-19 02:35:44,178 INFO L912 BasicCegarLoop]: 50 mSDtfsCounter, 110 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:44,179 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 67 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 02:35:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-19 02:35:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-03-19 02:35:44,190 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) [2022-03-19 02:35:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-03-19 02:35:44,190 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2022-03-19 02:35:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:44,190 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-03-19 02:35:44,190 INFO L479 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) [2022-03-19 02:35:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-03-19 02:35:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-19 02:35:44,191 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:44,191 INFO L500 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] [2022-03-19 02:35:44,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-19 02:35:44,191 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:44,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:44,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 1 times [2022-03-19 02:35:44,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:44,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1317245504] [2022-03-19 02:35:44,192 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:44,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 2 times [2022-03-19 02:35:44,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:44,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259300876] [2022-03-19 02:35:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:44,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:44,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:44,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:44,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259300876] [2022-03-19 02:35:44,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259300876] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:44,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:44,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:35:44,219 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:44,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1317245504] [2022-03-19 02:35:44,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1317245504] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:44,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:44,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:35:44,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258245327] [2022-03-19 02:35:44,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:44,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 02:35:44,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:44,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 02:35:44,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 02:35:44,220 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) [2022-03-19 02:35:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:44,300 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-03-19 02:35:44,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:35:44,300 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 [2022-03-19 02:35:44,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:44,301 INFO L225 Difference]: With dead ends: 70 [2022-03-19 02:35:44,301 INFO L226 Difference]: Without dead ends: 68 [2022-03-19 02:35:44,301 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-19 02:35:44,301 INFO L912 BasicCegarLoop]: 65 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:44,302 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 77 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 02:35:44,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-03-19 02:35:44,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2022-03-19 02:35:44,313 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) [2022-03-19 02:35:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-03-19 02:35:44,313 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2022-03-19 02:35:44,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:44,313 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-03-19 02:35:44,313 INFO L479 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) [2022-03-19 02:35:44,314 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-03-19 02:35:44,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-19 02:35:44,314 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:44,314 INFO L500 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] [2022-03-19 02:35:44,314 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-19 02:35:44,314 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:44,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:44,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 1 times [2022-03-19 02:35:44,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:44,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [899859615] [2022-03-19 02:35:44,315 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:44,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 2 times [2022-03-19 02:35:44,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:44,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044432629] [2022-03-19 02:35:44,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:44,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:44,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:44,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:44,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044432629] [2022-03-19 02:35:44,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044432629] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:44,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:44,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:44,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:44,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [899859615] [2022-03-19 02:35:44,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [899859615] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:44,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:44,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:44,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102109246] [2022-03-19 02:35:44,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:44,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:44,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:44,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:44,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:44,346 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) [2022-03-19 02:35:44,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:44,440 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-03-19 02:35:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:35:44,440 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 [2022-03-19 02:35:44,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:44,441 INFO L225 Difference]: With dead ends: 66 [2022-03-19 02:35:44,441 INFO L226 Difference]: Without dead ends: 64 [2022-03-19 02:35:44,441 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-19 02:35:44,441 INFO L912 BasicCegarLoop]: 57 mSDtfsCounter, 91 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:44,442 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 74 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:35:44,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-03-19 02:35:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-03-19 02:35:44,469 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) [2022-03-19 02:35:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-03-19 02:35:44,469 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2022-03-19 02:35:44,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:44,469 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-03-19 02:35:44,470 INFO L479 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) [2022-03-19 02:35:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-03-19 02:35:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-19 02:35:44,470 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:44,470 INFO L500 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] [2022-03-19 02:35:44,470 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-19 02:35:44,470 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:44,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:44,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 1 times [2022-03-19 02:35:44,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:44,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [779699961] [2022-03-19 02:35:44,471 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:44,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 2 times [2022-03-19 02:35:44,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:44,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107197869] [2022-03-19 02:35:44,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:44,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:44,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:44,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:44,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107197869] [2022-03-19 02:35:44,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107197869] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:44,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:44,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:44,517 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:44,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [779699961] [2022-03-19 02:35:44,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [779699961] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:44,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:44,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:44,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327663849] [2022-03-19 02:35:44,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:44,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:44,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:44,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:44,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:44,518 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) [2022-03-19 02:35:44,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:44,694 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-03-19 02:35:44,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 02:35:44,694 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 [2022-03-19 02:35:44,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:44,695 INFO L225 Difference]: With dead ends: 88 [2022-03-19 02:35:44,695 INFO L226 Difference]: Without dead ends: 86 [2022-03-19 02:35:44,695 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-03-19 02:35:44,695 INFO L912 BasicCegarLoop]: 45 mSDtfsCounter, 123 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:44,696 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 62 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:35:44,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-03-19 02:35:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2022-03-19 02:35:44,708 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) [2022-03-19 02:35:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-03-19 02:35:44,708 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2022-03-19 02:35:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:44,708 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-03-19 02:35:44,709 INFO L479 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) [2022-03-19 02:35:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-03-19 02:35:44,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-19 02:35:44,709 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:44,709 INFO L500 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] [2022-03-19 02:35:44,709 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-19 02:35:44,709 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:44,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:44,709 INFO L85 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 1 times [2022-03-19 02:35:44,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:44,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [175930545] [2022-03-19 02:35:44,710 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 2 times [2022-03-19 02:35:44,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:44,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915504515] [2022-03-19 02:35:44,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:44,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:44,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:44,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:44,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915504515] [2022-03-19 02:35:44,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915504515] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 02:35:44,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521786260] [2022-03-19 02:35:44,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 02:35:44,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 02:35:44,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 02:35:44,751 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 02:35:44,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-19 02:35:44,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 02:35:44,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 02:35:44,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-19 02:35:44,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 02:35:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:44,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 02:35:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:44,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521786260] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 02:35:44,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 02:35:44,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-03-19 02:35:44,953 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:44,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [175930545] [2022-03-19 02:35:44,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [175930545] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:44,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:44,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:44,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294929527] [2022-03-19 02:35:44,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:44,954 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:44,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:44,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:44,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:35:44,954 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) [2022-03-19 02:35:45,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:45,035 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-03-19 02:35:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:35:45,035 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 [2022-03-19 02:35:45,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:45,036 INFO L225 Difference]: With dead ends: 60 [2022-03-19 02:35:45,036 INFO L226 Difference]: Without dead ends: 58 [2022-03-19 02:35:45,036 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-03-19 02:35:45,036 INFO L912 BasicCegarLoop]: 32 mSDtfsCounter, 84 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:45,037 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 49 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 02:35:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-03-19 02:35:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-03-19 02:35:45,048 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) [2022-03-19 02:35:45,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-03-19 02:35:45,049 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2022-03-19 02:35:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:45,049 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-03-19 02:35:45,049 INFO L479 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) [2022-03-19 02:35:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-03-19 02:35:45,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-19 02:35:45,049 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:45,049 INFO L500 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] [2022-03-19 02:35:45,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-19 02:35:45,259 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 02:35:45,260 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:45,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:45,260 INFO L85 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 1 times [2022-03-19 02:35:45,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:45,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1504548985] [2022-03-19 02:35:45,260 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:45,260 INFO L85 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 2 times [2022-03-19 02:35:45,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:45,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764950275] [2022-03-19 02:35:45,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:45,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:45,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:45,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:45,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764950275] [2022-03-19 02:35:45,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764950275] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:45,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:45,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:45,301 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:45,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1504548985] [2022-03-19 02:35:45,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1504548985] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:45,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:45,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:45,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988841572] [2022-03-19 02:35:45,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:45,302 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:45,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:45,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:45,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:45,303 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) [2022-03-19 02:35:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:45,426 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-03-19 02:35:45,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:35:45,428 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 [2022-03-19 02:35:45,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:45,428 INFO L225 Difference]: With dead ends: 69 [2022-03-19 02:35:45,428 INFO L226 Difference]: Without dead ends: 67 [2022-03-19 02:35:45,429 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-19 02:35:45,429 INFO L912 BasicCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:45,429 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 65 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 02:35:45,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-03-19 02:35:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2022-03-19 02:35:45,440 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) [2022-03-19 02:35:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-03-19 02:35:45,440 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2022-03-19 02:35:45,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:45,441 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-03-19 02:35:45,441 INFO L479 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) [2022-03-19 02:35:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-03-19 02:35:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-19 02:35:45,441 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:45,441 INFO L500 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] [2022-03-19 02:35:45,441 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-19 02:35:45,441 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-03-19 02:35:45,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:45,442 INFO L85 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 1 times [2022-03-19 02:35:45,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:45,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [26303841] [2022-03-19 02:35:45,442 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:45,442 INFO L85 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 2 times [2022-03-19 02:35:45,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:45,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613847481] [2022-03-19 02:35:45,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:45,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:45,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-19 02:35:45,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:45,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613847481] [2022-03-19 02:35:45,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613847481] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:45,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:45,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:45,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:45,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [26303841] [2022-03-19 02:35:45,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [26303841] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:45,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:45,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:45,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651749953] [2022-03-19 02:35:45,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:45,479 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:45,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:45,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:45,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:45,479 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) [2022-03-19 02:35:45,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:45,624 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-03-19 02:35:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 02:35:45,625 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 [2022-03-19 02:35:45,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:45,625 INFO L225 Difference]: With dead ends: 75 [2022-03-19 02:35:45,625 INFO L226 Difference]: Without dead ends: 0 [2022-03-19 02:35:45,626 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-03-19 02:35:45,627 INFO L912 BasicCegarLoop]: 38 mSDtfsCounter, 88 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:45,627 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 55 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:35:45,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-19 02:35:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-19 02:35:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-19 02:35:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-19 02:35:45,627 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-03-19 02:35:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:45,628 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-19 02:35:45,628 INFO L479 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) [2022-03-19 02:35:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-19 02:35:45,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-19 02:35:45,630 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-03-19 02:35:45,630 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-03-19 02:35:45,630 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-03-19 02:35:45,630 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-03-19 02:35:45,630 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-03-19 02:35:45,630 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-03-19 02:35:45,630 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-03-19 02:35:45,630 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-03-19 02:35:45,630 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-03-19 02:35:45,631 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-03-19 02:35:45,631 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-03-19 02:35:45,631 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-03-19 02:35:45,631 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-03-19 02:35:45,631 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-03-19 02:35:45,631 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-03-19 02:35:45,631 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-03-19 02:35:45,631 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-03-19 02:35:45,631 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-03-19 02:35:45,631 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-19 02:35:45,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-19 02:36:21,766 WARN L232 SmtUtils]: Spent 21.77s on a formula simplification. DAG size of input: 130 DAG size of output: 125 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-03-19 02:36:32,075 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-03-19 02:36:32,075 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-03-19 02:36:32,075 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-03-19 02:36:32,075 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-03-19 02:36:32,075 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-03-19 02:36:32,075 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-03-19 02:36:32,075 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-03-19 02:36:32,076 INFO L878 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) the Hoare annotation is: false [2022-03-19 02:36:32,076 INFO L878 garLoopResultBuilder]: 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)) [2022-03-19 02:36:32,076 INFO L878 garLoopResultBuilder]: At program point L374(line 374) the Hoare annotation is: false [2022-03-19 02:36:32,076 INFO L878 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: false [2022-03-19 02:36:32,076 INFO L878 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: false [2022-03-19 02:36:32,076 INFO L878 garLoopResultBuilder]: At program point L143(lines 143 362) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (<= main_~main__urilen~0 main_~main__cp~0)) (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= |old(~__return_375~0)| ~__return_375~0)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4 .cse5)))) [2022-03-19 02:36:32,076 INFO L878 garLoopResultBuilder]: At program point L234(lines 234 338) the Hoare annotation is: (let ((.cse2 (= main_~__VERIFIER_assert__cond~9 1)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse6 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse7 (= main_~__VERIFIER_assert__cond~3 1)) (.cse8 (= |old(~__return_375~0)| ~__return_375~0)) (.cse0 (= main_~main__c~0 0)) (.cse16 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse12 (< 0 main_~main__scheme~0)) (.cse13 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse14 (<= 1 main_~main__cp~0)) (.cse15 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and (let ((.cse1 (let ((.cse9 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and .cse0 .cse1) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse1))) (not (= main_~__VERIFIER_assert__cond~10 0)) .cse16) (and .cse2 .cse3 (= main_~__VERIFIER_assert__cond~8 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse16 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-03-19 02:36:32,076 INFO L878 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) the Hoare annotation is: false [2022-03-19 02:36:32,076 INFO L878 garLoopResultBuilder]: At program point L135(lines 135 397) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5))) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0)) [2022-03-19 02:36:32,076 INFO L878 garLoopResultBuilder]: At program point L226(line 226) the Hoare annotation is: false [2022-03-19 02:36:32,077 INFO L878 garLoopResultBuilder]: At program point L61(lines 61 427) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-03-19 02:36:32,077 INFO L878 garLoopResultBuilder]: At program point L284(line 284) the Hoare annotation is: false [2022-03-19 02:36:32,077 INFO L878 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) the Hoare annotation is: false [2022-03-19 02:36:32,077 INFO L878 garLoopResultBuilder]: At program point L53(lines 53 433) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-03-19 02:36:32,077 INFO L878 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: false [2022-03-19 02:36:32,077 INFO L878 garLoopResultBuilder]: At program point L177(line 177) the Hoare annotation is: false [2022-03-19 02:36:32,077 INFO L878 garLoopResultBuilder]: At program point L111(lines 111 405) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (= main_~__VERIFIER_assert__cond~2 1) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-03-19 02:36:32,077 INFO L878 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) the Hoare annotation is: false [2022-03-19 02:36:32,077 INFO L878 garLoopResultBuilder]: At program point L392(lines 129 403) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5))) (< main_~main__cp~0 main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0)) [2022-03-19 02:36:32,077 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 354) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0))) [2022-03-19 02:36:32,077 INFO L878 garLoopResultBuilder]: At program point L384(lines 384 393) the Hoare annotation is: (and (not (<= main_~main__scheme~0 0)) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~17 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~16 0)) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-03-19 02:36:32,077 INFO L878 garLoopResultBuilder]: At program point L95(lines 95 412) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-03-19 02:36:32,078 INFO L878 garLoopResultBuilder]: At program point L29(lines 29 437) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-03-19 02:36:32,078 INFO L878 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) the Hoare annotation is: false [2022-03-19 02:36:32,078 INFO L878 garLoopResultBuilder]: At program point L145(line 145) the Hoare annotation is: false [2022-03-19 02:36:32,078 INFO L878 garLoopResultBuilder]: At program point L401(lines 131 402) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (not (<= main_~main__urilen~0 main_~main__cp~0))) [2022-03-19 02:36:32,078 INFO L878 garLoopResultBuilder]: 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)) [2022-03-19 02:36:32,078 INFO L878 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) the Hoare annotation is: false [2022-03-19 02:36:32,078 INFO L878 garLoopResultBuilder]: At program point L104(lines 104 411) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-03-19 02:36:32,078 INFO L878 garLoopResultBuilder]: At program point L71(lines 71 416) the Hoare annotation is: (and (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0)) [2022-03-19 02:36:32,078 INFO L878 garLoopResultBuilder]: At program point L327(lines 262 328) the Hoare annotation is: (and (let ((.cse0 (let ((.cse1 (= main_~__VERIFIER_assert__cond~9 1)) (.cse2 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse6 (= main_~__VERIFIER_assert__cond~3 1)) (.cse7 (not (= main_~__VERIFIER_assert__cond~9 0))) (.cse8 (= |old(~__return_375~0)| ~__return_375~0)) (.cse9 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse11 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse13 (< 0 main_~main__scheme~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse15 (<= 1 main_~main__cp~0)) (.cse16 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and (= main_~main__c~0 0) .cse0) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse0))) (= main_~__VERIFIER_assert__cond~10 1)) [2022-03-19 02:36:32,078 INFO L878 garLoopResultBuilder]: At program point L294(lines 294 318) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~14 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-03-19 02:36:32,078 INFO L878 garLoopResultBuilder]: At program point L162(lines 162 359) the Hoare annotation is: (let ((.cse0 (let ((.cse6 (not (<= main_~main__scheme~0 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse9 (<= 1 main_~main__cp~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse6 .cse7 .cse8 (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0)) .cse9 .cse10) (and .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse9 .cse10)))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (= |old(~__return_375~0)| ~__return_375~0)) (.cse1 (+ main_~main__cp~0 1)) (.cse5 (not (= main_~__VERIFIER_assert__cond~5 0)))) (or (and .cse0 (= main_~main__urilen~0 .cse1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (< .cse1 main_~main__urilen~0) .cse5))) [2022-03-19 02:36:32,078 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) the Hoare annotation is: false [2022-03-19 02:36:32,079 INFO L878 garLoopResultBuilder]: At program point L63(lines 63 422) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-03-19 02:36:32,079 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-03-19 02:36:32,079 INFO L878 garLoopResultBuilder]: At program point L253(lines 253 329) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~main__c~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= main_~main__c~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2022-03-19 02:36:32,079 INFO L878 garLoopResultBuilder]: At program point L187(lines 187 355) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0))) [2022-03-19 02:36:32,079 INFO L878 garLoopResultBuilder]: 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)) [2022-03-19 02:36:32,079 INFO L878 garLoopResultBuilder]: At program point L212(lines 212 346) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (= main_~__VERIFIER_assert__cond~8 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (= main_~main__c~0 0) (< (+ 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~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-03-19 02:36:32,079 INFO L878 garLoopResultBuilder]: At program point L113(line 113) the Hoare annotation is: false [2022-03-19 02:36:32,079 INFO L878 garLoopResultBuilder]: At program point L47(lines 47 434) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-03-19 02:36:32,079 INFO L878 garLoopResultBuilder]: At program point L270(lines 270 322) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-03-19 02:36:32,079 INFO L878 garLoopResultBuilder]: At program point L204(lines 204 353) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ 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~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-03-19 02:36:32,079 INFO L878 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) the Hoare annotation is: false [2022-03-19 02:36:32,079 INFO L878 garLoopResultBuilder]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) the Hoare annotation is: false [2022-03-19 02:36:32,079 INFO L878 garLoopResultBuilder]: At program point L262(lines 262 328) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~main__c~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= main_~main__c~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2022-03-19 02:36:32,080 INFO L878 garLoopResultBuilder]: At program point L386(line 386) the Hoare annotation is: false [2022-03-19 02:36:32,080 INFO L878 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: false [2022-03-19 02:36:32,080 INFO L878 garLoopResultBuilder]: At program point L155(lines 155 360) the Hoare annotation is: (let ((.cse0 (let ((.cse6 (not (<= main_~main__scheme~0 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse9 (<= 1 main_~main__cp~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse6 .cse7 .cse8 (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0)) .cse9 .cse10) (and .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse9 .cse10)))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (= |old(~__return_375~0)| ~__return_375~0)) (.cse1 (+ main_~main__cp~0 1)) (.cse5 (not (= main_~__VERIFIER_assert__cond~5 0)))) (or (and .cse0 (= main_~main__urilen~0 .cse1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (< .cse1 main_~main__urilen~0) .cse5))) [2022-03-19 02:36:32,080 INFO L878 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) the Hoare annotation is: false [2022-03-19 02:36:32,080 INFO L878 garLoopResultBuilder]: At program point L23(lines 23 438) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-03-19 02:36:32,080 INFO L878 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) the Hoare annotation is: false [2022-03-19 02:36:32,080 INFO L878 garLoopResultBuilder]: At program point L296(line 296) the Hoare annotation is: false [2022-03-19 02:36:32,080 INFO L878 garLoopResultBuilder]: At program point L65(lines 65 417) the Hoare annotation is: (and (<= 0 main_~main__scheme~0) (= |old(~__return_375~0)| ~__return_375~0)) [2022-03-19 02:36:32,080 INFO L878 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) the Hoare annotation is: false [2022-03-19 02:36:32,080 INFO L878 garLoopResultBuilder]: At program point L255(line 255) the Hoare annotation is: false [2022-03-19 02:36:32,080 INFO L878 garLoopResultBuilder]: At program point L189(line 189) the Hoare annotation is: false [2022-03-19 02:36:32,080 INFO L878 garLoopResultBuilder]: At program point L123(lines 123 403) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (= main_~__VERIFIER_assert__cond~2 1) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-03-19 02:36:32,080 INFO L878 garLoopResultBuilder]: At program point L214(line 214) the Hoare annotation is: false [2022-03-19 02:36:32,080 INFO L878 garLoopResultBuilder]: At program point L272(line 272) the Hoare annotation is: false [2022-03-19 02:36:32,080 INFO L878 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) the Hoare annotation is: false [2022-03-19 02:36:32,080 INFO L878 garLoopResultBuilder]: At program point L41(lines 41 435) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-03-19 02:36:32,081 INFO L878 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) the Hoare annotation is: false [2022-03-19 02:36:32,081 INFO L878 garLoopResultBuilder]: At program point L157(line 157) the Hoare annotation is: false [2022-03-19 02:36:32,081 INFO L878 garLoopResultBuilder]: At program point L372(lines 372 395) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (not (= main_~__VERIFIER_assert__cond~16 0))) (.cse5 (<= 1 main_~main__cp~0)) (.cse6 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~__VERIFIER_assert__cond~2 1) .cse5 .cse6))) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0)) [2022-03-19 02:36:32,081 INFO L878 garLoopResultBuilder]: At program point L83(lines 83 414) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-03-19 02:36:32,081 INFO L878 garLoopResultBuilder]: At program point L306(lines 306 316) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~14 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~15 0))) [2022-03-19 02:36:32,081 INFO L878 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) the Hoare annotation is: false [2022-03-19 02:36:32,081 INFO L878 garLoopResultBuilder]: At program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) the Hoare annotation is: false [2022-03-19 02:36:32,081 INFO L878 garLoopResultBuilder]: At program point L224(lines 224 344) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (= main_~__VERIFIER_assert__cond~8 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (= main_~main__c~0 0) (< (+ 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~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-03-19 02:36:32,081 INFO L878 garLoopResultBuilder]: At program point L125(line 125) the Hoare annotation is: false [2022-03-19 02:36:32,081 INFO L878 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) the Hoare annotation is: false [2022-03-19 02:36:32,081 INFO L878 garLoopResultBuilder]: At program point L59(lines 59 432) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-03-19 02:36:32,081 INFO L878 garLoopResultBuilder]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse9 (= main_~main__c~0 0)) (.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (< main_~main__cp~0 main_~main__urilen~0)) (.cse6 (= main_~__VERIFIER_assert__cond~3 1)) (.cse7 (= |old(~__return_375~0)| ~__return_375~0)) (.cse8 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~8 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0) .cse10 .cse11 .cse12 .cse13 .cse14) (and (let ((.cse15 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse8 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse15) (and .cse9 .cse15))) (not (= main_~__VERIFIER_assert__cond~10 0))))) [2022-03-19 02:36:32,082 INFO L878 garLoopResultBuilder]: At program point L282(lines 282 320) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-03-19 02:36:32,082 INFO L878 garLoopResultBuilder]: At program point L241(lines 241 331) the Hoare annotation is: (let ((.cse14 (let ((.cse18 (<= main_~main__urilen~0 main_~main__cp~0))) (or (and (= main_~__VERIFIER_assert__cond~10 0) .cse18) (and (= main_~__VERIFIER_assert__cond~10 1) (not .cse18))))) (.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (= main_~main__c~0 0)) (.cse8 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse9 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse10 (< 0 main_~main__scheme~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse12 (<= 1 main_~main__cp~0)) (.cse13 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0))) (or (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~8 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse14 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse17 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~main__c~0) .cse16 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15)))))) [2022-03-19 02:36:32,082 INFO L878 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) the Hoare annotation is: false [2022-03-19 02:36:32,082 INFO L878 garLoopResultBuilder]: At program point L175(lines 175 357) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (not (= main_~__VERIFIER_assert__cond~4 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0))) [2022-03-19 02:36:32,082 INFO L878 garLoopResultBuilder]: At program point L35(lines 35 436) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-03-19 02:36:32,082 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-19 02:36:32,082 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-19 02:36:32,082 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-19 02:36:32,082 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-19 02:36:32,082 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-19 02:36:32,082 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-19 02:36:32,082 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-19 02:36:32,085 INFO L718 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-03-19 02:36:32,085 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-19 02:36:32,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 02:36:32 BoogieIcfgContainer [2022-03-19 02:36:32,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-19 02:36:32,101 INFO L158 Benchmark]: Toolchain (without parser) took 53140.86ms. Allocated memory was 161.5MB in the beginning and 545.3MB in the end (delta: 383.8MB). Free memory was 112.2MB in the beginning and 411.5MB in the end (delta: -299.2MB). Peak memory consumption was 308.4MB. Max. memory is 8.0GB. [2022-03-19 02:36:32,102 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 161.5MB. Free memory was 128.6MB in the beginning and 128.5MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-19 02:36:32,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.90ms. Allocated memory is still 161.5MB. Free memory was 112.0MB in the beginning and 128.3MB in the end (delta: -16.4MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-03-19 02:36:32,102 INFO L158 Benchmark]: Boogie Preprocessor took 43.22ms. Allocated memory is still 161.5MB. Free memory was 128.3MB in the beginning and 126.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-19 02:36:32,102 INFO L158 Benchmark]: RCFGBuilder took 388.91ms. Allocated memory is still 161.5MB. Free memory was 126.8MB in the beginning and 111.0MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-19 02:36:32,102 INFO L158 Benchmark]: TraceAbstraction took 52367.90ms. Allocated memory was 161.5MB in the beginning and 545.3MB in the end (delta: 383.8MB). Free memory was 110.5MB in the beginning and 411.5MB in the end (delta: -301.0MB). Peak memory consumption was 306.7MB. Max. memory is 8.0GB. [2022-03-19 02:36:32,103 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.11ms. Allocated memory is still 161.5MB. Free memory was 128.6MB in the beginning and 128.5MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 335.90ms. Allocated memory is still 161.5MB. Free memory was 112.0MB in the beginning and 128.3MB in the end (delta: -16.4MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.22ms. Allocated memory is still 161.5MB. Free memory was 128.3MB in the beginning and 126.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 388.91ms. Allocated memory is still 161.5MB. Free memory was 126.8MB in the beginning and 111.0MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 52367.90ms. Allocated memory was 161.5MB in the beginning and 545.3MB in the end (delta: 383.8MB). Free memory was 110.5MB in the beginning and 411.5MB in the end (delta: -301.0MB). Peak memory consumption was 306.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 85]: 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 - 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: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: 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: 255]: 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: 284]: 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: 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: 386]: 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. OverallTime: 52.3s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 46.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3590 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3590 mSDsluCounter, 1690 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 365 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2538 IncrementalHoareTripleChecker+Invalid, 2725 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 1325 mSDtfsCounter, 2538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 269 SyntacticMatches, 18 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.2s Time, 0.0s 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.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 296 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 87 LocationsWithAnnotation, 87 PreInvPairs, 140 NumberOfFragments, 2985 HoareAnnotationTreeSize, 87 FomulaSimplifications, 286041 FormulaSimplificationTreeSizeReduction, 43.4s HoareSimplificationTime, 87 FomulaSimplificationsInter, 619907 FormulaSimplificationTreeSizeReductionInter, 3.0s 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: 262]: Loop Invariant Derived loop invariant: ((main__c == 0 && (((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__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 == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen))) || ((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && (((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__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 == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)))) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && main__cp < main__urilen) && \old(__return_375) == __return_375 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(main__urilen <= main__cp) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) && \old(__return_375) == __return_375 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen))) || (main__c == 0 && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)))) && !(__VERIFIER_assert__cond == 0)) - 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! [2022-03-19 02:36:32,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...